./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i --full-output --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e5b835a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f37ea69c12861b750bd7dcd29c2bdc264f1896af878738e5bb34a3192869cfd --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.theta-eval-2e5b835-m [2024-10-21 17:28:27,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-21 17:28:27,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-21 17:28:27,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-21 17:28:27,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-21 17:28:27,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-21 17:28:27,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-21 17:28:27,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-21 17:28:27,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-21 17:28:27,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-21 17:28:27,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-21 17:28:27,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-21 17:28:27,389 INFO L153 SettingsManager]: * Use SBE=true [2024-10-21 17:28:27,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-21 17:28:27,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-21 17:28:27,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-21 17:28:27,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-21 17:28:27,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-21 17:28:27,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-21 17:28:27,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-21 17:28:27,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-21 17:28:27,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-21 17:28:27,392 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-21 17:28:27,392 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-21 17:28:27,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-21 17:28:27,393 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-21 17:28:27,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-21 17:28:27,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-21 17:28:27,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-21 17:28:27,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-21 17:28:27,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-21 17:28:27,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-21 17:28:27,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-21 17:28:27,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-21 17:28:27,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-21 17:28:27,396 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-21 17:28:27,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-21 17:28:27,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-21 17:28:27,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-21 17:28:27,397 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-21 17:28:27,397 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-21 17:28:27,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/UGemCutter-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 -> GemCutter 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 -> 2f37ea69c12861b750bd7dcd29c2bdc264f1896af878738e5bb34a3192869cfd Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2024-10-21 17:28:27,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-21 17:28:27,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-21 17:28:27,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-21 17:28:27,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-21 17:28:27,612 INFO L274 PluginConnector]: CDTParser initialized [2024-10-21 17:28:27,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i [2024-10-21 17:28:28,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-21 17:28:29,003 INFO L384 CDTParser]: Found 1 translation units. [2024-10-21 17:28:29,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i [2024-10-21 17:28:29,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/10fa1a7c7/9c30ebb4546d413cb2a84058246cb083/FLAG29795170a [2024-10-21 17:28:29,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/10fa1a7c7/9c30ebb4546d413cb2a84058246cb083 [2024-10-21 17:28:29,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-21 17:28:29,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-21 17:28:29,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-21 17:28:29,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-21 17:28:29,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-21 17:28:29,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f4747c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29, skipping insertion in model container [2024-10-21 17:28:29,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-21 17:28:29,694 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i[32963,32976] [2024-10-21 17:28:29,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-21 17:28:29,714 INFO L200 MainTranslator]: Completed pre-run [2024-10-21 17:28:29,740 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i[32963,32976] [2024-10-21 17:28:29,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-21 17:28:29,766 INFO L204 MainTranslator]: Completed translation [2024-10-21 17:28:29,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29 WrapperNode [2024-10-21 17:28:29,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-21 17:28:29,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-21 17:28:29,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-21 17:28:29,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-21 17:28:29,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,795 INFO L138 Inliner]: procedures = 168, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2024-10-21 17:28:29,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-21 17:28:29,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-21 17:28:29,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-21 17:28:29,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-21 17:28:29,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-21 17:28:29,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-21 17:28:29,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-21 17:28:29,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-21 17:28:29,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (1/1) ... [2024-10-21 17:28:29,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-21 17:28:29,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:28:29,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-21 17:28:29,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-21 17:28:29,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-21 17:28:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-10-21 17:28:29,866 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-10-21 17:28:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-10-21 17:28:29,866 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-10-21 17:28:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-21 17:28:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-21 17:28:29,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-21 17:28:29,867 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-21 17:28:29,956 INFO L238 CfgBuilder]: Building ICFG [2024-10-21 17:28:29,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-21 17:28:30,044 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-21 17:28:30,044 INFO L287 CfgBuilder]: Performing block encoding [2024-10-21 17:28:30,055 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-21 17:28:30,055 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-21 17:28:30,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 05:28:30 BoogieIcfgContainer [2024-10-21 17:28:30,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-21 17:28:30,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-21 17:28:30,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-21 17:28:30,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-21 17:28:30,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 05:28:29" (1/3) ... [2024-10-21 17:28:30,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535f5c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 05:28:30, skipping insertion in model container [2024-10-21 17:28:30,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 05:28:29" (2/3) ... [2024-10-21 17:28:30,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535f5c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 05:28:30, skipping insertion in model container [2024-10-21 17:28:30,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 05:28:30" (3/3) ... [2024-10-21 17:28:30,063 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2024-10-21 17:28:30,074 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-21 17:28:30,074 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-21 17:28:30,074 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-21 17:28:30,114 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-21 17:28:30,142 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-21 17:28:30,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-21 17:28:30,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:28:30,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-21 17:28:30,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-21 17:28:30,169 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-21 17:28:30,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork1 ======== [2024-10-21 17:28:30,182 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=PARTIAL_ORDER_FA, 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;@7bf385af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-21 17:28:30,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-21 17:28:30,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:28:30,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:28:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1308854471, now seen corresponding path program 1 times [2024-10-21 17:28:30,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:28:30,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860917648] [2024-10-21 17:28:30,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:30,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:28:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:30,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:28:30,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860917648] [2024-10-21 17:28:30,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860917648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-21 17:28:30,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-21 17:28:30,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-21 17:28:30,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445042848] [2024-10-21 17:28:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-21 17:28:30,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-21 17:28:30,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:28:30,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-21 17:28:30,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-21 17:28:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:30,837 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:28:30,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:28:30,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:30,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-21 17:28:30,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:28:30,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:28:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1582811473, now seen corresponding path program 1 times [2024-10-21 17:28:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:28:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287899927] [2024-10-21 17:28:30,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:30,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:28:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:31,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:28:31,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287899927] [2024-10-21 17:28:31,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287899927] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-21 17:28:31,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725559710] [2024-10-21 17:28:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:31,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:28:31,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:28:31,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-21 17:28:31,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-21 17:28:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:31,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-21 17:28:31,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-21 17:28:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:31,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-21 17:28:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:31,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725559710] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-21 17:28:31,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-21 17:28:31,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-10-21 17:28:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561323479] [2024-10-21 17:28:31,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-21 17:28:31,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-21 17:28:31,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:28:31,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-21 17:28:31,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-21 17:28:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:31,509 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:28:31,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:28:31,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:31,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-21 17:28:31,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-21 17:28:31,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-21 17:28:31,922 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:28:31,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:28:31,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1095381915, now seen corresponding path program 2 times [2024-10-21 17:28:31,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:28:31,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180365168] [2024-10-21 17:28:31,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:31,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:28:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:32,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:28:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180365168] [2024-10-21 17:28:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180365168] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-21 17:28:32,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414156536] [2024-10-21 17:28:32,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-21 17:28:32,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:28:32,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:28:32,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-21 17:28:32,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-21 17:28:32,203 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-21 17:28:32,203 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-21 17:28:32,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-21 17:28:32,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-21 17:28:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:32,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-21 17:28:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414156536] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-21 17:28:32,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-21 17:28:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2024-10-21 17:28:32,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118298924] [2024-10-21 17:28:32,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-21 17:28:32,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-21 17:28:32,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:28:32,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-21 17:28:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2024-10-21 17:28:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:32,577 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:28:32,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.258064516129032) internal successors, (163), 31 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:28:32,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:32,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-21 17:28:32,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-21 17:28:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-21 17:28:32,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-21 17:28:33,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:28:33,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:28:33,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:28:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1302340979, now seen corresponding path program 3 times [2024-10-21 17:28:33,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:28:33,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510184248] [2024-10-21 17:28:33,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:33,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:28:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:33,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:28:33,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510184248] [2024-10-21 17:28:33,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510184248] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-21 17:28:33,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905833296] [2024-10-21 17:28:33,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-21 17:28:33,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:28:33,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:28:33,490 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-21 17:28:33,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-21 17:28:33,545 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-21 17:28:33,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-21 17:28:33,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-21 17:28:33,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-21 17:28:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-21 17:28:33,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-21 17:28:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905833296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-21 17:28:33,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-21 17:28:33,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [21] total 29 [2024-10-21 17:28:33,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125632310] [2024-10-21 17:28:33,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-21 17:28:33,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-21 17:28:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:28:33,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-21 17:28:33,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-10-21 17:28:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:33,724 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:28:33,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:28:33,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:33,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-21 17:28:33,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-21 17:28:33,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:28:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:28:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:28:34,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-21 17:28:34,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:28:34,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:28:34,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:28:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1129072913, now seen corresponding path program 2 times [2024-10-21 17:28:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:28:34,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492065892] [2024-10-21 17:28:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:28:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:34,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:28:34,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492065892] [2024-10-21 17:28:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492065892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-21 17:28:34,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-21 17:28:34,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-21 17:28:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529666646] [2024-10-21 17:28:34,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-21 17:28:34,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-21 17:28:34,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:28:34,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-21 17:28:34,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-21 17:28:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:34,517 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:28:34,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:28:34,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:34,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:28:34,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:28:34,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:28:34,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:28:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:28:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:28:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:28:34,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-21 17:28:34,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:28:34,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:28:34,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1163354213, now seen corresponding path program 4 times [2024-10-21 17:28:34,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:28:34,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883012115] [2024-10-21 17:28:34,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:34,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:28:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:34,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:28:34,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883012115] [2024-10-21 17:28:34,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883012115] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-21 17:28:34,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926909376] [2024-10-21 17:28:34,886 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-21 17:28:34,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:28:34,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:28:34,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-21 17:28:34,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-21 17:28:34,931 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-21 17:28:34,931 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-21 17:28:34,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-21 17:28:34,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-21 17:28:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:35,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-21 17:28:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926909376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-21 17:28:35,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-21 17:28:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-10-21 17:28:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710991301] [2024-10-21 17:28:35,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-21 17:28:35,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-21 17:28:35,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:28:35,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-21 17:28:35,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2024-10-21 17:28:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:35,269 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:28:35,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.37037037037037) internal successors, (118), 27 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:28:35,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:35,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:28:35,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:28:35,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:28:35,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:28:35,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:28:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:28:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:28:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:28:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:28:37,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-21 17:28:37,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-21 17:28:37,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:28:37,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:28:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -877343057, now seen corresponding path program 5 times [2024-10-21 17:28:37,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:28:37,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957676634] [2024-10-21 17:28:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:37,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:28:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-21 17:28:38,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:28:38,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957676634] [2024-10-21 17:28:38,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957676634] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-21 17:28:38,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146084269] [2024-10-21 17:28:38,055 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-21 17:28:38,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:28:38,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:28:38,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-21 17:28:38,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-21 17:28:38,105 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-21 17:28:38,105 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-21 17:28:38,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-21 17:28:38,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-21 17:28:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:38,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-21 17:28:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:38,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146084269] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-21 17:28:38,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-21 17:28:38,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2024-10-21 17:28:38,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378297062] [2024-10-21 17:28:38,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-21 17:28:38,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-21 17:28:38,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:28:38,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-21 17:28:38,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2024-10-21 17:28:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:38,502 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:28:38,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.0285714285714285) internal successors, (176), 35 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:28:38,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:38,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:28:38,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:28:38,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:28:38,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:28:38,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:28:38,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:28:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:28:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:28:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:28:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:28:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:28:40,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-21 17:28:41,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:28:41,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:28:41,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:28:41,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1147053731, now seen corresponding path program 1 times [2024-10-21 17:28:41,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:28:41,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954374610] [2024-10-21 17:28:41,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:41,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:28:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 34 proven. 78 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-10-21 17:28:41,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:28:41,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954374610] [2024-10-21 17:28:41,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954374610] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-21 17:28:41,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212955177] [2024-10-21 17:28:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:41,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:28:41,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:28:41,441 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-21 17:28:41,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-21 17:28:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:41,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-21 17:28:41,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-21 17:28:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 63 proven. 175 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-21 17:28:41,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-21 17:28:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 63 proven. 175 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-21 17:28:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212955177] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-21 17:28:42,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-21 17:28:42,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 21] total 54 [2024-10-21 17:28:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001525230] [2024-10-21 17:28:42,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-21 17:28:42,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-21 17:28:42,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:28:42,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-21 17:28:42,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2502, Unknown=0, NotChecked=0, Total=2862 [2024-10-21 17:28:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:42,260 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:28:42,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.666666666666667) internal successors, (252), 54 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:28:42,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:42,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:28:42,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:28:42,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:28:42,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:28:42,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:28:42,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:28:42,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:28:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:28:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:28:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:28:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:28:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:28:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2024-10-21 17:28:50,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-21 17:28:50,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-21 17:28:50,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:28:50,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:28:50,646 INFO L85 PathProgramCache]: Analyzing trace with hash -985488855, now seen corresponding path program 2 times [2024-10-21 17:28:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:28:50,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508327157] [2024-10-21 17:28:50,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:28:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:28:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:28:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 15 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:51,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:28:51,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508327157] [2024-10-21 17:28:51,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508327157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-21 17:28:51,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828358346] [2024-10-21 17:28:51,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-21 17:28:51,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:28:51,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:28:51,337 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-21 17:28:51,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-21 17:28:51,401 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-21 17:28:51,401 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-21 17:28:51,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-21 17:28:51,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-21 17:28:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 15 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:52,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-21 17:28:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 15 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:28:54,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828358346] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-21 17:28:54,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-21 17:28:54,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 40] total 108 [2024-10-21 17:28:54,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573383793] [2024-10-21 17:28:54,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-21 17:28:54,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2024-10-21 17:28:54,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:28:54,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2024-10-21 17:28:54,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2276, Invalid=9280, Unknown=0, NotChecked=0, Total=11556 [2024-10-21 17:28:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:28:54,299 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:28:54,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 4.194444444444445) internal successors, (453), 108 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:28:54,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:28:54,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:28:54,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:28:54,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:28:54,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:28:54,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:28:54,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:28:54,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 291 states. [2024-10-21 17:28:54,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:29:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:29:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:29:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:29:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:29:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:29:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:29:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:29:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2024-10-21 17:29:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2024-10-21 17:29:01,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-21 17:29:02,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:29:02,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:29:02,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:29:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash -166112567, now seen corresponding path program 3 times [2024-10-21 17:29:02,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:29:02,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038543897] [2024-10-21 17:29:02,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:29:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:29:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:29:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 31 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:29:03,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:29:03,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038543897] [2024-10-21 17:29:03,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038543897] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-21 17:29:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685576078] [2024-10-21 17:29:03,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-21 17:29:03,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:29:03,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:29:03,988 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-21 17:29:03,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-21 17:29:04,035 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-21 17:29:04,036 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-21 17:29:04,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-21 17:29:04,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-21 17:29:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 3510 trivial. 0 not checked. [2024-10-21 17:29:04,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-21 17:29:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685576078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-21 17:29:04,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-21 17:29:04,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [69] total 77 [2024-10-21 17:29:04,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449206329] [2024-10-21 17:29:04,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-21 17:29:04,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-21 17:29:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:29:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-21 17:29:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1118, Invalid=4734, Unknown=0, NotChecked=0, Total=5852 [2024-10-21 17:29:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:29:04,409 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:29:04,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:29:04,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:29:04,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:29:04,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:29:04,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:29:04,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:29:04,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:29:04,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:29:04,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 291 states. [2024-10-21 17:29:04,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 194 states. [2024-10-21 17:29:04,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:29:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:29:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:29:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:29:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:29:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:29:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:29:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:29:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2024-10-21 17:29:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2024-10-21 17:29:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-21 17:29:05,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-21 17:29:05,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-21 17:29:05,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:29:05,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:29:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash 599045001, now seen corresponding path program 1 times [2024-10-21 17:29:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:29:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485087254] [2024-10-21 17:29:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:29:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:29:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:29:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 31 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:29:07,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:29:07,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485087254] [2024-10-21 17:29:07,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485087254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-21 17:29:07,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825407631] [2024-10-21 17:29:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:29:07,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:29:07,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:29:07,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-21 17:29:07,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-21 17:29:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:29:07,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-21 17:29:07,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-21 17:29:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 31 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:29:09,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-21 17:29:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 31 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:29:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825407631] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-21 17:29:11,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-21 17:29:11,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 199 [2024-10-21 17:29:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155021998] [2024-10-21 17:29:11,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-21 17:29:11,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 199 states [2024-10-21 17:29:11,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:29:11,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2024-10-21 17:29:11,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8467, Invalid=30935, Unknown=0, NotChecked=0, Total=39402 [2024-10-21 17:29:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:29:11,668 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:29:11,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 199 states, 199 states have (on average 4.1959798994974875) internal successors, (835), 199 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:29:11,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:29:11,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:29:11,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:29:11,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:29:11,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:29:11,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:29:11,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:29:11,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 291 states. [2024-10-21 17:29:11,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 194 states. [2024-10-21 17:29:11,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-21 17:29:11,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-21 17:29:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 382 states. [2024-10-21 17:29:36,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-21 17:29:37,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-21 17:29:37,054 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:29:37,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:29:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1162966217, now seen corresponding path program 2 times [2024-10-21 17:29:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:29:37,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403376253] [2024-10-21 17:29:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:29:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:29:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-21 17:29:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 63 proven. 15687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:29:43,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-21 17:29:43,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403376253] [2024-10-21 17:29:43,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403376253] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-21 17:29:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768727620] [2024-10-21 17:29:43,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-21 17:29:43,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:29:43,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-21 17:29:43,919 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-21 17:29:43,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-21 17:29:44,027 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-21 17:29:44,027 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-21 17:29:44,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-10-21 17:29:44,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-21 17:29:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 63 proven. 15687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:29:50,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-21 17:29:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 63 proven. 15687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-21 17:29:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768727620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-21 17:29:57,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-21 17:29:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133, 133] total 336 [2024-10-21 17:29:57,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708085461] [2024-10-21 17:29:57,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-21 17:29:57,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 336 states [2024-10-21 17:29:57,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-21 17:29:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 336 interpolants. [2024-10-21 17:29:57,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23494, Invalid=89066, Unknown=0, NotChecked=0, Total=112560 [2024-10-21 17:29:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:29:57,796 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-21 17:29:57,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 336 states, 336 states have (on average 4.127976190476191) internal successors, (1387), 336 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-21 17:29:57,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:29:57,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:29:57,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:29:57,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:29:57,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:29:57,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:29:57,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:29:57,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 291 states. [2024-10-21 17:29:57,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 194 states. [2024-10-21 17:29:57,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-21 17:29:57,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 382 states. [2024-10-21 17:29:57,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-21 17:31:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-21 17:31:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-21 17:31:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-21 17:31:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-21 17:31:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-21 17:31:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-10-21 17:31:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-10-21 17:31:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2024-10-21 17:31:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2024-10-21 17:31:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-21 17:31:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 382 states. [2024-10-21 17:31:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 604 states. [2024-10-21 17:31:21,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-21 17:31:21,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-21 17:31:21,702 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-21 17:31:21,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-21 17:31:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash 415434555, now seen corresponding path program 3 times [2024-10-21 17:31:21,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-21 17:31:21,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151530447] [2024-10-21 17:31:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-21 17:31:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-21 17:31:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-21 17:31:21,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-21 17:31:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-21 17:31:22,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-21 17:31:22,388 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-21 17:31:22,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-21 17:31:22,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-21 17:31:22,394 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 3, 2] [2024-10-21 17:31:22,395 INFO L312 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork1 was UNSAFE (1/3) [2024-10-21 17:31:22,593 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-21 17:31:22,593 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-21 17:31:22,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 05:31:22 BasicIcfg [2024-10-21 17:31:22,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-21 17:31:22,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-21 17:31:22,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-21 17:31:22,596 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-21 17:31:22,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 05:28:30" (3/4) ... [2024-10-21 17:31:22,597 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-21 17:31:22,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-21 17:31:22,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-21 17:31:22,773 INFO L158 Benchmark]: Toolchain (without parser) took 173409.89ms. Allocated memory was 165.7MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 108.7MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-21 17:31:22,773 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-21 17:31:22,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.20ms. Allocated memory is still 165.7MB. Free memory was 108.7MB in the beginning and 123.8MB in the end (delta: -15.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-21 17:31:22,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.76ms. Allocated memory is still 165.7MB. Free memory was 123.8MB in the beginning and 121.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-21 17:31:22,774 INFO L158 Benchmark]: Boogie Preprocessor took 16.65ms. Allocated memory is still 165.7MB. Free memory was 121.6MB in the beginning and 120.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-21 17:31:22,774 INFO L158 Benchmark]: RCFGBuilder took 242.59ms. Allocated memory is still 165.7MB. Free memory was 120.3MB in the beginning and 106.8MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-21 17:31:22,774 INFO L158 Benchmark]: TraceAbstraction took 172537.08ms. Allocated memory was 165.7MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 106.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-21 17:31:22,774 INFO L158 Benchmark]: Witness Printer took 177.14ms. Allocated memory is still 3.3GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 116.4MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2024-10-21 17:31:22,775 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.12ms. Allocated memory is still 96.5MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.20ms. Allocated memory is still 165.7MB. Free memory was 108.7MB in the beginning and 123.8MB in the end (delta: -15.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.76ms. Allocated memory is still 165.7MB. Free memory was 123.8MB in the beginning and 121.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.65ms. Allocated memory is still 165.7MB. Free memory was 121.6MB in the beginning and 120.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 242.59ms. Allocated memory is still 165.7MB. Free memory was 120.3MB in the beginning and 106.8MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 172537.08ms. Allocated memory was 165.7MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 106.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 177.14ms. Allocated memory is still 3.3GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 116.4MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 184648, independent: 173857, independent conditional: 172129, independent unconditional: 1728, dependent: 10791, dependent conditional: 10783, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173892, independent: 173857, independent conditional: 172129, independent unconditional: 1728, dependent: 35, dependent conditional: 27, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173892, independent: 173857, independent conditional: 172129, independent unconditional: 1728, dependent: 35, dependent conditional: 27, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 174060, independent: 173857, independent conditional: 172129, independent unconditional: 1728, dependent: 203, dependent conditional: 195, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 174060, independent: 173857, independent conditional: 0, independent unconditional: 173857, dependent: 203, dependent conditional: 168, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 174060, independent: 173857, independent conditional: 0, independent unconditional: 173857, dependent: 203, dependent conditional: 168, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1654, independent: 1617, independent conditional: 0, independent unconditional: 1617, dependent: 37, dependent conditional: 29, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1654, independent: 1616, independent conditional: 0, independent unconditional: 1616, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 38, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 37, dependent conditional: 29, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 37, dependent conditional: 29, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 323, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 217, dependent conditional: 127, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 174060, independent: 172240, independent conditional: 0, independent unconditional: 172240, dependent: 166, dependent conditional: 139, dependent unconditional: 27, unknown: 1654, unknown conditional: 29, unknown unconditional: 1625] , Statistics on independence cache: Total cache size (in pairs): 1654, Positive cache size: 1617, Positive conditional cache size: 0, Positive unconditional cache size: 1617, Negative cache size: 37, Negative conditional cache size: 29, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 172156, Maximal queried relation: 10, Independence queries for same thread: 10756, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 515, Number of trivial persistent sets: 457, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1736, independent: 1728, independent conditional: 0, independent unconditional: 1728, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 184648, independent: 173857, independent conditional: 172129, independent unconditional: 1728, dependent: 10791, dependent conditional: 10783, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173892, independent: 173857, independent conditional: 172129, independent unconditional: 1728, dependent: 35, dependent conditional: 27, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173892, independent: 173857, independent conditional: 172129, independent unconditional: 1728, dependent: 35, dependent conditional: 27, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 174060, independent: 173857, independent conditional: 172129, independent unconditional: 1728, dependent: 203, dependent conditional: 195, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 174060, independent: 173857, independent conditional: 0, independent unconditional: 173857, dependent: 203, dependent conditional: 168, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 174060, independent: 173857, independent conditional: 0, independent unconditional: 173857, dependent: 203, dependent conditional: 168, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1654, independent: 1617, independent conditional: 0, independent unconditional: 1617, dependent: 37, dependent conditional: 29, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1654, independent: 1616, independent conditional: 0, independent unconditional: 1616, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 38, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 37, dependent conditional: 29, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 37, dependent conditional: 29, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 323, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 217, dependent conditional: 127, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 174060, independent: 172240, independent conditional: 0, independent unconditional: 172240, dependent: 166, dependent conditional: 139, dependent unconditional: 27, unknown: 1654, unknown conditional: 29, unknown unconditional: 1625] , Statistics on independence cache: Total cache size (in pairs): 1654, Positive cache size: 1617, Positive conditional cache size: 0, Positive unconditional cache size: 1617, Negative cache size: 37, Negative conditional cache size: 29, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 172156, Maximal queried relation: 10, Independence queries for same thread: 10756 - CounterExampleResult [Line: 750]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L751] 0 int _N; VAL [_N=0] [L752] 0 atomic_int limit; VAL [_N=0, limit=0] [L772] 0 _N = 100 VAL [_N=100, limit=0] [L773] 0 pthread_t t1, t2; VAL [_N=100, limit=0] [L774] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=100, limit=0, t1=-1] [L754] 1 int i, bound; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0] [L755] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=100, limit=0] [L775] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=100, limit=0, t1=-1, t2=0] [L763] 2 int i, bound; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0] [L764] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L765] 2 limit = lim VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L756] 1 limit = lim VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L757] 1 bound = limit VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, lim=100, limit=100] [L758] 1 i = 0 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=100, limit=100] [L766] 2 bound = limit VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, lim=101, limit=100] [L767] 2 i = 0 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L758] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=100, limit=100] [L758] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=100, limit=100] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L767] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L758] COND FALSE 1 !(i < bound) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=100, limit=100] [L759] CALL 1 __VERIFIER_assert(i == lim) [L750] COND FALSE 1 !(!expression) VAL [\old(expression)=1, _N=100, expression=1, limit=100] [L759] RET 1 __VERIFIER_assert(i == lim) [L760] 1 return 0; VAL [\old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=100, limit=100] [L776] FCALL, JOIN 1 pthread_join(t1, 0) VAL [_N=100, limit=100, t1=-1, t2=0] [L767] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L768] CALL 2 __VERIFIER_assert(i == lim) [L750] COND TRUE 2 !expression VAL [\old(expression)=0, _N=100, expression=0, limit=100] [L750] 2 reach_error() VAL [\old(expression)=0, _N=100, expression=0, limit=100] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: f2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 126 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 172.2s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 131.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1729, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 36.5s InterpolantComputationTime, 4577 NumberOfCodeBlocks, 4294 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 5100 ConstructedInterpolants, 0 QuantifiedInterpolants, 25968 SizeOfPredicates, 302 NumberOfNonLiveVariables, 2601 ConjunctsInSsa, 323 ConjunctsInUnsatCore, 30 InterpolantComputations, 4 PerfectInterpolantSequences, 4659/70172 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-21 17:31:22,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-10-21 17:31:23,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE