./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/szymanski.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-atomic/szymanski.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 a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 18:36:48,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 18:36:48,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 18:36:48,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 18:36:48,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 18:36:48,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 18:36:48,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 18:36:48,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 18:36:48,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 18:36:48,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 18:36:48,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 18:36:48,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 18:36:48,397 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 18:36:48,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 18:36:48,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 18:36:48,397 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 18:36:48,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 18:36:48,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 18:36:48,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 18:36:48,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 18:36:48,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 18:36:48,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 18:36:48,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 18:36:48,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 18:36:48,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 18:36:48,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 18:36:48,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 18:36:48,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 18:36:48,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 18:36:48,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 18:36:48,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:36:48,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 18:36:48,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 18:36:48,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 18:36:48,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 18:36:48,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:36:48,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 18:36:48,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 18:36:48,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 18:36:48,399 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 18:36:48,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 18:36:48,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 18:36:48,400 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 18:36:48,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 18:36:48,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 18:36:48,400 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 18:36:48,400 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 18:36:48,400 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 -> a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 [2025-04-24 18:36:48,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 18:36:48,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 18:36:48,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 18:36:48,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 18:36:48,632 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 18:36:48,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-atomic/szymanski.i [2025-04-24 18:36:49,927 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/69e5fe8f6/6e80280d794b42418227b560d3fc1f79/FLAG787694f2c [2025-04-24 18:36:50,217 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 18:36:50,218 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/szymanski.i [2025-04-24 18:36:50,233 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/69e5fe8f6/6e80280d794b42418227b560d3fc1f79/FLAG787694f2c [2025-04-24 18:36:50,977 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/69e5fe8f6/6e80280d794b42418227b560d3fc1f79 [2025-04-24 18:36:50,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 18:36:50,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 18:36:50,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 18:36:50,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 18:36:50,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 18:36:50,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 06:36:50" (1/1) ... [2025-04-24 18:36:50,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41958138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:50, skipping insertion in model container [2025-04-24 18:36:50,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 06:36:50" (1/1) ... [2025-04-24 18:36:51,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 18:36:51,212 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-atomic/szymanski.i[32419,32432] [2025-04-24 18:36:51,217 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-atomic/szymanski.i[32696,32709] [2025-04-24 18:36:51,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 18:36:51,230 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 18:36:51,272 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-atomic/szymanski.i[32419,32432] [2025-04-24 18:36:51,273 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-atomic/szymanski.i[32696,32709] [2025-04-24 18:36:51,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 18:36:51,295 INFO L204 MainTranslator]: Completed translation [2025-04-24 18:36:51,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51 WrapperNode [2025-04-24 18:36:51,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 18:36:51,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 18:36:51,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 18:36:51,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 18:36:51,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,323 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2025-04-24 18:36:51,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 18:36:51,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 18:36:51,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 18:36:51,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 18:36:51,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,333 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 18:36:51,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 18:36:51,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 18:36:51,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 18:36:51,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (1/1) ... [2025-04-24 18:36:51,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:36:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:36:51,368 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 18:36:51,374 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 18:36:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-24 18:36:51,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-24 18:36:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-24 18:36:51,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-24 18:36:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 18:36:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 18:36:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 18:36:51,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 18:36:51,389 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 18:36:51,477 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 18:36:51,478 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 18:36:51,572 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 18:36:51,573 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 18:36:51,600 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 18:36:51,601 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 18:36:51,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:36:51 BoogieIcfgContainer [2025-04-24 18:36:51,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 18:36:51,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 18:36:51,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 18:36:51,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 18:36:51,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 06:36:50" (1/3) ... [2025-04-24 18:36:51,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12084f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 06:36:51, skipping insertion in model container [2025-04-24 18:36:51,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:51" (2/3) ... [2025-04-24 18:36:51,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12084f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 06:36:51, skipping insertion in model container [2025-04-24 18:36:51,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:36:51" (3/3) ... [2025-04-24 18:36:51,610 INFO L128 eAbstractionObserver]: Analyzing ICFG szymanski.i [2025-04-24 18:36:51,620 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 18:36:51,622 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG szymanski.i that has 3 procedures, 41 locations, 50 edges, 1 initial locations, 8 loop locations, and 2 error locations. [2025-04-24 18:36:51,622 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 18:36:51,668 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-24 18:36:51,707 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:36:51,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 18:36:51,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:36:51,711 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 18:36:51,713 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 18:36:51,770 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:36:51,781 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork1 ======== [2025-04-24 18:36:51,787 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;@1f661409, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:36:51,788 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:36:52,157 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:52,157 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:52,157 INFO L139 ounterexampleChecker]: Examining path program with hash -1228402867, occurence #1 [2025-04-24 18:36:52,157 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:52,157 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:52,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:52,161 INFO L85 PathProgramCache]: Analyzing trace with hash -99625942, now seen corresponding path program 1 times [2025-04-24 18:36:52,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:52,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854206123] [2025-04-24 18:36:52,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:52,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:52,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-24 18:36:52,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 18:36:52,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:52,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:52,309 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 18:36:52,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:52,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854206123] [2025-04-24 18:36:52,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854206123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:52,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:52,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160790165] [2025-04-24 18:36:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:52,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:52,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:52,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:52,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:52,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:52,330 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:52,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:36:52,331 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:52,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 18:36:52,425 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:52,425 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:52,425 INFO L139 ounterexampleChecker]: Examining path program with hash -799320947, occurence #1 [2025-04-24 18:36:52,425 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:52,425 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:52,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:52,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1170320848, now seen corresponding path program 1 times [2025-04-24 18:36:52,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:52,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373231153] [2025-04-24 18:36:52,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:52,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 18:36:52,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 18:36:52,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:52,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:52,491 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 18:36:52,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:52,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373231153] [2025-04-24 18:36:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373231153] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:52,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:52,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:52,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226422451] [2025-04-24 18:36:52,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:52,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:52,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:52,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:52,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:52,496 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:52,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 18:36:52,496 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,496 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:52,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 18:36:52,569 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:52,569 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:52,570 INFO L139 ounterexampleChecker]: Examining path program with hash -1858743370, occurence #1 [2025-04-24 18:36:52,570 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:52,570 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:52,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash 840442963, now seen corresponding path program 1 times [2025-04-24 18:36:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:52,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767028201] [2025-04-24 18:36:52,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:52,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-24 18:36:52,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 18:36:52,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:52,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:52,624 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 18:36:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:52,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767028201] [2025-04-24 18:36:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767028201] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:52,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849064689] [2025-04-24 18:36:52,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:52,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:52,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:52,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:52,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:52,626 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:52,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:36:52,626 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,626 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,626 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:52,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-24 18:36:52,698 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:52,698 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:52,698 INFO L139 ounterexampleChecker]: Examining path program with hash 1282681082, occurence #1 [2025-04-24 18:36:52,698 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:52,698 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:52,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1233040161, now seen corresponding path program 1 times [2025-04-24 18:36:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:52,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548028722] [2025-04-24 18:36:52,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:52,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 18:36:52,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 18:36:52,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:52,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:52,742 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 18:36:52,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:52,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548028722] [2025-04-24 18:36:52,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548028722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:52,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:52,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:52,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427856888] [2025-04-24 18:36:52,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:52,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:52,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:52,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:52,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:52,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:52,743 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:52,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 18:36:52,743 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,743 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,743 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,744 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:52,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-24 18:36:52,853 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:52,853 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:52,854 INFO L139 ounterexampleChecker]: Examining path program with hash 833394274, occurence #1 [2025-04-24 18:36:52,854 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:52,854 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:52,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1434156940, now seen corresponding path program 1 times [2025-04-24 18:36:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:52,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29701922] [2025-04-24 18:36:52,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:52,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 18:36:52,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 18:36:52,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:52,888 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 18:36:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:52,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29701922] [2025-04-24 18:36:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29701922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:52,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743738879] [2025-04-24 18:36:52,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:52,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:52,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:52,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:52,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:52,889 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:52,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:36:52,889 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,889 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,889 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,889 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,889 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:52,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:52,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-24 18:36:52,967 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:52,967 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:52,967 INFO L139 ounterexampleChecker]: Examining path program with hash -1849112779, occurence #1 [2025-04-24 18:36:52,967 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:52,967 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:52,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 720290636, now seen corresponding path program 1 times [2025-04-24 18:36:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:52,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614894560] [2025-04-24 18:36:52,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:52,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 18:36:52,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 18:36:52,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:52,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:53,000 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 18:36:53,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:53,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614894560] [2025-04-24 18:36:53,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614894560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:53,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:53,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707393966] [2025-04-24 18:36:53,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:53,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:53,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:53,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:53,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,002 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:53,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 18:36:53,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-24 18:36:53,089 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:53,089 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:53,090 INFO L139 ounterexampleChecker]: Examining path program with hash -168259075, occurence #1 [2025-04-24 18:36:53,090 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:53,090 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:53,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:53,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2106302563, now seen corresponding path program 1 times [2025-04-24 18:36:53,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:53,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197999916] [2025-04-24 18:36:53,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:53,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:53,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-24 18:36:53,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-24 18:36:53,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:53,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:53,128 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 18:36:53,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:53,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197999916] [2025-04-24 18:36:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197999916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:53,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250975531] [2025-04-24 18:36:53,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:53,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:53,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:53,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:53,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:53,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,129 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:53,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 18:36:53,130 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,130 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,130 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,130 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,130 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,130 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,130 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-24 18:36:53,224 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:53,224 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:53,224 INFO L139 ounterexampleChecker]: Examining path program with hash 831335315, occurence #1 [2025-04-24 18:36:53,224 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:53,224 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:53,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash -755987768, now seen corresponding path program 1 times [2025-04-24 18:36:53,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:53,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594002244] [2025-04-24 18:36:53,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:53,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:53,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-24 18:36:53,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-24 18:36:53,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:53,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:53,242 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 18:36:53,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:53,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594002244] [2025-04-24 18:36:53,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594002244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:53,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:53,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:53,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467376095] [2025-04-24 18:36:53,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:53,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:53,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:53,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:53,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:53,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,244 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:53,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 18:36:53,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-24 18:36:53,363 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:53,363 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:53,363 INFO L139 ounterexampleChecker]: Examining path program with hash -447997429, occurence #1 [2025-04-24 18:36:53,363 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:53,363 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:53,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash -957293853, now seen corresponding path program 1 times [2025-04-24 18:36:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:53,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857431849] [2025-04-24 18:36:53,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:53,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-24 18:36:53,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-24 18:36:53,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:53,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:53,388 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 18:36:53,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:53,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857431849] [2025-04-24 18:36:53,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857431849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:53,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:53,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:53,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017303547] [2025-04-24 18:36:53,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:53,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:53,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:53,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:53,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:53,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,390 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:53,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18:36:53,390 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,390 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,390 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,390 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,390 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,390 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,390 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,390 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,390 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,654 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:36:53,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-24 18:36:53,662 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-24 18:36:53,663 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork1 was SAFE (1/3) [2025-04-24 18:36:53,666 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:36:53,666 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:36:53,666 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 18:36:53,667 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;@1f661409, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:36:53,667 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 18:36:53,672 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 18:36:53,673 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-24 18:36:53,674 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:36:53,674 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2025-04-24 18:36:53,675 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:36:53,676 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:36:53,676 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr2Thread1of1ForFork0 ======== [2025-04-24 18:36:53,676 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;@1f661409, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:36:53,676 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:36:53,686 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:53,686 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:53,686 INFO L139 ounterexampleChecker]: Examining path program with hash 1780488305, occurence #1 [2025-04-24 18:36:53,686 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:53,686 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:53,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1320449317, now seen corresponding path program 1 times [2025-04-24 18:36:53,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:53,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651281385] [2025-04-24 18:36:53,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:53,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:53,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 18:36:53,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 18:36:53,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:53,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:53,716 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 18:36:53,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:53,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651281385] [2025-04-24 18:36:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651281385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:53,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:53,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:53,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672260915] [2025-04-24 18:36:53,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:53,718 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:53,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:53,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:53,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:53,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,719 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:53,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:36:53,719 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-24 18:36:53,742 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:53,742 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:53,742 INFO L139 ounterexampleChecker]: Examining path program with hash 1628134365, occurence #1 [2025-04-24 18:36:53,742 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:53,742 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:53,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:53,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1515911638, now seen corresponding path program 1 times [2025-04-24 18:36:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:53,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327942331] [2025-04-24 18:36:53,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:53,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-24 18:36:53,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-24 18:36:53,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:53,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:53,764 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 18:36:53,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:53,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327942331] [2025-04-24 18:36:53,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327942331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:53,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:53,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:53,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461676790] [2025-04-24 18:36:53,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:53,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:53,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:53,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:53,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,766 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:53,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 18:36:53,766 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,766 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-24 18:36:53,791 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:53,791 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:53,791 INFO L139 ounterexampleChecker]: Examining path program with hash -1976929014, occurence #1 [2025-04-24 18:36:53,791 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:53,791 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:53,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1919530882, now seen corresponding path program 1 times [2025-04-24 18:36:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:53,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292102984] [2025-04-24 18:36:53,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:53,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-24 18:36:53,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-24 18:36:53,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:53,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:53,818 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 18:36:53,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:53,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292102984] [2025-04-24 18:36:53,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292102984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:53,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427957780] [2025-04-24 18:36:53,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:53,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:53,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:53,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:53,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,819 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:53,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 18:36:53,819 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,819 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,819 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-24 18:36:53,882 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:53,882 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:53,882 INFO L139 ounterexampleChecker]: Examining path program with hash 206911995, occurence #1 [2025-04-24 18:36:53,882 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:53,882 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:53,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:53,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1676526674, now seen corresponding path program 1 times [2025-04-24 18:36:53,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:53,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411569796] [2025-04-24 18:36:53,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:53,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:53,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-24 18:36:53,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 18:36:53,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:53,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:53,915 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 18:36:53,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:53,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411569796] [2025-04-24 18:36:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411569796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:53,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:53,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128285915] [2025-04-24 18:36:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:53,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:53,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:53,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:53,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,918 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:53,918 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 18:36:53,918 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,918 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,918 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,918 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:53,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:53,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-24 18:36:53,974 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:53,974 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:53,974 INFO L139 ounterexampleChecker]: Examining path program with hash 1774207925, occurence #1 [2025-04-24 18:36:53,974 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:53,974 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:53,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:53,974 INFO L85 PathProgramCache]: Analyzing trace with hash 11454073, now seen corresponding path program 1 times [2025-04-24 18:36:53,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:53,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535728569] [2025-04-24 18:36:53,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:53,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:53,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-24 18:36:53,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-24 18:36:53,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:53,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:53,999 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 18:36:54,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:54,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535728569] [2025-04-24 18:36:54,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535728569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:54,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:54,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:54,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046852565] [2025-04-24 18:36:54,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:54,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:54,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:54,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:54,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:54,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:54,001 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:54,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 18:36:54,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:54,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-24 18:36:54,042 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:54,042 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:54,042 INFO L139 ounterexampleChecker]: Examining path program with hash 1695928064, occurence #1 [2025-04-24 18:36:54,043 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:54,043 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:54,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash -929816415, now seen corresponding path program 1 times [2025-04-24 18:36:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:54,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122969382] [2025-04-24 18:36:54,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:54,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-24 18:36:54,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 18:36:54,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:54,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:54,072 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 18:36:54,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:54,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122969382] [2025-04-24 18:36:54,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122969382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:54,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:54,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:54,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129161647] [2025-04-24 18:36:54,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:54,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:54,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:54,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:54,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:54,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:54,074 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:54,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:36:54,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:54,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-24 18:36:54,120 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:54,120 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:54,120 INFO L139 ounterexampleChecker]: Examining path program with hash -296816562, occurence #1 [2025-04-24 18:36:54,120 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:54,120 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:54,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1198500778, now seen corresponding path program 1 times [2025-04-24 18:36:54,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:54,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570007440] [2025-04-24 18:36:54,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:54,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:54,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-24 18:36:54,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-24 18:36:54,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:54,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:54,150 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 18:36:54,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:54,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570007440] [2025-04-24 18:36:54,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570007440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:54,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:54,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:54,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339737030] [2025-04-24 18:36:54,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:54,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:54,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:54,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:54,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:54,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:54,152 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:54,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 18:36:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:54,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-24 18:36:54,196 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:54,196 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:54,196 INFO L139 ounterexampleChecker]: Examining path program with hash -1350429293, occurence #1 [2025-04-24 18:36:54,196 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:54,196 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:54,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:54,197 INFO L85 PathProgramCache]: Analyzing trace with hash 441934503, now seen corresponding path program 1 times [2025-04-24 18:36:54,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:54,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320111366] [2025-04-24 18:36:54,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:54,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:54,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-24 18:36:54,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-24 18:36:54,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:54,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:54,217 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 18:36:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:54,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320111366] [2025-04-24 18:36:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320111366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:54,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:54,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434016761] [2025-04-24 18:36:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:54,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:54,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:54,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:54,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:54,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:54,220 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:54,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 18:36:54,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:54,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-24 18:36:54,320 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:36:54,320 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:54,320 INFO L139 ounterexampleChecker]: Examining path program with hash -285017251, occurence #1 [2025-04-24 18:36:54,320 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:54,320 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:54,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2059449390, now seen corresponding path program 1 times [2025-04-24 18:36:54,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:54,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347892376] [2025-04-24 18:36:54,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:54,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:54,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-24 18:36:54,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 18:36:54,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:54,350 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 18:36:54,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:54,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347892376] [2025-04-24 18:36:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347892376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:54,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:36:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138281394] [2025-04-24 18:36:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:54,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:36:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:54,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:36:54,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:36:54,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:54,352 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:54,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:36:54,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,353 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,353 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,353 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,353 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,353 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:54,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:36:54,470 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:36:54,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-24 18:36:54,473 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-24 18:36:54,473 INFO L320 ceAbstractionStarter]: Result for error location thr2Thread1of1ForFork0 was SAFE (3/3) [2025-04-24 18:36:54,473 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-24 18:36:54,474 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-24 18:36:54,482 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 18:36:54,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.04 06:36:54 BasicIcfg [2025-04-24 18:36:54,483 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-24 18:36:54,483 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-24 18:36:54,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-24 18:36:54,484 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-24 18:36:54,484 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:36:51" (3/4) ... [2025-04-24 18:36:54,485 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-24 18:36:54,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-04-24 18:36:54,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-04-24 18:36:54,491 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-04-24 18:36:54,491 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-04-24 18:36:54,491 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-24 18:36:54,491 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-24 18:36:54,548 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-24 18:36:54,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-24 18:36:54,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-24 18:36:54,550 INFO L158 Benchmark]: Toolchain (without parser) took 3569.13ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 110.5MB in the beginning and 247.3MB in the end (delta: -136.8MB). Peak memory consumption was 146.1MB. Max. memory is 16.1GB. [2025-04-24 18:36:54,550 INFO L158 Benchmark]: CDTParser took 0.23ms. 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 18:36:54,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.74ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 88.3MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-24 18:36:54,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.51ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 86.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 18:36:54,551 INFO L158 Benchmark]: Boogie Preprocessor took 16.12ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 85.5MB in the end (delta: 887.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 18:36:54,551 INFO L158 Benchmark]: RCFGBuilder took 262.64ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 69.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 18:36:54,552 INFO L158 Benchmark]: TraceAbstraction took 2879.34ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 68.9MB in the beginning and 252.5MB in the end (delta: -183.6MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. [2025-04-24 18:36:54,552 INFO L158 Benchmark]: Witness Printer took 65.50ms. Allocated memory is still 427.8MB. Free memory was 252.5MB in the beginning and 247.3MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 18:36:54,553 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.74ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 88.3MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.51ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 86.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.12ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 85.5MB in the end (delta: 887.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 262.64ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 69.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2879.34ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 68.9MB in the beginning and 252.5MB in the end (delta: -183.6MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. * Witness Printer took 65.50ms. Allocated memory is still 427.8MB. Free memory was 252.5MB in the beginning and 247.3MB in the end (delta: 5.2MB). There was no memory consumed. 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: 3712, independent: 2906, independent conditional: 2006, independent unconditional: 900, dependent: 806, dependent conditional: 717, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3145, independent: 2906, independent conditional: 2006, independent unconditional: 900, dependent: 239, dependent conditional: 150, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3145, independent: 2906, independent conditional: 2006, independent unconditional: 900, dependent: 239, dependent conditional: 150, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3534, independent: 2906, independent conditional: 2006, independent unconditional: 900, dependent: 628, dependent conditional: 539, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3534, independent: 2906, independent conditional: 50, independent unconditional: 2856, dependent: 628, dependent conditional: 80, dependent unconditional: 548, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3534, independent: 2906, independent conditional: 50, independent unconditional: 2856, dependent: 628, dependent conditional: 80, dependent unconditional: 548, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1048, independent: 934, independent conditional: 11, independent unconditional: 923, dependent: 114, dependent conditional: 25, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1048, independent: 854, independent conditional: 0, independent unconditional: 854, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 194, independent: 80, independent conditional: 11, independent unconditional: 69, dependent: 114, dependent conditional: 25, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 194, independent: 80, independent conditional: 11, independent unconditional: 69, dependent: 114, dependent conditional: 25, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 753, independent: 317, independent conditional: 49, independent unconditional: 268, dependent: 436, dependent conditional: 82, dependent unconditional: 354, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 3534, independent: 1972, independent conditional: 39, independent unconditional: 1933, dependent: 514, dependent conditional: 55, dependent unconditional: 459, unknown: 1048, unknown conditional: 36, unknown unconditional: 1012] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 934, Positive conditional cache size: 11, Positive unconditional cache size: 923, Negative cache size: 114, Negative conditional cache size: 25, Negative unconditional cache size: 89, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2415, Maximal queried relation: 4, Independence queries for same thread: 567, Persistent sets #1 benchmarks: Persistent set computation time: 0.6s, Number of persistent set computation: 312, Number of trivial persistent sets: 292, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 989, independent: 900, independent conditional: 0, independent unconditional: 900, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3712, independent: 2906, independent conditional: 2006, independent unconditional: 900, dependent: 806, dependent conditional: 717, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3145, independent: 2906, independent conditional: 2006, independent unconditional: 900, dependent: 239, dependent conditional: 150, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3145, independent: 2906, independent conditional: 2006, independent unconditional: 900, dependent: 239, dependent conditional: 150, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3534, independent: 2906, independent conditional: 2006, independent unconditional: 900, dependent: 628, dependent conditional: 539, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3534, independent: 2906, independent conditional: 50, independent unconditional: 2856, dependent: 628, dependent conditional: 80, dependent unconditional: 548, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3534, independent: 2906, independent conditional: 50, independent unconditional: 2856, dependent: 628, dependent conditional: 80, dependent unconditional: 548, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1048, independent: 934, independent conditional: 11, independent unconditional: 923, dependent: 114, dependent conditional: 25, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1048, independent: 854, independent conditional: 0, independent unconditional: 854, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 194, independent: 80, independent conditional: 11, independent unconditional: 69, dependent: 114, dependent conditional: 25, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 194, independent: 80, independent conditional: 11, independent unconditional: 69, dependent: 114, dependent conditional: 25, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 753, independent: 317, independent conditional: 49, independent unconditional: 268, dependent: 436, dependent conditional: 82, dependent unconditional: 354, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 3534, independent: 1972, independent conditional: 39, independent unconditional: 1933, dependent: 514, dependent conditional: 55, dependent unconditional: 459, unknown: 1048, unknown conditional: 36, unknown unconditional: 1012] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 934, Positive conditional cache size: 11, Positive unconditional cache size: 923, Negative cache size: 114, Negative conditional cache size: 25, Negative unconditional cache size: 89, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2415, Maximal queried relation: 4, Independence queries for same thread: 567 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 198, independent: 192, independent conditional: 6, independent unconditional: 186, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 192, independent conditional: 6, independent unconditional: 186, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 192, independent conditional: 6, independent unconditional: 186, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 192, independent conditional: 6, independent unconditional: 186, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 196, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1015, Positive cache size: 926, Positive conditional cache size: 0, Positive unconditional cache size: 926, Negative cache size: 89, Negative conditional cache size: 0, Negative unconditional cache size: 89, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0, Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 8, Number of trivial persistent sets: 6, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 190, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 198, independent: 192, independent conditional: 6, independent unconditional: 186, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 192, independent conditional: 6, independent unconditional: 186, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 192, independent conditional: 6, independent unconditional: 186, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 192, independent conditional: 6, independent unconditional: 186, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 196, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1015, Positive cache size: 926, Positive conditional cache size: 0, Positive unconditional cache size: 926, Negative cache size: 89, Negative conditional cache size: 0, Negative unconditional cache size: 89, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0, Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3718, independent: 2887, independent conditional: 2051, independent unconditional: 836, dependent: 831, dependent conditional: 742, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3129, independent: 2887, independent conditional: 2051, independent unconditional: 836, dependent: 242, dependent conditional: 153, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3129, independent: 2887, independent conditional: 2051, independent unconditional: 836, dependent: 242, dependent conditional: 153, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3458, independent: 2887, independent conditional: 2051, independent unconditional: 836, dependent: 571, dependent conditional: 482, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3458, independent: 2887, independent conditional: 49, independent unconditional: 2838, dependent: 571, dependent conditional: 85, dependent unconditional: 486, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3458, independent: 2887, independent conditional: 49, independent unconditional: 2838, dependent: 571, dependent conditional: 85, dependent unconditional: 486, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 160, independent: 131, independent conditional: 10, independent unconditional: 121, dependent: 29, dependent conditional: 24, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 160, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 29, dependent conditional: 24, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 29, dependent conditional: 24, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, independent: 53, independent conditional: 41, independent unconditional: 12, dependent: 68, dependent conditional: 48, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 3458, independent: 2756, independent conditional: 39, independent unconditional: 2717, dependent: 542, dependent conditional: 61, dependent unconditional: 481, unknown: 160, unknown conditional: 34, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 1175, Positive cache size: 1057, Positive conditional cache size: 10, Positive unconditional cache size: 1047, Negative cache size: 118, Negative conditional cache size: 24, Negative unconditional cache size: 94, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2399, Maximal queried relation: 4, Independence queries for same thread: 589, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 304, Number of trivial persistent sets: 282, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 925, independent: 836, independent conditional: 0, independent unconditional: 836, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3718, independent: 2887, independent conditional: 2051, independent unconditional: 836, dependent: 831, dependent conditional: 742, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3129, independent: 2887, independent conditional: 2051, independent unconditional: 836, dependent: 242, dependent conditional: 153, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3129, independent: 2887, independent conditional: 2051, independent unconditional: 836, dependent: 242, dependent conditional: 153, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3458, independent: 2887, independent conditional: 2051, independent unconditional: 836, dependent: 571, dependent conditional: 482, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3458, independent: 2887, independent conditional: 49, independent unconditional: 2838, dependent: 571, dependent conditional: 85, dependent unconditional: 486, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3458, independent: 2887, independent conditional: 49, independent unconditional: 2838, dependent: 571, dependent conditional: 85, dependent unconditional: 486, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 160, independent: 131, independent conditional: 10, independent unconditional: 121, dependent: 29, dependent conditional: 24, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 160, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 29, dependent conditional: 24, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 29, dependent conditional: 24, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, independent: 53, independent conditional: 41, independent unconditional: 12, dependent: 68, dependent conditional: 48, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 3458, independent: 2756, independent conditional: 39, independent unconditional: 2717, dependent: 542, dependent conditional: 61, dependent unconditional: 481, unknown: 160, unknown conditional: 34, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 1175, Positive cache size: 1057, Positive conditional cache size: 10, Positive unconditional cache size: 1047, Negative cache size: 118, Negative conditional cache size: 24, Negative unconditional cache size: 94, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2399, Maximal queried relation: 4, Independence queries for same thread: 589 - PositiveResult [Line: 744]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 760]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 75 locations, 98 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.4s, 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: 27, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 75 locations, 98 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 75 locations, 98 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.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: 27, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-24 18:36:54,573 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 Result: TRUE