./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 44c38e66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-100.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 20:45:28,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 20:45:28,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 20:45:28,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 20:45:28,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 20:45:28,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 20:45:28,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 20:45:28,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 20:45:28,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 20:45:28,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 20:45:28,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 20:45:28,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 20:45:28,311 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 20:45:28,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 20:45:28,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 20:45:28,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 20:45:28,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 20:45:28,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 20:45:28,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 20:45:28,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 20:45:28,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 20:45:28,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 20:45:28,312 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 20:45:28,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 20:45:28,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 20:45:28,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 20:45:28,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 20:45:28,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:45:28,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:45:28,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:45:28,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:45:28,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 20:45:28,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 20:45:28,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 20:45:28,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 20:45:28,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:45:28,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 20:45:28,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2025-04-24 20:45:28,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 20:45:28,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 20:45:28,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 20:45:28,546 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 20:45:28,546 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 20:45:28,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-04-24 20:45:29,815 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/eae25a348/33dfba2670584fd1afbcbde86a103401/FLAG2fb087dad [2025-04-24 20:45:30,077 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 20:45:30,077 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-04-24 20:45:30,092 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/eae25a348/33dfba2670584fd1afbcbde86a103401/FLAG2fb087dad [2025-04-24 20:45:30,865 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/eae25a348/33dfba2670584fd1afbcbde86a103401 [2025-04-24 20:45:30,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 20:45:30,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 20:45:30,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 20:45:30,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 20:45:30,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 20:45:30,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:45:30" (1/1) ... [2025-04-24 20:45:30,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713bf53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:30, skipping insertion in model container [2025-04-24 20:45:30,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 08:45:30" (1/1) ... [2025-04-24 20:45:30,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 20:45:31,098 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i[33026,33039] [2025-04-24 20:45:31,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:45:31,117 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 20:45:31,172 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i[33026,33039] [2025-04-24 20:45:31,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 20:45:31,203 INFO L204 MainTranslator]: Completed translation [2025-04-24 20:45:31,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31 WrapperNode [2025-04-24 20:45:31,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 20:45:31,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 20:45:31,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 20:45:31,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 20:45:31,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,236 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-04-24 20:45:31,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 20:45:31,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 20:45:31,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 20:45:31,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 20:45:31,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 20:45:31,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 20:45:31,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 20:45:31,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 20:45:31,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (1/1) ... [2025-04-24 20:45:31,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 20:45:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:45:31,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 20:45:31,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 20:45:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 20:45:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-24 20:45:31,306 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-24 20:45:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-24 20:45:31,306 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-24 20:45:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 20:45:31,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 20:45:31,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 20:45:31,308 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 20:45:31,412 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 20:45:31,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 20:45:31,528 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 20:45:31,529 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 20:45:31,607 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 20:45:31,608 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 20:45:31,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:45:31 BoogieIcfgContainer [2025-04-24 20:45:31,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 20:45:31,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 20:45:31,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 20:45:31,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 20:45:31,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 08:45:30" (1/3) ... [2025-04-24 20:45:31,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa29ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:45:31, skipping insertion in model container [2025-04-24 20:45:31,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 08:45:31" (2/3) ... [2025-04-24 20:45:31,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa29ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 08:45:31, skipping insertion in model container [2025-04-24 20:45:31,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:45:31" (3/3) ... [2025-04-24 20:45:31,616 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-04-24 20:45:31,625 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 20:45:31,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 22 locations, 22 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-24 20:45:31,627 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 20:45:31,662 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-24 20:45:31,692 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:45:31,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 20:45:31,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:45:31,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-24 20:45:31,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-24 20:45:31,748 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 20:45:31,760 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2025-04-24 20:45:31,765 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;@17f14a9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 20:45:31,766 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 20:45:31,914 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:45:31,914 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:45:31,915 INFO L139 ounterexampleChecker]: Examining path program with hash -1872483246, occurence #1 [2025-04-24 20:45:31,915 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:45:31,915 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:45:31,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:45:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash -600582735, now seen corresponding path program 1 times [2025-04-24 20:45:31,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:45:31,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674586318] [2025-04-24 20:45:31,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:45:31,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:45:31,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-24 20:45:32,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-24 20:45:32,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:45:32,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:32,213 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-24 20:45:32,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:45:32,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674586318] [2025-04-24 20:45:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674586318] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 20:45:32,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 20:45:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 20:45:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343659504] [2025-04-24 20:45:32,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 20:45:32,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 20:45:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:45:32,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 20:45:32,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 20:45:32,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:32,234 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:45:32,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-24 20:45:32,234 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:32,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:32,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 20:45:32,297 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:45:32,297 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:45:32,297 INFO L139 ounterexampleChecker]: Examining path program with hash -1872483246, occurence #2 [2025-04-24 20:45:32,297 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:45:32,297 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 20:45:32,317 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:45:32,317 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:45:32,317 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:45:32,317 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:45:32,317 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:45:32,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:45:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1438226240, now seen corresponding path program 1 times [2025-04-24 20:45:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:45:32,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739118674] [2025-04-24 20:45:32,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:45:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:45:32,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-24 20:45:32,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-24 20:45:32,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:45:32,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:45:32,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739118674] [2025-04-24 20:45:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739118674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:45:32,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607931836] [2025-04-24 20:45:32,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:45:32,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:45:32,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:45:32,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:45:32,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 20:45:32,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-24 20:45:32,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-24 20:45:32,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:45:32,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:32,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 20:45:32,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:45:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:32,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:45:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:32,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607931836] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:45:32,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:45:32,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-24 20:45:32,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13025001] [2025-04-24 20:45:32,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:45:32,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 20:45:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:45:32,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 20:45:32,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-24 20:45:32,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:32,628 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:45:32,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 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-24 20:45:32,628 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:32,628 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:32,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:32,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 20:45:32,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-24 20:45:32,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-24 20:45:32,945 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:45:32,945 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:45:32,945 INFO L139 ounterexampleChecker]: Examining path program with hash -1872483246, occurence #3 [2025-04-24 20:45:32,945 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:45:32,946 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 20:45:32,946 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:45:32,946 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:45:32,946 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:45:32,946 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:45:32,946 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:45:32,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:45:32,946 INFO L85 PathProgramCache]: Analyzing trace with hash 365404529, now seen corresponding path program 2 times [2025-04-24 20:45:32,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:45:32,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135804568] [2025-04-24 20:45:32,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:45:32,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:45:32,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-24 20:45:32,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-24 20:45:32,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:45:32,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:33,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:45:33,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135804568] [2025-04-24 20:45:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135804568] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:45:33,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332972996] [2025-04-24 20:45:33,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:45:33,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:45:33,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:45:33,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:45:33,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 20:45:33,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-24 20:45:33,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-24 20:45:33,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:45:33,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:33,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-24 20:45:33,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:45:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:33,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:45:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:33,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332972996] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:45:33,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:45:33,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-04-24 20:45:33,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842085366] [2025-04-24 20:45:33,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:45:33,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-24 20:45:33,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:45:33,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-24 20:45:33,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2025-04-24 20:45:33,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:33,353 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:45:33,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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-24 20:45:33,353 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:33,353 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 20:45:33,353 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:33,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:33,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 20:45:33,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:45:33,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-24 20:45:33,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:45:33,756 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:45:33,756 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:45:33,756 INFO L139 ounterexampleChecker]: Examining path program with hash -1872483246, occurence #4 [2025-04-24 20:45:33,756 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:45:33,756 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 20:45:33,756 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:45:33,756 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:45:33,756 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:45:33,756 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:45:33,756 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:45:33,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:45:33,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2136084241, now seen corresponding path program 3 times [2025-04-24 20:45:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:45:33,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986734137] [2025-04-24 20:45:33,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 20:45:33,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:45:33,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-04-24 20:45:33,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 24 statements. [2025-04-24 20:45:33,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-24 20:45:33,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-24 20:45:33,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:45:33,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986734137] [2025-04-24 20:45:33,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986734137] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:45:33,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100951128] [2025-04-24 20:45:33,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 20:45:33,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:45:33,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:45:33,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:45:33,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 20:45:33,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-04-24 20:45:33,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 24 statements. [2025-04-24 20:45:33,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-24 20:45:33,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:33,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-24 20:45:33,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:45:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-24 20:45:33,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:45:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-24 20:45:33,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100951128] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:45:33,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:45:33,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-04-24 20:45:33,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632074937] [2025-04-24 20:45:33,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:45:33,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 20:45:33,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:45:33,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 20:45:33,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-24 20:45:33,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:33,944 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:45:33,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-24 20:45:33,944 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:33,944 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 20:45:33,944 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:45:33,944 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:34,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:34,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:45:34,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:45:34,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:45:34,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-24 20:45:34,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:45:34,404 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:45:34,404 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:45:34,404 INFO L139 ounterexampleChecker]: Examining path program with hash -1670301423, occurence #1 [2025-04-24 20:45:34,404 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 20:45:34,404 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:45:34,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:45:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1938610929, now seen corresponding path program 1 times [2025-04-24 20:45:34,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:45:34,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491816582] [2025-04-24 20:45:34,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:45:34,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:45:34,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-24 20:45:34,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-24 20:45:34,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:45:34,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:45:34,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491816582] [2025-04-24 20:45:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491816582] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:45:34,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723986943] [2025-04-24 20:45:34,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 20:45:34,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:45:34,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:45:34,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:45:34,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-24 20:45:34,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-24 20:45:34,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-24 20:45:34,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:45:34,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:34,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-24 20:45:34,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:45:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:34,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:45:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723986943] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:45:35,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:45:35,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-04-24 20:45:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154305052] [2025-04-24 20:45:35,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:45:35,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-24 20:45:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:45:35,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-24 20:45:35,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2025-04-24 20:45:35,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:35,148 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:45:35,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 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-24 20:45:35,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:35,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:45:35,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:45:35,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:45:35,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:36,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:36,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:45:36,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:45:36,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:45:36,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-24 20:45:36,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-24 20:45:36,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:45:36,845 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:45:36,845 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:45:36,846 INFO L139 ounterexampleChecker]: Examining path program with hash -1670301423, occurence #2 [2025-04-24 20:45:36,846 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:45:36,846 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 20:45:36,846 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:45:36,846 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:45:36,846 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:45:36,846 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:45:36,846 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:45:36,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:45:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2092351025, now seen corresponding path program 2 times [2025-04-24 20:45:36,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:45:36,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776840904] [2025-04-24 20:45:36,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:45:36,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:45:36,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-24 20:45:36,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-24 20:45:36,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:45:36,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:37,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:45:37,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776840904] [2025-04-24 20:45:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776840904] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:45:37,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104595054] [2025-04-24 20:45:37,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 20:45:37,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:45:37,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:45:37,249 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:45:37,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-24 20:45:37,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-24 20:45:37,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-24 20:45:37,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 20:45:37,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:37,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-24 20:45:37,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:45:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:37,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:45:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:38,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104595054] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:45:38,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:45:38,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-04-24 20:45:38,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771556276] [2025-04-24 20:45:38,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:45:38,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-04-24 20:45:38,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:45:38,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-04-24 20:45:38,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=4259, Unknown=0, NotChecked=0, Total=5700 [2025-04-24 20:45:38,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:38,573 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:45:38,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 75 states have internal predecessors, (101), 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-24 20:45:38,573 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:38,573 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:45:38,574 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:45:38,574 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:45:38,574 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2025-04-24 20:45:38,574 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:42,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:42,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:45:42,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:45:42,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:45:42,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-24 20:45:42,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2025-04-24 20:45:42,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-24 20:45:42,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:45:42,781 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:45:42,781 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:45:42,781 INFO L139 ounterexampleChecker]: Examining path program with hash -1670301423, occurence #3 [2025-04-24 20:45:42,781 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:45:42,781 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 20:45:42,781 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:45:42,781 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:45:42,781 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:45:42,781 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:45:42,781 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:45:42,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:45:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash 510256305, now seen corresponding path program 3 times [2025-04-24 20:45:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:45:42,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012727358] [2025-04-24 20:45:42,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 20:45:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:45:42,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 24 equivalence classes. [2025-04-24 20:45:42,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 60 of 60 statements. [2025-04-24 20:45:42,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-04-24 20:45:42,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:43,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:45:43,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012727358] [2025-04-24 20:45:43,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012727358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:45:43,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423040903] [2025-04-24 20:45:43,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 20:45:43,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:45:43,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:45:43,854 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:45:43,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-24 20:45:43,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 24 equivalence classes. [2025-04-24 20:45:43,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 60 of 60 statements. [2025-04-24 20:45:43,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-04-24 20:45:43,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:45:43,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-24 20:45:43,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:45:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:45,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:45:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:45:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423040903] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:45:48,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:45:48,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-04-24 20:45:48,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228817161] [2025-04-24 20:45:48,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:45:48,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2025-04-24 20:45:48,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:45:48,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2025-04-24 20:45:48,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5749, Invalid=16007, Unknown=0, NotChecked=0, Total=21756 [2025-04-24 20:45:48,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:45:48,090 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:45:48,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 1.1689189189189189) internal successors, (173), 147 states have internal predecessors, (173), 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-24 20:45:48,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:45:48,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:45:48,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:45:48,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:45:48,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2025-04-24 20:45:48,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 166 states. [2025-04-24 20:45:48,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:46:01,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:46:01,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:46:01,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:46:01,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:46:01,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-24 20:46:01,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2025-04-24 20:46:01,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 334 states. [2025-04-24 20:46:01,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-24 20:46:02,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-24 20:46:02,152 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:46:02,152 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:46:02,153 INFO L139 ounterexampleChecker]: Examining path program with hash -1670301423, occurence #4 [2025-04-24 20:46:02,153 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:46:02,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 20:46:02,153 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:46:02,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:46:02,153 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:46:02,153 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:46:02,153 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:46:02,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:46:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1544401329, now seen corresponding path program 4 times [2025-04-24 20:46:02,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:46:02,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714258543] [2025-04-24 20:46:02,153 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 20:46:02,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:46:02,163 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 108 statements into 2 equivalence classes. [2025-04-24 20:46:02,193 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 108 of 108 statements. [2025-04-24 20:46:02,194 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 20:46:02,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:46:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:46:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 20:46:05,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714258543] [2025-04-24 20:46:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714258543] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 20:46:05,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924845467] [2025-04-24 20:46:05,810 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 20:46:05,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:46:05,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 20:46:05,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 20:46:05,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-24 20:46:05,848 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 108 statements into 2 equivalence classes. [2025-04-24 20:46:05,878 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 108 of 108 statements. [2025-04-24 20:46:05,878 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 20:46:05,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 20:46:05,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-04-24 20:46:05,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 20:46:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:46:11,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 20:46:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 20:46:19,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924845467] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 20:46:19,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 20:46:19,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 291 [2025-04-24 20:46:19,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419050250] [2025-04-24 20:46:19,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 20:46:19,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 292 states [2025-04-24 20:46:19,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 20:46:19,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 292 interpolants. [2025-04-24 20:46:19,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19087, Invalid=65885, Unknown=0, NotChecked=0, Total=84972 [2025-04-24 20:46:19,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:46:19,578 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 20:46:19,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 292 states, 292 states have (on average 1.0856164383561644) internal successors, (317), 291 states have internal predecessors, (317), 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-24 20:46:19,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:46:19,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:46:19,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:46:19,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:46:19,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2025-04-24 20:46:19,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 166 states. [2025-04-24 20:46:19,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 334 states. [2025-04-24 20:46:19,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 20:47:02,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 20:47:02,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 20:47:02,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-24 20:47:02,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 20:47:02,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-24 20:47:02,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2025-04-24 20:47:02,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 334 states. [2025-04-24 20:47:02,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 581 states. [2025-04-24 20:47:02,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-24 20:47:03,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 20:47:03,099 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 20:47:03,099 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 20:47:03,099 INFO L139 ounterexampleChecker]: Examining path program with hash -1670301423, occurence #5 [2025-04-24 20:47:03,099 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 20:47:03,099 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 20:47:03,099 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:47:03,099 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 20:47:03,099 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 20:47:03,100 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 20:47:03,100 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 20:47:03,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 20:47:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1258126560, now seen corresponding path program 5 times [2025-04-24 20:47:03,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 20:47:03,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655799285] [2025-04-24 20:47:03,100 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-24 20:47:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 20:47:03,106 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 115 statements into 52 equivalence classes. [2025-04-24 20:47:03,158 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) and asserted 115 of 115 statements. [2025-04-24 20:47:03,158 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2025-04-24 20:47:03,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 20:47:03,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 20:47:03,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-04-24 20:47:03,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-04-24 20:47:03,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 20:47:03,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 20:47:03,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 20:47:03,245 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 20:47:03,246 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 20:47:03,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-24 20:47:03,251 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1] [2025-04-24 20:47:03,252 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was UNSAFE (1/2) [2025-04-24 20:47:03,366 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-24 20:47:03,371 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-24 20:47:03,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-24 20:47:03,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.04 08:47:03 BasicIcfg [2025-04-24 20:47:03,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-24 20:47:03,381 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-24 20:47:03,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-24 20:47:03,381 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-24 20:47:03,382 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 08:45:31" (3/4) ... [2025-04-24 20:47:03,382 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-24 20:47:03,464 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 109. [2025-04-24 20:47:03,537 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-24 20:47:03,539 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-24 20:47:03,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-24 20:47:03,539 INFO L158 Benchmark]: Toolchain (without parser) took 92670.97ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 112.2MB in the beginning and 278.1MB in the end (delta: -165.9MB). Peak memory consumption was 342.4MB. Max. memory is 16.1GB. [2025-04-24 20:47:03,540 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:47:03,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.99ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 90.1MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-24 20:47:03,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.23ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:47:03,540 INFO L158 Benchmark]: Boogie Preprocessor took 26.01ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 87.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 20:47:03,540 INFO L158 Benchmark]: RCFGBuilder took 344.32ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 68.0MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 20:47:03,540 INFO L158 Benchmark]: TraceAbstraction took 91771.35ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 67.6MB in the beginning and 301.5MB in the end (delta: -233.9MB). Peak memory consumption was 283.7MB. Max. memory is 16.1GB. [2025-04-24 20:47:03,541 INFO L158 Benchmark]: Witness Printer took 157.50ms. Allocated memory is still 654.3MB. Free memory was 301.5MB in the beginning and 278.1MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 20:47:03,544 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.18ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.99ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 90.1MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.23ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.01ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 87.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.32ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 68.0MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 91771.35ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 67.6MB in the beginning and 301.5MB in the end (delta: -233.9MB). Peak memory consumption was 283.7MB. Max. memory is 16.1GB. * Witness Printer took 157.50ms. Allocated memory is still 654.3MB. Free memory was 301.5MB in the beginning and 278.1MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5668, independent: 4285, independent conditional: 4111, independent unconditional: 174, dependent: 1383, dependent conditional: 1377, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4296, independent: 4285, independent conditional: 4111, independent unconditional: 174, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4296, independent: 4285, independent conditional: 4111, independent unconditional: 174, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4326, independent: 4285, independent conditional: 4111, independent unconditional: 174, dependent: 41, dependent conditional: 35, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4326, independent: 4285, independent conditional: 0, independent unconditional: 4285, dependent: 41, dependent conditional: 30, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4326, independent: 4285, independent conditional: 0, independent unconditional: 4285, dependent: 41, dependent conditional: 30, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 189, independent: 175, independent conditional: 0, independent unconditional: 175, dependent: 14, dependent conditional: 8, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 189, independent: 173, independent conditional: 0, independent unconditional: 173, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 14, dependent conditional: 8, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 14, dependent conditional: 8, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 174, dependent conditional: 69, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4326, independent: 4110, independent conditional: 0, independent unconditional: 4110, dependent: 27, dependent conditional: 22, dependent unconditional: 5, unknown: 189, unknown conditional: 8, unknown unconditional: 181] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4116, Maximal queried relation: 8, Independence queries for same thread: 1372, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 29, Number of trivial persistent sets: 26, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5668, independent: 4285, independent conditional: 4111, independent unconditional: 174, dependent: 1383, dependent conditional: 1377, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4296, independent: 4285, independent conditional: 4111, independent unconditional: 174, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4296, independent: 4285, independent conditional: 4111, independent unconditional: 174, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4326, independent: 4285, independent conditional: 4111, independent unconditional: 174, dependent: 41, dependent conditional: 35, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4326, independent: 4285, independent conditional: 0, independent unconditional: 4285, dependent: 41, dependent conditional: 30, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4326, independent: 4285, independent conditional: 0, independent unconditional: 4285, dependent: 41, dependent conditional: 30, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 189, independent: 175, independent conditional: 0, independent unconditional: 175, dependent: 14, dependent conditional: 8, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 189, independent: 173, independent conditional: 0, independent unconditional: 173, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 14, dependent conditional: 8, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 14, dependent conditional: 8, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 174, dependent conditional: 69, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4326, independent: 4110, independent conditional: 0, independent unconditional: 4110, dependent: 27, dependent conditional: 22, dependent unconditional: 5, unknown: 189, unknown conditional: 8, unknown unconditional: 181] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4116, Maximal queried relation: 8, Independence queries for same thread: 1372 - 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; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\at(arg, Pre)={0:0}, _N=100, limit=0, t1=0] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L760] 1 limit = _N + 1 VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, limit=101] [L762] 1 return 0; [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, limit=101, t1=0, t2=1] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L777] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, limit=101, t1=0, t2=1] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression VAL [\at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, _N=100, arg={0:0}, expression=0, limit=101] [L753] 2 reach_error() VAL [\at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, _N=100, arg={0:0}, expression=0, limit=101] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: f2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 37 locations, 42 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 91.5s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 63.5s, 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: 1213, 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.3s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 699 NumberOfCodeBlocks, 683 NumberOfCodeBlocksAsserted, 121 NumberOfCheckSat, 847 ConstructedInterpolants, 0 QuantifiedInterpolants, 4045 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1143 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 135/17760 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]: 20, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-24 20:47:03,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE