/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 13:40:33,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 13:40:33,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 13:40:33,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 13:40:33,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 13:40:33,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 13:40:33,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 13:40:33,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 13:40:33,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 13:40:33,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 13:40:33,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 13:40:33,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 13:40:33,157 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 13:40:33,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 13:40:33,158 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 13:40:33,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 13:40:33,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:40:33,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:40:33,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:40:33,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:40:33,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:40:33,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 13:40:33,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 13:40:33,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 13:40:33,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 13:40:33,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 13:40:33,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 13:40:33,375 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 13:40:33,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-04-14 13:40:34,626 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5077d68/ed0a4a6c0ac1495fbcb1e264c9a1a842/FLAGff560c301 [2025-04-14 13:40:34,830 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 13:40:34,830 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-04-14 13:40:34,845 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5077d68/ed0a4a6c0ac1495fbcb1e264c9a1a842/FLAGff560c301 [2025-04-14 13:40:35,627 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5077d68/ed0a4a6c0ac1495fbcb1e264c9a1a842 [2025-04-14 13:40:35,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 13:40:35,630 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 13:40:35,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 13:40:35,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 13:40:35,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 13:40:35,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:40:35" (1/1) ... [2025-04-14 13:40:35,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198ee2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:35, skipping insertion in model container [2025-04-14 13:40:35,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:40:35" (1/1) ... [2025-04-14 13:40:35,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 13:40:35,922 WARN L250 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[33026,33039] [2025-04-14 13:40:35,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:40:35,946 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 13:40:36,009 WARN L250 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[33026,33039] [2025-04-14 13:40:36,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:40:36,040 INFO L204 MainTranslator]: Completed translation [2025-04-14 13:40:36,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36 WrapperNode [2025-04-14 13:40:36,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 13:40:36,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 13:40:36,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 13:40:36,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 13:40:36,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,076 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-04-14 13:40:36,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 13:40:36,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 13:40:36,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 13:40:36,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 13:40:36,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,091 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 13:40:36,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 13:40:36,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 13:40:36,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 13:40:36,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (1/1) ... [2025-04-14 13:40:36,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:40:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:36,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 13:40:36,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 13:40:36,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 13:40:36,141 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 13:40:36,141 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 13:40:36,141 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 13:40:36,141 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 13:40:36,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 13:40:36,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 13:40:36,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 13:40:36,142 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 13:40:36,223 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 13:40:36,224 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 13:40:36,345 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 13:40:36,345 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 13:40:36,419 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 13:40:36,419 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 13:40:36,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:40:36 BoogieIcfgContainer [2025-04-14 13:40:36,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 13:40:36,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 13:40:36,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 13:40:36,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 13:40:36,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:40:35" (1/3) ... [2025-04-14 13:40:36,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d57b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:40:36, skipping insertion in model container [2025-04-14 13:40:36,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:40:36" (2/3) ... [2025-04-14 13:40:36,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d57b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:40:36, skipping insertion in model container [2025-04-14 13:40:36,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:40:36" (3/3) ... [2025-04-14 13:40:36,429 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2025-04-14 13:40:36,438 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 13:40:36,439 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 27 locations, 28 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-14 13:40:36,439 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 13:40:36,477 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 13:40:36,507 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:36,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 13:40:36,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:36,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 13:40:36,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 13:40:36,568 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:36,580 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2025-04-14 13:40:36,585 INFO L340 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;@3055e756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:36,585 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 13:40:36,723 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:36,723 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:36,723 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #1 [2025-04-14 13:40:36,723 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:36,723 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:36,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash 210329393, now seen corresponding path program 1 times [2025-04-14 13:40:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:36,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424719747] [2025-04-14 13:40:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:36,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 13:40:36,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 13:40:36,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:36,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:36,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424719747] [2025-04-14 13:40:36,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424719747] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:36,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:36,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:40:36,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361816916] [2025-04-14 13:40:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:36,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:40:36,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:36,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:40:36,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:40:36,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:36,999 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:37,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2025-04-14 13:40:37,000 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:37,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:37,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 13:40:37,100 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:37,100 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:37,100 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #2 [2025-04-14 13:40:37,101 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:37,101 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:37,115 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:37,115 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:37,115 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:37,115 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:37,115 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:37,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:37,115 INFO L85 PathProgramCache]: Analyzing trace with hash 261806747, now seen corresponding path program 1 times [2025-04-14 13:40:37,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:37,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872621337] [2025-04-14 13:40:37,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:37,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:37,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:40:37,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:40:37,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:37,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:37,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872621337] [2025-04-14 13:40:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872621337] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:37,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626983416] [2025-04-14 13:40:37,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:37,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:37,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:37,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:37,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 13:40:37,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:40:37,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:40:37,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:37,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:37,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 13:40:37,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:37,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:37,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626983416] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:37,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:37,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-14 13:40:37,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575848704] [2025-04-14 13:40:37,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:37,453 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 13:40:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:37,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 13:40:37,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-14 13:40:37,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:37,454 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:37,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 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) [2025-04-14 13:40:37,454 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:37,454 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:37,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:37,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:37,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 13:40:37,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-14 13:40:37,806 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:37,806 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:37,807 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #3 [2025-04-14 13:40:37,807 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:37,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:37,807 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:37,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:37,807 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:37,807 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:37,807 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:37,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:37,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1442144807, now seen corresponding path program 2 times [2025-04-14 13:40:37,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:37,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948876817] [2025-04-14 13:40:37,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:37,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:37,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 13:40:37,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:40:37,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:40:37,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:37,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:37,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948876817] [2025-04-14 13:40:37,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948876817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:37,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525674037] [2025-04-14 13:40:37,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:37,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:37,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:37,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:37,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 13:40:38,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 13:40:38,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:40:38,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:40:38,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:38,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 13:40:38,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:38,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525674037] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:38,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:38,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-14 13:40:38,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439090329] [2025-04-14 13:40:38,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:38,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 13:40:38,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:38,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 13:40:38,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-14 13:40:38,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:38,233 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:38,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 states have internal predecessors, (56), 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) [2025-04-14 13:40:38,233 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:38,233 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:38,233 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:38,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:38,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:38,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:38,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 13:40:38,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:38,704 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:38,704 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:38,704 INFO L139 ounterexampleChecker]: Examining path program with hash -2061443893, occurence #4 [2025-04-14 13:40:38,704 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:38,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:38,704 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:38,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:38,705 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:38,705 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:38,705 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:38,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:38,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1581428523, now seen corresponding path program 3 times [2025-04-14 13:40:38,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:38,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719897194] [2025-04-14 13:40:38,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:40:38,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:38,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-04-14 13:40:38,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 35 statements. [2025-04-14 13:40:38,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 13:40:38,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-04-14 13:40:38,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:38,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719897194] [2025-04-14 13:40:38,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719897194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:38,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192100032] [2025-04-14 13:40:38,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:40:38,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:38,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:38,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:38,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 13:40:38,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-04-14 13:40:38,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 35 statements. [2025-04-14 13:40:38,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 13:40:38,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:38,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 13:40:38,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-04-14 13:40:38,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:40:38,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192100032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:38,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:40:38,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-04-14 13:40:38,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742294362] [2025-04-14 13:40:38,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:38,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:40:38,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:38,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:40:38,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:40:38,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:38,903 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:38,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2025-04-14 13:40:38,903 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:38,903 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:38,903 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:38,903 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:39,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:39,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:39,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:39,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:39,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 13:40:39,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:39,401 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:39,401 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:39,402 INFO L139 ounterexampleChecker]: Examining path program with hash 1535588422, occurence #1 [2025-04-14 13:40:39,402 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:39,402 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:39,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:39,402 INFO L85 PathProgramCache]: Analyzing trace with hash 999831025, now seen corresponding path program 2 times [2025-04-14 13:40:39,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:39,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6001980] [2025-04-14 13:40:39,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:39,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-04-14 13:40:39,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 13:40:39,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 13:40:39,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:39,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6001980] [2025-04-14 13:40:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6001980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:39,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:39,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:40:39,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19393640] [2025-04-14 13:40:39,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:39,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:40:39,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:39,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:40:39,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:40:39,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:39,461 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:39,461 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2025-04-14 13:40:39,461 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:39,461 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:39,461 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:39,461 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:39,461 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:39,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:39,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:39,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:39,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:39,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:39,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 13:40:39,558 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:39,558 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:39,558 INFO L139 ounterexampleChecker]: Examining path program with hash 1535588422, occurence #2 [2025-04-14 13:40:39,558 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:39,558 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:39,558 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:39,558 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:40:39,558 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:39,558 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:39,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:39,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956904, now seen corresponding path program 1 times [2025-04-14 13:40:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 13:40:39,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976535922] [2025-04-14 13:40:39,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:39,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 13:40:39,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 13:40:39,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:39,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:39,575 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 13:40:39,576 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 13:40:39,576 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:39,576 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:39,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1236336293, now seen corresponding path program 4 times [2025-04-14 13:40:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:39,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347298236] [2025-04-14 13:40:39,576 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 13:40:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:39,582 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-14 13:40:39,584 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 17 statements. [2025-04-14 13:40:39,584 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 13:40:39,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:40:39,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:39,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347298236] [2025-04-14 13:40:39,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347298236] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:39,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911761807] [2025-04-14 13:40:39,671 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 13:40:39,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:39,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:39,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:39,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 13:40:39,703 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-14 13:40:39,709 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 17 statements. [2025-04-14 13:40:39,709 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 13:40:39,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:39,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 13:40:39,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:39,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:39,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911761807] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:39,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:39,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-14 13:40:39,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079583988] [2025-04-14 13:40:39,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:39,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 13:40:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:39,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 13:40:39,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-04-14 13:40:39,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:39,853 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:39,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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) [2025-04-14 13:40:39,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:39,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:39,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:39,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:39,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:39,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:40,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:40,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:40,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:40,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:40,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:40,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:40,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 13:40:40,434 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:40,434 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:40,434 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:40,434 INFO L139 ounterexampleChecker]: Examining path program with hash 52044445, occurence #1 [2025-04-14 13:40:40,435 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:40,435 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:40,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash 448656802, now seen corresponding path program 1 times [2025-04-14 13:40:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:40,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549123730] [2025-04-14 13:40:40,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:40,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 13:40:40,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:40:40,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:40,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:40,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:40,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549123730] [2025-04-14 13:40:40,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549123730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:40,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785813380] [2025-04-14 13:40:40,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:40,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:40,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:40,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:40,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 13:40:40,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 13:40:40,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 13:40:40,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:40,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:40,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 13:40:40,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:40,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785813380] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:40,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-14 13:40:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418888536] [2025-04-14 13:40:40,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:40,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 13:40:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:40,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 13:40:40,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-04-14 13:40:40,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:40,670 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:40,670 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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) [2025-04-14 13:40:40,670 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:40,670 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:40,670 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:40,670 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:40,670 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:40,670 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:40,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:40,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:40,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:40,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:40,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:40,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:40,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:40,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:40:40,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 13:40:41,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:41,145 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:41,145 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:41,145 INFO L139 ounterexampleChecker]: Examining path program with hash 52044445, occurence #2 [2025-04-14 13:40:41,145 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:41,145 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:41,145 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:41,145 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:40:41,145 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:41,145 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:41,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:41,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956891, now seen corresponding path program 1 times [2025-04-14 13:40:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 13:40:41,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535360682] [2025-04-14 13:40:41,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:41,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:41,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 13:40:41,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 13:40:41,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:41,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:41,153 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 13:40:41,153 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 13:40:41,153 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:41,153 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:41,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:41,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1343796150, now seen corresponding path program 2 times [2025-04-14 13:40:41,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:41,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348447223] [2025-04-14 13:40:41,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:41,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:41,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 13:40:41,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 13:40:41,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:40:41,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:41,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:41,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348447223] [2025-04-14 13:40:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348447223] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:41,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202819256] [2025-04-14 13:40:41,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:41,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:41,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:41,273 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:41,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 13:40:41,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 13:40:41,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 13:40:41,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:40:41,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:41,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 13:40:41,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:41,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:41,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202819256] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:41,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:41,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-04-14 13:40:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428037638] [2025-04-14 13:40:41,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:41,549 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 13:40:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:41,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 13:40:41,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2025-04-14 13:40:41,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:41,550 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:41,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 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) [2025-04-14 13:40:41,551 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:41,551 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:41,551 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:41,551 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:41,551 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:41,551 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:41,551 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:40:41,551 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:42,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:42,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:42,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:42,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:42,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:42,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:42,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:40:42,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:40:42,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-14 13:40:42,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:42,270 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:42,270 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:42,270 INFO L139 ounterexampleChecker]: Examining path program with hash 52044445, occurence #3 [2025-04-14 13:40:42,270 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:42,270 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:42,270 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:42,270 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:40:42,270 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:42,271 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:42,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956882, now seen corresponding path program 1 times [2025-04-14 13:40:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 13:40:42,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103050488] [2025-04-14 13:40:42,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:42,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 13:40:42,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 13:40:42,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:42,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:42,278 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 13:40:42,278 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 13:40:42,278 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:42,278 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:42,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2038071706, now seen corresponding path program 3 times [2025-04-14 13:40:42,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:42,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54951595] [2025-04-14 13:40:42,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:40:42,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:42,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 15 equivalence classes. [2025-04-14 13:40:42,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 47 statements. [2025-04-14 13:40:42,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 13:40:42,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-04-14 13:40:42,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:42,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54951595] [2025-04-14 13:40:42,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54951595] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:42,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328832923] [2025-04-14 13:40:42,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:40:42,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:42,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:42,371 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:42,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 13:40:42,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 15 equivalence classes. [2025-04-14 13:40:42,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 47 statements. [2025-04-14 13:40:42,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 13:40:42,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:42,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 13:40:42,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-04-14 13:40:42,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:40:42,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328832923] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:42,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:40:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-04-14 13:40:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844158179] [2025-04-14 13:40:42,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:42,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:40:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:42,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:40:42,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:40:42,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:42,467 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:42,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2025-04-14 13:40:42,468 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:42,468 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:42,468 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:42,468 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:42,468 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:42,468 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:42,468 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:40:42,468 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:40:42,468 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:42,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:42,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:42,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:42,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:42,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:42,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:42,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:40:42,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:40:42,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:42,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 13:40:42,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2025-04-14 13:40:42,814 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:42,814 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:42,814 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #1 [2025-04-14 13:40:42,814 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:42,814 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:42,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1706546089, now seen corresponding path program 1 times [2025-04-14 13:40:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:42,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599406198] [2025-04-14 13:40:42,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:42,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 13:40:42,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 13:40:42,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:42,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:43,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:43,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599406198] [2025-04-14 13:40:43,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599406198] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:43,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337550887] [2025-04-14 13:40:43,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:43,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:43,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:43,085 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:43,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 13:40:43,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 13:40:43,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 13:40:43,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:43,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:43,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-14 13:40:43,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:43,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:43,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337550887] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:43,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:43,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2025-04-14 13:40:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244984988] [2025-04-14 13:40:43,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:43,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-14 13:40:43,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:43,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-14 13:40:43,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1005, Invalid=1751, Unknown=0, NotChecked=0, Total=2756 [2025-04-14 13:40:43,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:43,684 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:43,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 52 states have internal predecessors, (119), 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) [2025-04-14 13:40:43,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:43,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:43,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:43,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:43,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:43,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:43,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:40:43,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:40:43,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:43,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:44,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:44,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:44,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:44,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:44,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:44,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:44,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:40:44,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:40:44,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:44,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-14 13:40:44,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 13:40:45,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 13:40:45,126 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:45,126 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:45,126 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #2 [2025-04-14 13:40:45,126 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:45,126 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:45,126 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:45,126 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:40:45,126 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:45,127 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:45,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956871, now seen corresponding path program 1 times [2025-04-14 13:40:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 13:40:45,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360965451] [2025-04-14 13:40:45,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:45,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:45,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 13:40:45,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 13:40:45,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:45,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:45,137 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 13:40:45,137 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 13:40:45,137 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:45,137 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:45,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:45,137 INFO L85 PathProgramCache]: Analyzing trace with hash 215020983, now seen corresponding path program 2 times [2025-04-14 13:40:45,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:45,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041706034] [2025-04-14 13:40:45,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:45,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:45,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-04-14 13:40:45,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-04-14 13:40:45,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:40:45,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:40:45,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:45,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041706034] [2025-04-14 13:40:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041706034] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:45,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507537566] [2025-04-14 13:40:45,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:40:45,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:45,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:45,907 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:45,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 13:40:45,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-04-14 13:40:45,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-04-14 13:40:45,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:40:45,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:45,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 13:40:45,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:46,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 13:40:48,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507537566] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:40:48,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:40:48,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35, 35] total 102 [2025-04-14 13:40:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286734706] [2025-04-14 13:40:48,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:40:48,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2025-04-14 13:40:48,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:48,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2025-04-14 13:40:48,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2625, Invalid=7881, Unknown=0, NotChecked=0, Total=10506 [2025-04-14 13:40:48,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,152 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:48,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.145631067961165) internal successors, (221), 102 states have internal predecessors, (221), 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) [2025-04-14 13:40:48,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:48,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:48,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:48,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:48,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:48,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:48,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:40:48,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:40:48,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:48,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2025-04-14 13:40:48,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:58,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:58,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:58,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:40:58,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:58,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:40:58,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:40:58,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:40:58,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:40:58,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:40:58,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-14 13:40:58,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2025-04-14 13:40:58,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-14 13:40:58,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2025-04-14 13:40:58,748 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:40:58,748 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:58,748 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #3 [2025-04-14 13:40:58,748 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:58,748 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:40:58,748 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:58,748 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:40:58,748 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:58,748 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:40:58,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:58,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956862, now seen corresponding path program 1 times [2025-04-14 13:40:58,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 13:40:58,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355796295] [2025-04-14 13:40:58,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:58,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:58,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 13:40:58,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 13:40:58,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:58,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:58,756 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 13:40:58,756 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 13:40:58,756 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:58,756 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:58,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1570109321, now seen corresponding path program 3 times [2025-04-14 13:40:58,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:58,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421787928] [2025-04-14 13:40:58,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:40:58,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:58,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 144 statements into 63 equivalence classes. [2025-04-14 13:40:58,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) and asserted 144 of 144 statements. [2025-04-14 13:40:58,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2025-04-14 13:40:58,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 0 proven. 3847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:41:00,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:41:00,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421787928] [2025-04-14 13:41:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421787928] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:41:00,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591193660] [2025-04-14 13:41:00,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:41:00,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:41:00,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:41:00,829 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:41:00,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 13:41:00,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 144 statements into 63 equivalence classes. [2025-04-14 13:41:00,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) and asserted 144 of 144 statements. [2025-04-14 13:41:00,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2025-04-14 13:41:00,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:00,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-04-14 13:41:00,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:41:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 0 proven. 3847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:41:02,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:41:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3847 backedges. 0 proven. 3847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:41:05,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591193660] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:41:05,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:41:05,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 172 [2025-04-14 13:41:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225488915] [2025-04-14 13:41:05,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:41:05,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 173 states [2025-04-14 13:41:05,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:41:05,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2025-04-14 13:41:05,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11860, Invalid=17896, Unknown=0, NotChecked=0, Total=29756 [2025-04-14 13:41:05,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:05,477 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:41:05,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 173 states, 173 states have (on average 2.098265895953757) internal successors, (363), 172 states have internal predecessors, (363), 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) [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 231 states. [2025-04-14 13:41:05,477 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2025-04-14 13:41:09,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-04-14 13:41:09,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 13:41:09,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2025-04-14 13:41:09,853 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:41:09,853 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:09,853 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #4 [2025-04-14 13:41:09,853 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:41:09,853 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:41:09,853 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:41:09,853 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:41:09,853 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:41:09,853 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:41:09,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956853, now seen corresponding path program 1 times [2025-04-14 13:41:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 13:41:09,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208894926] [2025-04-14 13:41:09,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:09,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:09,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 13:41:09,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 13:41:09,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:09,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:41:09,862 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 13:41:09,862 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 13:41:09,862 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:41:09,862 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:09,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2118994875, now seen corresponding path program 4 times [2025-04-14 13:41:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:09,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439023438] [2025-04-14 13:41:09,862 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 13:41:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:09,871 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 220 statements into 2 equivalence classes. [2025-04-14 13:41:10,052 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 219 of 220 statements. [2025-04-14 13:41:10,052 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 13:41:10,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:41:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10003 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10000 trivial. 0 not checked. [2025-04-14 13:41:13,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:41:13,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439023438] [2025-04-14 13:41:13,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439023438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:41:13,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:41:13,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 13:41:13,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799566235] [2025-04-14 13:41:13,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:41:13,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 13:41:13,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:41:13,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 13:41:13,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:41:13,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:13,283 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:41:13,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 231 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2025-04-14 13:41:13,283 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-04-14 13:41:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 13:41:13,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable17 [2025-04-14 13:41:13,402 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 13:41:13,402 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:41:13,403 INFO L139 ounterexampleChecker]: Examining path program with hash -1486533956, occurence #5 [2025-04-14 13:41:13,403 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:41:13,403 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 13:41:13,403 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:41:13,403 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 13:41:13,403 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:41:13,403 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 13:41:13,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:13,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1669956846, now seen corresponding path program 1 times [2025-04-14 13:41:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 13:41:13,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012923018] [2025-04-14 13:41:13,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:41:13,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:13,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 13:41:13,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 13:41:13,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:13,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:41:13,409 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 13:41:13,409 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 13:41:13,409 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:41:13,409 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:41:13,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:41:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1097176859, now seen corresponding path program 5 times [2025-04-14 13:41:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:41:13,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651234800] [2025-04-14 13:41:13,409 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 13:41:13,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:41:13,416 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 218 statements into 101 equivalence classes. [2025-04-14 13:41:13,473 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 101 check-sat command(s) and asserted 218 of 218 statements. [2025-04-14 13:41:13,473 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 101 check-sat command(s) [2025-04-14 13:41:13,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:41:13,474 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:41:13,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-04-14 13:41:13,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-04-14 13:41:13,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:41:13,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:41:13,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:41:13,623 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:41:13,624 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 13:41:13,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,SelfDestructingSolverStorable20 [2025-04-14 13:41:13,629 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 3, 2] [2025-04-14 13:41:13,630 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was UNSAFE (1/3) [2025-04-14 13:41:13,783 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 13:41:13,783 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 13:41:13,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 13:41:13,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:41:13 BasicIcfg [2025-04-14 13:41:13,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 13:41:13,796 INFO L158 Benchmark]: Toolchain (without parser) took 38165.43ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 885.0MB). Free memory was 105.8MB in the beginning and 507.7MB in the end (delta: -401.9MB). Peak memory consumption was 481.7MB. Max. memory is 8.0GB. [2025-04-14 13:41:13,796 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:41:13,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.80ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 82.4MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 13:41:13,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.79ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:41:13,797 INFO L158 Benchmark]: Boogie Preprocessor took 21.56ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 79.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:41:13,797 INFO L158 Benchmark]: RCFGBuilder took 318.93ms. Allocated memory is still 155.2MB. Free memory was 79.4MB in the beginning and 59.9MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 13:41:13,797 INFO L158 Benchmark]: TraceAbstraction took 37374.03ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 885.0MB). Free memory was 59.2MB in the beginning and 507.7MB in the end (delta: -448.6MB). Peak memory consumption was 435.6MB. Max. memory is 8.0GB. [2025-04-14 13:41:13,798 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.81ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 410.80ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 82.4MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.79ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.56ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 79.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 318.93ms. Allocated memory is still 155.2MB. Free memory was 79.4MB in the beginning and 59.9MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 37374.03ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 885.0MB). Free memory was 59.2MB in the beginning and 507.7MB in the end (delta: -448.6MB). Peak memory consumption was 435.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26371, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 3248, dependent conditional: 3240, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23168, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23168, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 291, dependent conditional: 283, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 0, independent unconditional: 23123, dependent: 291, dependent conditional: 237, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 0, independent unconditional: 23123, dependent: 291, dependent conditional: 237, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 371, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 371, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 255, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 208, dependent conditional: 124, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 7, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 23414, independent: 22790, independent conditional: 0, independent unconditional: 22790, dependent: 253, dependent conditional: 207, dependent unconditional: 46, unknown: 371, unknown conditional: 30, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 340, Positive conditional cache size: 7, Positive unconditional cache size: 333, Negative cache size: 38, Negative conditional cache size: 30, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22837, Maximal queried relation: 11, Independence queries for same thread: 3203, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 55, Number of trivial persistent sets: 39, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 0, independent unconditional: 332, 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: 26371, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 3248, dependent conditional: 3240, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23168, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23168, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 45, dependent conditional: 37, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 22791, independent unconditional: 332, dependent: 291, dependent conditional: 283, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 0, independent unconditional: 23123, dependent: 291, dependent conditional: 237, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23414, independent: 23123, independent conditional: 0, independent unconditional: 23123, dependent: 291, dependent conditional: 237, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 371, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 371, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 38, dependent conditional: 30, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 255, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 208, dependent conditional: 124, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 7, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 23414, independent: 22790, independent conditional: 0, independent unconditional: 22790, dependent: 253, dependent conditional: 207, dependent unconditional: 46, unknown: 371, unknown conditional: 30, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 340, Positive conditional cache size: 7, Positive unconditional cache size: 333, Negative cache size: 38, Negative conditional cache size: 30, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22837, Maximal queried relation: 11, Independence queries for same thread: 3203 - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 100 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=100, limit=0, t1=0] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=100, limit=0, t1=0, t2=1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L768] 2 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L759] 1 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L760] 1 bound = limit [L761] 1 i = 0 VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=100, limit=100] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L761] COND TRUE 1 i < bound [L761] 1 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=100, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L761] COND FALSE 1 !(i < bound) [L762] CALL 1 __VERIFIER_assert(i == lim) [L753] COND FALSE 1 !(!expression) VAL [\at(expression, Pre)=1, _N=100, expression=1, limit=100] [L762] RET 1 __VERIFIER_assert(i == lim) [L763] 1 return 0; [L780] FCALL, JOIN 1 pthread_join(t1, 0) VAL [_N=100, limit=100, t1=0, t2=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\at(expression, Pre)=0, _N=100, expression=0, limit=100] [L753] 2 reach_error() VAL [\at(expression, Pre)=0, _N=100, expression=0, limit=100] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: f2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 47 locations, 54 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 37.1s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 18.3s, 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: 531, 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.6s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 1398 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 260 NumberOfCheckSat, 1532 ConstructedInterpolants, 0 QuantifiedInterpolants, 7447 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1676 ConjunctsInSsa, 197 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 10608/25678 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 79, ConditionCalculationTime [ms]: 26, ConditionCalculations: 7, QuantifiedConditions: 0, TraceChecks: 7, UnknownTraceChecks: 0, UnsatisfiedConditions: 7, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 13:41:13,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...