./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 331deff5ee9f0a6f0b03656a3ea7e4b679f07dd47c7d7e953a5847c9d589ff92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:53:35,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:53:35,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:53:35,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:53:35,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:53:35,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:53:35,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:53:35,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:53:35,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:53:35,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:53:35,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:53:35,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:53:35,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:53:35,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:53:35,556 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:53:35,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:53:35,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:53:35,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:53:35,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:53:35,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:53:35,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:53:35,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:53:35,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:53:35,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:53:35,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:53:35,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:53:35,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:53:35,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:53:35,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:53:35,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:53:35,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:53:35,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:53:35,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:53:35,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:53:35,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:53:35,558 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:53:35,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:53:35,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:53:35,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:53:35,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:53:35,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:53:35,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:53:35,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:53:35,559 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 331deff5ee9f0a6f0b03656a3ea7e4b679f07dd47c7d7e953a5847c9d589ff92 [2025-03-03 23:53:35,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:53:35,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:53:35,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:53:35,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:53:35,781 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:53:35,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i [2025-03-03 23:53:36,921 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50a5a16d4/820247dbbc7842a0b9391e5c763ac0a0/FLAGdb9f936f3 [2025-03-03 23:53:37,166 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:53:37,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i [2025-03-03 23:53:37,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50a5a16d4/820247dbbc7842a0b9391e5c763ac0a0/FLAGdb9f936f3 [2025-03-03 23:53:37,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50a5a16d4/820247dbbc7842a0b9391e5c763ac0a0 [2025-03-03 23:53:37,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:53:37,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:53:37,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:53:37,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:53:37,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:53:37,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e147525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37, skipping insertion in model container [2025-03-03 23:53:37,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:53:37,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i[916,929] [2025-03-03 23:53:37,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:53:37,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:53:37,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i[916,929] [2025-03-03 23:53:37,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:53:37,473 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:53:37,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37 WrapperNode [2025-03-03 23:53:37,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:53:37,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:53:37,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:53:37,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:53:37,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,523 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2025-03-03 23:53:37,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:53:37,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:53:37,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:53:37,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:53:37,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,553 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:53:37,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:53:37,578 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:53:37,578 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:53:37,578 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:53:37,579 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (1/1) ... [2025-03-03 23:53:37,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:53:37,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:53:37,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:53:37,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:53:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:53:37,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:53:37,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:53:37,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:53:37,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:53:37,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:53:37,690 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:53:37,692 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:53:38,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc property_#t~ite25#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short26#1; [2025-03-03 23:53:38,115 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-03 23:53:38,116 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:53:38,131 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:53:38,131 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:53:38,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:53:38 BoogieIcfgContainer [2025-03-03 23:53:38,132 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:53:38,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:53:38,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:53:38,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:53:38,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:53:37" (1/3) ... [2025-03-03 23:53:38,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1f02ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:53:38, skipping insertion in model container [2025-03-03 23:53:38,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:37" (2/3) ... [2025-03-03 23:53:38,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1f02ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:53:38, skipping insertion in model container [2025-03-03 23:53:38,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:53:38" (3/3) ... [2025-03-03 23:53:38,138 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-31.i [2025-03-03 23:53:38,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:53:38,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-31.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:53:38,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:53:38,194 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23b4a14f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:53:38,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:53:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 23:53:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 23:53:38,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:38,207 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:38,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:38,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2076808338, now seen corresponding path program 1 times [2025-03-03 23:53:38,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239865347] [2025-03-03 23:53:38,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:38,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:38,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 23:53:38,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 23:53:38,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:38,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 23:53:38,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:38,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239865347] [2025-03-03 23:53:38,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239865347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:53:38,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218061466] [2025-03-03 23:53:38,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:38,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:53:38,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:53:38,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:53:38,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:53:38,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 23:53:38,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 23:53:38,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:38,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:38,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:53:38,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:53:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 23:53:38,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:53:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218061466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:38,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:53:38,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:53:38,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985039008] [2025-03-03 23:53:38,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:38,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:53:38,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:38,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:53:38,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:53:38,742 INFO L87 Difference]: Start difference. First operand has 106 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 23:53:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:38,770 INFO L93 Difference]: Finished difference Result 196 states and 334 transitions. [2025-03-03 23:53:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:53:38,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2025-03-03 23:53:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:38,777 INFO L225 Difference]: With dead ends: 196 [2025-03-03 23:53:38,777 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 23:53:38,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:53:38,781 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:38,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:53:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 23:53:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 23:53:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 23:53:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2025-03-03 23:53:38,815 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 173 [2025-03-03 23:53:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:38,815 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2025-03-03 23:53:38,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 23:53:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2025-03-03 23:53:38,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 23:53:38,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:38,818 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:38,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:53:39,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:53:39,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:39,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2118093586, now seen corresponding path program 1 times [2025-03-03 23:53:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:39,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572178875] [2025-03-03 23:53:39,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:39,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:39,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 23:53:39,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 23:53:39,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:39,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:39,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:39,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572178875] [2025-03-03 23:53:39,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572178875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:39,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:39,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:53:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754025322] [2025-03-03 23:53:39,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:39,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:53:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:39,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:53:39,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:53:39,478 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:39,702 INFO L93 Difference]: Finished difference Result 274 states and 424 transitions. [2025-03-03 23:53:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:53:39,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-03-03 23:53:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:39,708 INFO L225 Difference]: With dead ends: 274 [2025-03-03 23:53:39,708 INFO L226 Difference]: Without dead ends: 184 [2025-03-03 23:53:39,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:53:39,709 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 96 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:39,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 382 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:53:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-03 23:53:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 146. [2025-03-03 23:53:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:53:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2025-03-03 23:53:39,748 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 173 [2025-03-03 23:53:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:39,750 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2025-03-03 23:53:39,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2025-03-03 23:53:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 23:53:39,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:39,752 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:39,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:53:39,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1433179033, now seen corresponding path program 1 times [2025-03-03 23:53:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618787308] [2025-03-03 23:53:39,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:39,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 23:53:39,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 23:53:39,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:39,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:40,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:40,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618787308] [2025-03-03 23:53:40,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618787308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:40,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:40,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:53:40,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273806565] [2025-03-03 23:53:40,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:40,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:53:40,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:40,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:53:40,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:53:40,032 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:40,181 INFO L93 Difference]: Finished difference Result 274 states and 423 transitions. [2025-03-03 23:53:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:53:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-03 23:53:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:40,184 INFO L225 Difference]: With dead ends: 274 [2025-03-03 23:53:40,185 INFO L226 Difference]: Without dead ends: 184 [2025-03-03 23:53:40,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:53:40,186 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 94 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:40,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 384 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:53:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-03 23:53:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2025-03-03 23:53:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:53:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 227 transitions. [2025-03-03 23:53:40,214 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 227 transitions. Word has length 174 [2025-03-03 23:53:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:40,214 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 227 transitions. [2025-03-03 23:53:40,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 227 transitions. [2025-03-03 23:53:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 23:53:40,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:40,218 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:40,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:53:40,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:40,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1195770234, now seen corresponding path program 1 times [2025-03-03 23:53:40,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:40,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587716110] [2025-03-03 23:53:40,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:40,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:40,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 23:53:40,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 23:53:40,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:40,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:40,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587716110] [2025-03-03 23:53:40,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587716110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:40,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:40,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:53:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055975382] [2025-03-03 23:53:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:40,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:53:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:40,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:53:40,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:53:40,863 INFO L87 Difference]: Start difference. First operand 147 states and 227 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:41,379 INFO L93 Difference]: Finished difference Result 372 states and 566 transitions. [2025-03-03 23:53:41,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:53:41,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-03-03 23:53:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:41,387 INFO L225 Difference]: With dead ends: 372 [2025-03-03 23:53:41,387 INFO L226 Difference]: Without dead ends: 282 [2025-03-03 23:53:41,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:53:41,388 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 489 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:41,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 633 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 23:53:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-03 23:53:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 237. [2025-03-03 23:53:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 153 states have (on average 1.3202614379084967) internal successors, (202), 154 states have internal predecessors, (202), 78 states have call successors, (78), 5 states have call predecessors, (78), 5 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 23:53:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 358 transitions. [2025-03-03 23:53:41,424 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 358 transitions. Word has length 175 [2025-03-03 23:53:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:41,425 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 358 transitions. [2025-03-03 23:53:41,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 358 transitions. [2025-03-03 23:53:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 23:53:41,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:41,427 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:41,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:53:41,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:41,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:41,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1489173241, now seen corresponding path program 1 times [2025-03-03 23:53:41,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:41,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777904097] [2025-03-03 23:53:41,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:41,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:41,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 23:53:41,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 23:53:41,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:41,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:41,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777904097] [2025-03-03 23:53:41,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777904097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:41,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:53:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903675009] [2025-03-03 23:53:41,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:41,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:53:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:41,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:53:41,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:53:41,678 INFO L87 Difference]: Start difference. First operand 237 states and 358 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:41,846 INFO L93 Difference]: Finished difference Result 454 states and 688 transitions. [2025-03-03 23:53:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:53:41,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-03-03 23:53:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:41,850 INFO L225 Difference]: With dead ends: 454 [2025-03-03 23:53:41,851 INFO L226 Difference]: Without dead ends: 273 [2025-03-03 23:53:41,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:53:41,852 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 119 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:41,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 409 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:53:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-03 23:53:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2025-03-03 23:53:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 164 states have (on average 1.3170731707317074) internal successors, (216), 165 states have internal predecessors, (216), 78 states have call successors, (78), 5 states have call predecessors, (78), 5 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 23:53:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 372 transitions. [2025-03-03 23:53:41,877 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 372 transitions. Word has length 175 [2025-03-03 23:53:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:41,878 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 372 transitions. [2025-03-03 23:53:41,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 372 transitions. [2025-03-03 23:53:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 23:53:41,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:41,879 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:41,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:53:41,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:41,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1932150808, now seen corresponding path program 1 times [2025-03-03 23:53:41,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:41,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451153945] [2025-03-03 23:53:41,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:41,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 23:53:41,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 23:53:41,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:41,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:42,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451153945] [2025-03-03 23:53:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451153945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:42,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:42,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:53:42,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293339635] [2025-03-03 23:53:42,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:42,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:53:42,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:42,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:53:42,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:53:42,109 INFO L87 Difference]: Start difference. First operand 248 states and 372 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:42,310 INFO L93 Difference]: Finished difference Result 627 states and 941 transitions. [2025-03-03 23:53:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 23:53:42,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-03-03 23:53:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:42,314 INFO L225 Difference]: With dead ends: 627 [2025-03-03 23:53:42,315 INFO L226 Difference]: Without dead ends: 451 [2025-03-03 23:53:42,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:53:42,316 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 180 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:42,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 592 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:53:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-03 23:53:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 395. [2025-03-03 23:53:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 256 states have (on average 1.28515625) internal successors, (329), 258 states have internal predecessors, (329), 130 states have call successors, (130), 8 states have call predecessors, (130), 8 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-03 23:53:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 589 transitions. [2025-03-03 23:53:42,351 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 589 transitions. Word has length 176 [2025-03-03 23:53:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:42,351 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 589 transitions. [2025-03-03 23:53:42,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 589 transitions. [2025-03-03 23:53:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 23:53:42,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:42,353 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:42,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:53:42,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:42,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:42,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1009506791, now seen corresponding path program 1 times [2025-03-03 23:53:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:42,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719465173] [2025-03-03 23:53:42,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:42,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:42,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 23:53:42,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 23:53:42,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:42,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:42,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:42,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719465173] [2025-03-03 23:53:42,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719465173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:42,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:53:42,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819830718] [2025-03-03 23:53:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:42,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:53:42,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:42,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:53:42,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:53:42,777 INFO L87 Difference]: Start difference. First operand 395 states and 589 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:43,001 INFO L93 Difference]: Finished difference Result 811 states and 1192 transitions. [2025-03-03 23:53:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:53:43,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-03-03 23:53:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:43,004 INFO L225 Difference]: With dead ends: 811 [2025-03-03 23:53:43,004 INFO L226 Difference]: Without dead ends: 558 [2025-03-03 23:53:43,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:53:43,006 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 112 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:43,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 464 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:53:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-03 23:53:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 490. [2025-03-03 23:53:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 328 states have (on average 1.2865853658536586) internal successors, (422), 332 states have internal predecessors, (422), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:53:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 718 transitions. [2025-03-03 23:53:43,061 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 718 transitions. Word has length 176 [2025-03-03 23:53:43,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:43,062 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 718 transitions. [2025-03-03 23:53:43,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 718 transitions. [2025-03-03 23:53:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 23:53:43,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:43,063 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:43,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:53:43,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:43,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1206020296, now seen corresponding path program 1 times [2025-03-03 23:53:43,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:43,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365355187] [2025-03-03 23:53:43,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:43,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:43,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 23:53:43,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 23:53:43,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:43,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:47,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:47,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365355187] [2025-03-03 23:53:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365355187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:47,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 23:53:47,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401464107] [2025-03-03 23:53:47,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:47,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:53:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:47,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:53:47,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:53:47,109 INFO L87 Difference]: Start difference. First operand 490 states and 718 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:49,698 INFO L93 Difference]: Finished difference Result 894 states and 1301 transitions. [2025-03-03 23:53:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 23:53:49,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-03-03 23:53:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:49,705 INFO L225 Difference]: With dead ends: 894 [2025-03-03 23:53:49,705 INFO L226 Difference]: Without dead ends: 568 [2025-03-03 23:53:49,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2025-03-03 23:53:49,709 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 359 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:49,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 867 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 23:53:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-03 23:53:49,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 501. [2025-03-03 23:53:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 339 states have (on average 1.2920353982300885) internal successors, (438), 343 states have internal predecessors, (438), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:53:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 734 transitions. [2025-03-03 23:53:49,767 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 734 transitions. Word has length 176 [2025-03-03 23:53:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:49,768 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 734 transitions. [2025-03-03 23:53:49,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 734 transitions. [2025-03-03 23:53:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 23:53:49,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:49,770 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:49,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 23:53:49,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:49,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 898968631, now seen corresponding path program 1 times [2025-03-03 23:53:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189326354] [2025-03-03 23:53:49,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:49,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 23:53:49,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 23:53:49,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:49,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:50,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:50,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189326354] [2025-03-03 23:53:50,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189326354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:50,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:50,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:53:50,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814283227] [2025-03-03 23:53:50,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:50,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:53:50,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:50,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:53:50,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:53:50,014 INFO L87 Difference]: Start difference. First operand 501 states and 734 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:50,143 INFO L93 Difference]: Finished difference Result 944 states and 1375 transitions. [2025-03-03 23:53:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:53:50,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-03-03 23:53:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:50,149 INFO L225 Difference]: With dead ends: 944 [2025-03-03 23:53:50,150 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 23:53:50,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:53:50,151 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 66 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:50,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 463 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:53:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 23:53:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 517. [2025-03-03 23:53:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 351 states have (on average 1.2678062678062678) internal successors, (445), 355 states have internal predecessors, (445), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:53:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 741 transitions. [2025-03-03 23:53:50,194 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 741 transitions. Word has length 176 [2025-03-03 23:53:50,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:50,195 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 741 transitions. [2025-03-03 23:53:50,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 741 transitions. [2025-03-03 23:53:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 23:53:50,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:50,197 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:50,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 23:53:50,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:50,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1095482136, now seen corresponding path program 1 times [2025-03-03 23:53:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:50,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263708777] [2025-03-03 23:53:50,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:50,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 23:53:50,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 23:53:50,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:50,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:53,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:53,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263708777] [2025-03-03 23:53:53,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263708777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:53,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:53,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 23:53:53,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178203165] [2025-03-03 23:53:53,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:53,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:53:53,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:53,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:53:53,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:53:53,540 INFO L87 Difference]: Start difference. First operand 517 states and 741 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:54,809 INFO L93 Difference]: Finished difference Result 950 states and 1348 transitions. [2025-03-03 23:53:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:53:54,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-03-03 23:53:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:54,813 INFO L225 Difference]: With dead ends: 950 [2025-03-03 23:53:54,813 INFO L226 Difference]: Without dead ends: 603 [2025-03-03 23:53:54,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:53:54,814 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 110 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:54,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 690 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 23:53:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-03 23:53:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 525. [2025-03-03 23:53:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 359 states have (on average 1.267409470752089) internal successors, (455), 363 states have internal predecessors, (455), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:53:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 751 transitions. [2025-03-03 23:53:54,847 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 751 transitions. Word has length 176 [2025-03-03 23:53:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:54,847 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 751 transitions. [2025-03-03 23:53:54,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 751 transitions. [2025-03-03 23:53:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 23:53:54,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:54,849 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:54,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 23:53:54,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:54,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1990498204, now seen corresponding path program 1 times [2025-03-03 23:53:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:54,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521019679] [2025-03-03 23:53:54,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:54,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:54,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 23:53:54,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 23:53:54,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:54,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:55,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:55,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521019679] [2025-03-03 23:53:55,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521019679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:55,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:55,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:53:55,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374983857] [2025-03-03 23:53:55,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:55,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:53:55,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:55,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:53:55,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:53:55,484 INFO L87 Difference]: Start difference. First operand 525 states and 751 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:56,314 INFO L93 Difference]: Finished difference Result 956 states and 1360 transitions. [2025-03-03 23:53:56,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 23:53:56,315 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-03 23:53:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:56,318 INFO L225 Difference]: With dead ends: 956 [2025-03-03 23:53:56,319 INFO L226 Difference]: Without dead ends: 603 [2025-03-03 23:53:56,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2025-03-03 23:53:56,321 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 469 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:56,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1445 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:53:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-03 23:53:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 528. [2025-03-03 23:53:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 362 states have (on average 1.2651933701657458) internal successors, (458), 366 states have internal predecessors, (458), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:53:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 754 transitions. [2025-03-03 23:53:56,356 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 754 transitions. Word has length 177 [2025-03-03 23:53:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:56,357 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 754 transitions. [2025-03-03 23:53:56,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 754 transitions. [2025-03-03 23:53:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 23:53:56,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:56,358 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:56,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 23:53:56,359 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:56,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash -247687869, now seen corresponding path program 1 times [2025-03-03 23:53:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:56,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800431095] [2025-03-03 23:53:56,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:56,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 23:53:56,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 23:53:56,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:56,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:53:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800431095] [2025-03-03 23:53:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800431095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:57,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:57,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:53:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006729043] [2025-03-03 23:53:57,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:57,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:53:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:57,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:53:57,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:53:57,077 INFO L87 Difference]: Start difference. First operand 528 states and 754 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:57,798 INFO L93 Difference]: Finished difference Result 927 states and 1322 transitions. [2025-03-03 23:53:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:53:57,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-03 23:53:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:57,803 INFO L225 Difference]: With dead ends: 927 [2025-03-03 23:53:57,803 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 23:53:57,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:53:57,805 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 354 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:57,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 716 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:53:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 23:53:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 525. [2025-03-03 23:53:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 359 states have (on average 1.2646239554317549) internal successors, (454), 363 states have internal predecessors, (454), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:53:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 750 transitions. [2025-03-03 23:53:57,842 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 750 transitions. Word has length 177 [2025-03-03 23:53:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:57,843 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 750 transitions. [2025-03-03 23:53:57,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:53:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 750 transitions. [2025-03-03 23:53:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 23:53:57,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:57,846 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:53:57,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 23:53:57,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:57,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:57,847 INFO L85 PathProgramCache]: Analyzing trace with hash 507517733, now seen corresponding path program 1 times [2025-03-03 23:53:57,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:57,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986970946] [2025-03-03 23:53:57,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:57,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:57,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 23:53:57,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 23:53:57,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:57,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:54:01,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986970946] [2025-03-03 23:54:01,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986970946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:01,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:01,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 23:54:01,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222562050] [2025-03-03 23:54:01,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:01,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 23:54:01,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:01,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 23:54:01,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:54:01,008 INFO L87 Difference]: Start difference. First operand 525 states and 750 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:03,643 INFO L93 Difference]: Finished difference Result 985 states and 1389 transitions. [2025-03-03 23:54:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 23:54:03,644 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-03 23:54:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:03,647 INFO L225 Difference]: With dead ends: 985 [2025-03-03 23:54:03,647 INFO L226 Difference]: Without dead ends: 638 [2025-03-03 23:54:03,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 23:54:03,649 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 481 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:03,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1082 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 23:54:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-03 23:54:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 526. [2025-03-03 23:54:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 360 states have (on average 1.2666666666666666) internal successors, (456), 364 states have internal predecessors, (456), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:54:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 752 transitions. [2025-03-03 23:54:03,693 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 752 transitions. Word has length 177 [2025-03-03 23:54:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:03,693 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 752 transitions. [2025-03-03 23:54:03,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 752 transitions. [2025-03-03 23:54:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 23:54:03,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:03,694 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:03,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 23:54:03,695 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:03,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2044639228, now seen corresponding path program 1 times [2025-03-03 23:54:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323668715] [2025-03-03 23:54:03,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:03,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:03,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 23:54:03,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 23:54:03,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:03,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:54:05,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323668715] [2025-03-03 23:54:06,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323668715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:06,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:06,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 23:54:06,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124553745] [2025-03-03 23:54:06,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:06,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:54:06,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:06,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:54:06,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:54:06,001 INFO L87 Difference]: Start difference. First operand 526 states and 752 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:07,831 INFO L93 Difference]: Finished difference Result 993 states and 1410 transitions. [2025-03-03 23:54:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 23:54:07,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-03 23:54:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:07,836 INFO L225 Difference]: With dead ends: 993 [2025-03-03 23:54:07,836 INFO L226 Difference]: Without dead ends: 646 [2025-03-03 23:54:07,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:54:07,837 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 49 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:07,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 761 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 23:54:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-03-03 23:54:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 544. [2025-03-03 23:54:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 378 states have (on average 1.2645502645502646) internal successors, (478), 382 states have internal predecessors, (478), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:54:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 774 transitions. [2025-03-03 23:54:07,874 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 774 transitions. Word has length 177 [2025-03-03 23:54:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:07,874 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 774 transitions. [2025-03-03 23:54:07,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 774 transitions. [2025-03-03 23:54:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 23:54:07,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:07,876 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:07,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 23:54:07,876 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:07,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1160350907, now seen corresponding path program 1 times [2025-03-03 23:54:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:07,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081869540] [2025-03-03 23:54:07,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:07,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 23:54:07,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 23:54:07,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:07,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:54:09,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081869540] [2025-03-03 23:54:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081869540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:09,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:09,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:54:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233360118] [2025-03-03 23:54:09,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:09,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:54:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:09,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:54:09,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:54:09,803 INFO L87 Difference]: Start difference. First operand 544 states and 774 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:10,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:10,474 INFO L93 Difference]: Finished difference Result 1141 states and 1582 transitions. [2025-03-03 23:54:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 23:54:10,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-03 23:54:10,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:10,479 INFO L225 Difference]: With dead ends: 1141 [2025-03-03 23:54:10,479 INFO L226 Difference]: Without dead ends: 782 [2025-03-03 23:54:10,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:54:10,480 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 159 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:10,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 688 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 23:54:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-03-03 23:54:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 569. [2025-03-03 23:54:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 403 states have (on average 1.2803970223325063) internal successors, (516), 407 states have internal predecessors, (516), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:54:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 812 transitions. [2025-03-03 23:54:10,521 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 812 transitions. Word has length 177 [2025-03-03 23:54:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:10,522 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 812 transitions. [2025-03-03 23:54:10,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 812 transitions. [2025-03-03 23:54:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 23:54:10,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:10,523 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:10,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 23:54:10,523 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:10,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:10,523 INFO L85 PathProgramCache]: Analyzing trace with hash 582459428, now seen corresponding path program 1 times [2025-03-03 23:54:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:10,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085604346] [2025-03-03 23:54:10,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:10,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 23:54:10,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 23:54:10,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:10,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:54:12,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:12,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085604346] [2025-03-03 23:54:12,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085604346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:12,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:12,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:54:12,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110222788] [2025-03-03 23:54:12,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:12,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:54:12,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:12,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:54:12,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:54:12,259 INFO L87 Difference]: Start difference. First operand 569 states and 812 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:12,694 INFO L93 Difference]: Finished difference Result 1108 states and 1550 transitions. [2025-03-03 23:54:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:54:12,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-03 23:54:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:12,698 INFO L225 Difference]: With dead ends: 1108 [2025-03-03 23:54:12,698 INFO L226 Difference]: Without dead ends: 729 [2025-03-03 23:54:12,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:54:12,700 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 138 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:12,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 665 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:54:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-03 23:54:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 569. [2025-03-03 23:54:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 403 states have (on average 1.2803970223325063) internal successors, (516), 407 states have internal predecessors, (516), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:54:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 812 transitions. [2025-03-03 23:54:12,739 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 812 transitions. Word has length 177 [2025-03-03 23:54:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:12,740 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 812 transitions. [2025-03-03 23:54:12,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 812 transitions. [2025-03-03 23:54:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 23:54:12,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:12,741 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:12,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 23:54:12,741 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:12,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1927826907, now seen corresponding path program 1 times [2025-03-03 23:54:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:12,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996426000] [2025-03-03 23:54:12,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:12,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 23:54:12,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 23:54:12,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:12,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:54:14,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:14,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996426000] [2025-03-03 23:54:14,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996426000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:14,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:14,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:54:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052681260] [2025-03-03 23:54:14,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:14,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:54:14,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:14,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:54:14,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:54:14,211 INFO L87 Difference]: Start difference. First operand 569 states and 812 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:15,218 INFO L93 Difference]: Finished difference Result 1187 states and 1667 transitions. [2025-03-03 23:54:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:54:15,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-03 23:54:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:15,222 INFO L225 Difference]: With dead ends: 1187 [2025-03-03 23:54:15,222 INFO L226 Difference]: Without dead ends: 733 [2025-03-03 23:54:15,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:54:15,224 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 106 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:15,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 750 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:54:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-03 23:54:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 586. [2025-03-03 23:54:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 420 states have (on average 1.2738095238095237) internal successors, (535), 424 states have internal predecessors, (535), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 23:54:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 831 transitions. [2025-03-03 23:54:15,267 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 831 transitions. Word has length 177 [2025-03-03 23:54:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:15,267 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 831 transitions. [2025-03-03 23:54:15,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 831 transitions. [2025-03-03 23:54:15,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 23:54:15,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:15,268 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:15,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 23:54:15,269 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:15,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash 344590948, now seen corresponding path program 1 times [2025-03-03 23:54:15,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:15,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827373143] [2025-03-03 23:54:15,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:15,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:15,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 23:54:15,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 23:54:15,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:15,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 23:54:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:15,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827373143] [2025-03-03 23:54:15,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827373143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:54:15,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872640506] [2025-03-03 23:54:15,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:15,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:54:15,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:54:15,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:54:15,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:54:15,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 23:54:15,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 23:54:15,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:15,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:15,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:54:15,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:54:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 637 proven. 90 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-03 23:54:16,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:54:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 23:54:16,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872640506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:54:16,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:54:16,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 16 [2025-03-03 23:54:16,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401650295] [2025-03-03 23:54:16,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:54:16,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 23:54:16,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:16,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 23:54:16,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:54:16,239 INFO L87 Difference]: Start difference. First operand 586 states and 831 transitions. Second operand has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-03 23:54:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:17,114 INFO L93 Difference]: Finished difference Result 1318 states and 1837 transitions. [2025-03-03 23:54:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 23:54:17,114 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 178 [2025-03-03 23:54:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:17,118 INFO L225 Difference]: With dead ends: 1318 [2025-03-03 23:54:17,119 INFO L226 Difference]: Without dead ends: 905 [2025-03-03 23:54:17,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 351 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=453, Invalid=1439, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 23:54:17,121 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 428 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:17,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1116 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:54:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-03 23:54:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 519. [2025-03-03 23:54:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 365 states have (on average 1.2493150684931507) internal successors, (456), 367 states have internal predecessors, (456), 130 states have call successors, (130), 23 states have call predecessors, (130), 23 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-03 23:54:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 716 transitions. [2025-03-03 23:54:17,170 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 716 transitions. Word has length 178 [2025-03-03 23:54:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:17,171 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 716 transitions. [2025-03-03 23:54:17,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-03 23:54:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 716 transitions. [2025-03-03 23:54:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 23:54:17,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:17,172 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:17,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:54:17,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 23:54:17,373 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:17,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1877558838, now seen corresponding path program 1 times [2025-03-03 23:54:17,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70083720] [2025-03-03 23:54:17,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:17,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:17,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 23:54:17,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 23:54:17,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:17,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:54:22,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:22,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70083720] [2025-03-03 23:54:22,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70083720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:22,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:22,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 23:54:22,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815814043] [2025-03-03 23:54:22,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:22,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 23:54:22,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:22,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 23:54:22,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-03-03 23:54:22,268 INFO L87 Difference]: Start difference. First operand 519 states and 716 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 23:54:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:25,635 INFO L93 Difference]: Finished difference Result 1248 states and 1693 transitions. [2025-03-03 23:54:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 23:54:25,636 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 178 [2025-03-03 23:54:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:25,640 INFO L225 Difference]: With dead ends: 1248 [2025-03-03 23:54:25,640 INFO L226 Difference]: Without dead ends: 828 [2025-03-03 23:54:25,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=330, Invalid=1230, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 23:54:25,642 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 910 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:25,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1232 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 23:54:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-03-03 23:54:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 547. [2025-03-03 23:54:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 393 states have (on average 1.256997455470738) internal successors, (494), 395 states have internal predecessors, (494), 130 states have call successors, (130), 23 states have call predecessors, (130), 23 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-03 23:54:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 754 transitions. [2025-03-03 23:54:25,684 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 754 transitions. Word has length 178 [2025-03-03 23:54:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:25,685 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 754 transitions. [2025-03-03 23:54:25,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 23:54:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 754 transitions. [2025-03-03 23:54:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 23:54:25,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:25,686 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:25,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 23:54:25,686 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:25,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:25,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1529904777, now seen corresponding path program 1 times [2025-03-03 23:54:25,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:25,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820602774] [2025-03-03 23:54:25,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:25,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 23:54:25,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 23:54:25,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:25,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:54:29,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:29,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820602774] [2025-03-03 23:54:29,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820602774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:29,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:29,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 23:54:29,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890374389] [2025-03-03 23:54:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:29,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 23:54:29,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:29,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 23:54:29,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:54:29,391 INFO L87 Difference]: Start difference. First operand 547 states and 754 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:31,829 INFO L93 Difference]: Finished difference Result 1615 states and 2192 transitions. [2025-03-03 23:54:31,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 23:54:31,830 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2025-03-03 23:54:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:31,835 INFO L225 Difference]: With dead ends: 1615 [2025-03-03 23:54:31,835 INFO L226 Difference]: Without dead ends: 1195 [2025-03-03 23:54:31,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=277, Invalid=715, Unknown=0, NotChecked=0, Total=992 [2025-03-03 23:54:31,837 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 396 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:31,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 730 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 23:54:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2025-03-03 23:54:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 935. [2025-03-03 23:54:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 659 states have (on average 1.2549317147192716) internal successors, (827), 663 states have internal predecessors, (827), 234 states have call successors, (234), 41 states have call predecessors, (234), 41 states have return successors, (234), 230 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-03 23:54:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1295 transitions. [2025-03-03 23:54:31,928 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1295 transitions. Word has length 178 [2025-03-03 23:54:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:31,928 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1295 transitions. [2025-03-03 23:54:31,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1295 transitions. [2025-03-03 23:54:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 23:54:31,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:31,931 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:31,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 23:54:31,931 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:31,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1913834808, now seen corresponding path program 1 times [2025-03-03 23:54:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:31,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125624142] [2025-03-03 23:54:31,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:31,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 23:54:31,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 23:54:31,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:31,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:54:34,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125624142] [2025-03-03 23:54:34,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125624142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:34,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:34,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:54:34,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880422241] [2025-03-03 23:54:34,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:34,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:54:34,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:34,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:54:34,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:54:34,219 INFO L87 Difference]: Start difference. First operand 935 states and 1295 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:35,149 INFO L93 Difference]: Finished difference Result 2095 states and 2887 transitions. [2025-03-03 23:54:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 23:54:35,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2025-03-03 23:54:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:35,159 INFO L225 Difference]: With dead ends: 2095 [2025-03-03 23:54:35,159 INFO L226 Difference]: Without dead ends: 1254 [2025-03-03 23:54:35,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2025-03-03 23:54:35,166 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 358 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:35,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 821 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:54:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-03 23:54:35,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 941. [2025-03-03 23:54:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 665 states have (on average 1.255639097744361) internal successors, (835), 669 states have internal predecessors, (835), 234 states have call successors, (234), 41 states have call predecessors, (234), 41 states have return successors, (234), 230 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-03 23:54:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1303 transitions. [2025-03-03 23:54:35,263 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1303 transitions. Word has length 178 [2025-03-03 23:54:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:35,263 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1303 transitions. [2025-03-03 23:54:35,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1303 transitions. [2025-03-03 23:54:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 23:54:35,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:35,265 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:35,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 23:54:35,265 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:35,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:35,265 INFO L85 PathProgramCache]: Analyzing trace with hash 116883449, now seen corresponding path program 1 times [2025-03-03 23:54:35,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:35,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586851433] [2025-03-03 23:54:35,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:35,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:35,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 23:54:35,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 23:54:35,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:35,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:54:35,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586851433] [2025-03-03 23:54:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586851433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:35,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:35,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 23:54:35,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015117215] [2025-03-03 23:54:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:35,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 23:54:35,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:35,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 23:54:35,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:54:35,683 INFO L87 Difference]: Start difference. First operand 941 states and 1303 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 23:54:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:36,704 INFO L93 Difference]: Finished difference Result 1907 states and 2620 transitions. [2025-03-03 23:54:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 23:54:36,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 178 [2025-03-03 23:54:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:36,710 INFO L225 Difference]: With dead ends: 1907 [2025-03-03 23:54:36,710 INFO L226 Difference]: Without dead ends: 1066 [2025-03-03 23:54:36,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2025-03-03 23:54:36,714 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 383 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:36,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1094 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:54:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-03 23:54:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 945. [2025-03-03 23:54:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 669 states have (on average 1.2556053811659194) internal successors, (840), 673 states have internal predecessors, (840), 234 states have call successors, (234), 41 states have call predecessors, (234), 41 states have return successors, (234), 230 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-03 23:54:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1308 transitions. [2025-03-03 23:54:36,799 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1308 transitions. Word has length 178 [2025-03-03 23:54:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:36,799 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1308 transitions. [2025-03-03 23:54:36,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 23:54:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1308 transitions. [2025-03-03 23:54:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 23:54:36,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:36,800 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:36,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 23:54:36,800 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:36,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:36,801 INFO L85 PathProgramCache]: Analyzing trace with hash 191825144, now seen corresponding path program 1 times [2025-03-03 23:54:36,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:36,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555070604] [2025-03-03 23:54:36,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:36,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:36,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 23:54:36,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 23:54:36,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:36,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 23:54:39,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:39,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555070604] [2025-03-03 23:54:39,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555070604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:39,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:39,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:54:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971570918] [2025-03-03 23:54:39,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:39,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:54:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:39,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:54:39,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:54:39,563 INFO L87 Difference]: Start difference. First operand 945 states and 1308 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:40,898 INFO L93 Difference]: Finished difference Result 2132 states and 2956 transitions. [2025-03-03 23:54:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:54:40,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2025-03-03 23:54:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:40,904 INFO L225 Difference]: With dead ends: 2132 [2025-03-03 23:54:40,904 INFO L226 Difference]: Without dead ends: 1291 [2025-03-03 23:54:40,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:54:40,906 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 160 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:40,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 890 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 23:54:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-03 23:54:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 917. [2025-03-03 23:54:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 641 states have (on average 1.2527301092043681) internal successors, (803), 645 states have internal predecessors, (803), 234 states have call successors, (234), 41 states have call predecessors, (234), 41 states have return successors, (234), 230 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-03 23:54:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1271 transitions. [2025-03-03 23:54:40,990 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1271 transitions. Word has length 178 [2025-03-03 23:54:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:40,990 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1271 transitions. [2025-03-03 23:54:40,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 23:54:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1271 transitions. [2025-03-03 23:54:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 23:54:40,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:40,991 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:40,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 23:54:40,992 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:40,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2082162449, now seen corresponding path program 1 times [2025-03-03 23:54:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:40,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035977292] [2025-03-03 23:54:40,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:40,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:41,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 23:54:41,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 23:54:41,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:41,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 23:54:41,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:41,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035977292] [2025-03-03 23:54:41,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035977292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:54:41,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800215928] [2025-03-03 23:54:41,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:41,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:54:41,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:54:41,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:54:41,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:54:41,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 23:54:41,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 23:54:41,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:41,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:41,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 23:54:41,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:54:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 213 proven. 69 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2025-03-03 23:54:42,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:54:42,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800215928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:54:42,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:54:42,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2025-03-03 23:54:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101973877] [2025-03-03 23:54:42,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:54:42,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 23:54:42,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:42,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 23:54:42,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 23:54:42,722 INFO L87 Difference]: Start difference. First operand 917 states and 1271 transitions. Second operand has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-03 23:54:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:45,070 INFO L93 Difference]: Finished difference Result 1858 states and 2544 transitions. [2025-03-03 23:54:45,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 23:54:45,072 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 179 [2025-03-03 23:54:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:45,076 INFO L225 Difference]: With dead ends: 1858 [2025-03-03 23:54:45,076 INFO L226 Difference]: Without dead ends: 1040 [2025-03-03 23:54:45,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=1334, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 23:54:45,078 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 449 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:45,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1035 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 23:54:45,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-03-03 23:54:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 916. [2025-03-03 23:54:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 640 states have (on average 1.2515625) internal successors, (801), 644 states have internal predecessors, (801), 234 states have call successors, (234), 41 states have call predecessors, (234), 41 states have return successors, (234), 230 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-03 23:54:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1269 transitions. [2025-03-03 23:54:45,160 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1269 transitions. Word has length 179 [2025-03-03 23:54:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:45,160 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1269 transitions. [2025-03-03 23:54:45,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-03 23:54:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1269 transitions. [2025-03-03 23:54:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 23:54:45,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:45,162 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:45,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 23:54:45,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:54:45,362 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:45,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1283200817, now seen corresponding path program 1 times [2025-03-03 23:54:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273877807] [2025-03-03 23:54:45,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:45,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 23:54:45,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 23:54:45,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:45,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 23:54:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273877807] [2025-03-03 23:54:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273877807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:54:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111383810] [2025-03-03 23:54:45,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:45,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:54:45,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:54:45,616 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:54:45,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 23:54:45,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 23:54:45,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 23:54:45,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:45,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:45,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 23:54:45,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:54:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 493 proven. 57 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2025-03-03 23:54:46,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:54:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 18 proven. 57 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 23:54:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111383810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:54:47,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:54:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 27 [2025-03-03 23:54:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743735589] [2025-03-03 23:54:47,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:54:47,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 23:54:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:47,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 23:54:47,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2025-03-03 23:54:47,987 INFO L87 Difference]: Start difference. First operand 916 states and 1269 transitions. Second operand has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 27 states have internal predecessors, (147), 5 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (76), 5 states have call predecessors, (76), 5 states have call successors, (76) [2025-03-03 23:54:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:50,000 INFO L93 Difference]: Finished difference Result 2031 states and 2723 transitions. [2025-03-03 23:54:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-03 23:54:50,001 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 27 states have internal predecessors, (147), 5 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (76), 5 states have call predecessors, (76), 5 states have call successors, (76) Word has length 179 [2025-03-03 23:54:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:50,007 INFO L225 Difference]: With dead ends: 2031 [2025-03-03 23:54:50,007 INFO L226 Difference]: Without dead ends: 1214 [2025-03-03 23:54:50,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=738, Invalid=4374, Unknown=0, NotChecked=0, Total=5112 [2025-03-03 23:54:50,010 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 825 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:50,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1235 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 23:54:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-03 23:54:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 580. [2025-03-03 23:54:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 407 states have (on average 1.2113022113022114) internal successors, (493), 411 states have internal predecessors, (493), 140 states have call successors, (140), 32 states have call predecessors, (140), 32 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 23:54:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 773 transitions. [2025-03-03 23:54:50,090 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 773 transitions. Word has length 179 [2025-03-03 23:54:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:50,090 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 773 transitions. [2025-03-03 23:54:50,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 27 states have internal predecessors, (147), 5 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (76), 5 states have call predecessors, (76), 5 states have call successors, (76) [2025-03-03 23:54:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 773 transitions. [2025-03-03 23:54:50,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 23:54:50,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:50,091 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:50,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 23:54:50,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:54:50,296 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:50,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:50,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1086687312, now seen corresponding path program 1 times [2025-03-03 23:54:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:50,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718795837] [2025-03-03 23:54:50,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:50,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 23:54:50,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 23:54:50,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:50,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:54:50,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411811355] [2025-03-03 23:54:50,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:50,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:54:50,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:54:50,362 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:54:50,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 23:54:50,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 23:54:51,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 23:54:51,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:51,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:54:51,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:54:51,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 23:54:51,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 23:54:51,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:51,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:54:51,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:54:51,295 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:54:51,297 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:54:51,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 23:54:51,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 23:54:51,501 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:54:51,601 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:54:51,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:54:51 BoogieIcfgContainer [2025-03-03 23:54:51,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:54:51,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:54:51,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:54:51,604 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:54:51,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:53:38" (3/4) ... [2025-03-03 23:54:51,606 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:54:51,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:54:51,608 INFO L158 Benchmark]: Toolchain (without parser) took 74407.86ms. Allocated memory was 201.3MB in the beginning and 704.6MB in the end (delta: 503.3MB). Free memory was 160.5MB in the beginning and 267.1MB in the end (delta: -106.6MB). Peak memory consumption was 395.5MB. Max. memory is 16.1GB. [2025-03-03 23:54:51,608 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:54:51,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.26ms. Allocated memory is still 201.3MB. Free memory was 160.1MB in the beginning and 143.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:54:51,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.45ms. Allocated memory is still 201.3MB. Free memory was 143.8MB in the beginning and 139.3MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:54:51,610 INFO L158 Benchmark]: Boogie Preprocessor took 53.70ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 132.1MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:54:51,611 INFO L158 Benchmark]: IcfgBuilder took 553.31ms. Allocated memory is still 201.3MB. Free memory was 132.1MB in the beginning and 97.9MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 23:54:51,611 INFO L158 Benchmark]: TraceAbstraction took 73469.87ms. Allocated memory was 201.3MB in the beginning and 704.6MB in the end (delta: 503.3MB). Free memory was 97.5MB in the beginning and 267.3MB in the end (delta: -169.8MB). Peak memory consumption was 336.8MB. Max. memory is 16.1GB. [2025-03-03 23:54:51,611 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 704.6MB. Free memory was 267.3MB in the beginning and 267.1MB in the end (delta: 226.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:54:51,611 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.26ms. Allocated memory is still 201.3MB. Free memory was 160.1MB in the beginning and 143.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.45ms. Allocated memory is still 201.3MB. Free memory was 143.8MB in the beginning and 139.3MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.70ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 132.1MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 553.31ms. Allocated memory is still 201.3MB. Free memory was 132.1MB in the beginning and 97.9MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 73469.87ms. Allocated memory was 201.3MB in the beginning and 704.6MB in the end (delta: 503.3MB). Free memory was 97.5MB in the beginning and 267.3MB in the end (delta: -169.8MB). Peak memory consumption was 336.8MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 704.6MB. Free memory was 267.3MB in the beginning and 267.1MB in the end (delta: 226.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 206, overapproximation of someUnaryDOUBLEoperation at line 46, overapproximation of bitwiseAnd at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 195, overapproximation of someBinaryDOUBLEComparisonOperation at line 206. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned long int var_1_4 = 32; [L24] unsigned char var_1_6 = 1; [L25] unsigned char var_1_7 = 0; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 50; [L30] unsigned long int var_1_14 = 1000000000; [L31] unsigned short int var_1_15 = 10; [L32] unsigned short int var_1_16 = 39011; [L33] unsigned long int var_1_17 = 4; [L34] signed char var_1_18 = 4; [L35] signed char var_1_21 = 16; [L36] signed char var_1_22 = 64; [L37] signed long int var_1_23 = 8; [L38] unsigned char var_1_24 = 0; [L39] unsigned char var_1_25 = 0; [L40] unsigned char var_1_26 = 0; [L41] unsigned char var_1_27 = 0; [L42] double var_1_28 = 25.5; [L43] double var_1_29 = 255.25; [L44] double var_1_30 = 24.7; [L45] double var_1_31 = 31.2; [L46] float var_1_32 = -0.2; [L47] unsigned char var_1_33 = 10; [L48] float var_1_34 = 24.5; [L49] unsigned char last_1_var_1_7 = 0; [L50] unsigned short int last_1_var_1_15 = 10; [L51] unsigned long int last_1_var_1_17 = 4; [L52] signed long int last_1_var_1_23 = 8; [L53] unsigned char last_1_var_1_24 = 0; [L54] unsigned char last_1_var_1_33 = 10; VAL [isInitial=0, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=32, var_1_6=1, var_1_7=0] [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L198] last_1_var_1_7 = var_1_7 [L199] last_1_var_1_15 = var_1_15 [L200] last_1_var_1_17 = var_1_17 [L201] last_1_var_1_23 = var_1_23 [L202] last_1_var_1_24 = var_1_24 [L203] last_1_var_1_33 = var_1_33 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=32, var_1_6=1, var_1_7=0] [L213] RET updateLastVariables() [L214] CALL updateVariables() [L156] var_1_4 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L157] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L158] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L158] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=1, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=1, var_1_7=0] [L159] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=1, var_1_7=0] [L160] var_1_6 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_7=0] [L161] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L162] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L163] var_1_10 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L164] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L165] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L165] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L166] var_1_11 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L167] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L168] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L168] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L169] var_1_12 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L170] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L171] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L171] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L172] var_1_16 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L173] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L174] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L175] var_1_21 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L176] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L177] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L178] var_1_22 = __VERIFIER_nondet_char() [L179] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L179] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L180] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L180] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L181] var_1_25 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L182] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L183] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L183] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L184] var_1_26 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L185] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L186] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L186] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L187] var_1_27 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L188] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L189] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L190] var_1_29 = __VERIFIER_nondet_double() [L191] CALL assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L191] RET assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L192] var_1_30 = __VERIFIER_nondet_double() [L193] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L193] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L194] var_1_31 = __VERIFIER_nondet_double() [L195] CALL assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L195] RET assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L214] RET updateVariables() [L215] CALL step() [L58] signed long int stepLocal_8 = last_1_var_1_33; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_8=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L59] COND FALSE !(stepLocal_8 <= ((last_1_var_1_17 / var_1_4) / var_1_16)) [L68] var_1_18 = var_1_21 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L70] COND FALSE !(! (! (last_1_var_1_7 && last_1_var_1_24))) [L77] var_1_15 = last_1_var_1_23 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L79] var_1_14 = (var_1_6 + var_1_15) [L80] unsigned char stepLocal_7 = var_1_12; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L81] EXPR last_1_var_1_15 & 16 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L81] signed long int stepLocal_6 = last_1_var_1_15 & 16; [L82] signed long int stepLocal_5 = last_1_var_1_15; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L83] COND FALSE !(last_1_var_1_15 < stepLocal_5) [L94] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L96] unsigned char stepLocal_9 = last_1_var_1_7; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, stepLocal_9=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L97] COND TRUE ! last_1_var_1_24 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, stepLocal_9=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L98] COND FALSE !(stepLocal_9 && (last_1_var_1_33 >= ((((last_1_var_1_17) < (var_1_4)) ? (last_1_var_1_17) : (var_1_4))))) [L101] var_1_24 = var_1_12 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L106] unsigned short int stepLocal_10 = var_1_15; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_10=8, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L107] COND FALSE !(stepLocal_10 < var_1_4) [L114] var_1_28 = (100.4 + var_1_30) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=257, var_1_7=0] [L116] var_1_32 = var_1_29 [L117] var_1_33 = var_1_22 [L118] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L119] COND FALSE !(var_1_14 < var_1_13) [L122] var_1_23 = var_1_18 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L124] unsigned char stepLocal_2 = var_1_13 < var_1_4; [L125] signed long int stepLocal_1 = var_1_6 + var_1_15; [L126] unsigned long int stepLocal_0 = var_1_13 % var_1_4; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_0=1, stepLocal_1=9, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L127] COND FALSE !(stepLocal_0 >= var_1_15) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_1=9, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L132] COND TRUE stepLocal_1 > var_1_13 [L133] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=257, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L138] unsigned char stepLocal_4 = var_1_24; [L139] unsigned long int stepLocal_3 = var_1_4; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_3=2, stepLocal_4=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=257, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L140] COND TRUE (var_1_24 && var_1_24) && stepLocal_4 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_3=2, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=257, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L141] COND FALSE !(stepLocal_3 == (- var_1_13)) [L144] var_1_7 = 0 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=257, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L149] COND FALSE !((var_1_4 <= var_1_18) && var_1_7) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=257, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L215] RET step() [L216] CALL, EXPR property() [L206] EXPR ((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=257, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L206] EXPR (last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6)) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=257, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L206] EXPR ((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=257, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L206-L207] return ((((((((((((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6)))) && (var_1_14 == ((unsigned long int) (var_1_6 + var_1_15)))) && ((! (! (last_1_var_1_7 && last_1_var_1_24))) ? (last_1_var_1_7 ? (var_1_15 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_23)) ? (last_1_var_1_33) : (last_1_var_1_23))))) : (var_1_15 == ((unsigned short int) (((((var_1_16 - var_1_6)) < (10)) ? ((var_1_16 - var_1_6)) : (10)))))) : (var_1_15 == ((unsigned short int) last_1_var_1_23)))) && (((var_1_4 <= var_1_18) && var_1_7) ? ((var_1_23 == var_1_1) ? (var_1_17 == ((unsigned long int) var_1_6)) : 1) : 1)) && ((last_1_var_1_33 <= ((last_1_var_1_17 / var_1_4) / var_1_16)) ? (last_1_var_1_24 ? (var_1_18 == ((signed char) (var_1_21 - var_1_22))) : (var_1_11 ? (var_1_18 == ((signed char) var_1_22)) : 1)) : (var_1_18 == ((signed char) var_1_21)))) && ((var_1_14 < var_1_13) ? (var_1_23 == ((signed long int) (((((var_1_14 + var_1_16)) < ((((((var_1_18 - var_1_14)) < (-128)) ? ((var_1_18 - var_1_14)) : (-128))))) ? ((var_1_14 + var_1_16)) : ((((((var_1_18 - var_1_14)) < (-128)) ? ((var_1_18 - var_1_14)) : (-128)))))))) : (var_1_23 == ((signed long int) var_1_18)))) && ((! last_1_var_1_24) ? ((last_1_var_1_7 && (last_1_var_1_33 >= ((((last_1_var_1_17) < (var_1_4)) ? (last_1_var_1_17) : (var_1_4))))) ? (var_1_24 == ((unsigned char) (var_1_10 || ((var_1_25 || var_1_26) || var_1_27)))) : (var_1_24 == ((unsigned char) var_1_12))) : (var_1_24 == ((unsigned char) var_1_12)))) && ((var_1_15 < var_1_4) ? (var_1_24 ? (var_1_28 == ((double) ((var_1_29 - var_1_30) + var_1_31))) : (var_1_28 == ((double) (4.75 + var_1_29)))) : (var_1_28 == ((double) (100.4 + var_1_30))))) && (var_1_32 == ((float) var_1_29))) && (var_1_33 == ((unsigned char) var_1_22))) && (var_1_34 == ((float) var_1_29)) ; [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=257, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=257, var_1_14=9, var_1_15=8, var_1_16=32767, var_1_17=4, var_1_18=-1, var_1_1=257, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=257, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.3s, OverallIterations: 26, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7307 SdHoareTripleChecker+Valid, 17.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7290 mSDsluCounter, 19285 SdHoareTripleChecker+Invalid, 15.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15599 mSDsCounter, 2260 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11792 IncrementalHoareTripleChecker+Invalid, 14052 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2260 mSolverCounterUnsat, 3686 mSDtfsCounter, 11792 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1678 GetRequests, 1212 SyntacticMatches, 6 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3375 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=945occurred in iteration=22, InterpolantAutomatonStates: 354, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 3791 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 39.5s InterpolantComputationTime, 5482 NumberOfCodeBlocks, 5482 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 5450 ConstructedInterpolants, 3 QuantifiedInterpolants, 27944 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1724 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 39743/40300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:54:51,823 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-03 23:54:51,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 331deff5ee9f0a6f0b03656a3ea7e4b679f07dd47c7d7e953a5847c9d589ff92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:54:53,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:54:53,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:54:53,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:54:53,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:54:53,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:54:53,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:54:53,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:54:53,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:54:53,599 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:54:53,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:54:53,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:54:53,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:54:53,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:54:53,600 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:54:53,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:54:53,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:54:53,601 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:54:53,602 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:54:53,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:54:53,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:54:53,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:54:53,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:54:53,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:54:53,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:54:53,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:54:53,603 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:54:53,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:54:53,603 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:54:53,603 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:54:53,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:54:53,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:54:53,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:54:53,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:54:53,604 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 331deff5ee9f0a6f0b03656a3ea7e4b679f07dd47c7d7e953a5847c9d589ff92 [2025-03-03 23:54:53,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:54:53,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:54:53,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:54:53,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:54:53,842 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:54:53,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i