./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 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/weaver/parallel-barrier-loop.wvr.c -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 a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-19 13:37:15,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-19 13:37:15,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-19 13:37:15,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-19 13:37:15,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-19 13:37:15,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-19 13:37:15,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-19 13:37:15,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-19 13:37:15,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-19 13:37:15,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-19 13:37:15,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-19 13:37:15,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-19 13:37:15,120 INFO L153 SettingsManager]: * Use SBE=true [2025-03-19 13:37:15,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-19 13:37:15,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-19 13:37:15,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-19 13:37:15,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-19 13:37:15,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-19 13:37:15,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-19 13:37:15,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-19 13:37:15,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-19 13:37:15,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-19 13:37:15,121 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-19 13:37:15,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-19 13:37:15,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-19 13:37:15,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-19 13:37:15,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-19 13:37:15,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-19 13:37:15,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-19 13:37:15,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-19 13:37:15,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 13:37:15,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-19 13:37:15,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-19 13:37:15,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-19 13:37:15,123 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-19 13:37:15,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-19 13:37:15,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-19 13:37:15,123 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-19 13:37:15,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-19 13:37:15,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-19 13:37:15,123 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-19 13:37:15,123 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-19 13:37:15,123 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 -> a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2025-03-19 13:37:15,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-19 13:37:15,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-19 13:37:15,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-19 13:37:15,389 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-19 13:37:15,390 INFO L274 PluginConnector]: CDTParser initialized [2025-03-19 13:37:15,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2025-03-19 13:37:16,669 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e44718301/c1391ad3f4b745d6bbcb3fafecc933b2/FLAG469f983ed [2025-03-19 13:37:16,839 INFO L389 CDTParser]: Found 1 translation units. [2025-03-19 13:37:16,840 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2025-03-19 13:37:16,847 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e44718301/c1391ad3f4b745d6bbcb3fafecc933b2/FLAG469f983ed [2025-03-19 13:37:17,720 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e44718301/c1391ad3f4b745d6bbcb3fafecc933b2 [2025-03-19 13:37:17,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-19 13:37:17,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-19 13:37:17,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-19 13:37:17,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-19 13:37:17,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-19 13:37:17,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:17,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d1ab5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17, skipping insertion in model container [2025-03-19 13:37:17,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:17,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-19 13:37:17,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c[3922,3935] [2025-03-19 13:37:17,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 13:37:17,898 INFO L200 MainTranslator]: Completed pre-run [2025-03-19 13:37:17,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c[3922,3935] [2025-03-19 13:37:17,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 13:37:17,948 INFO L204 MainTranslator]: Completed translation [2025-03-19 13:37:17,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17 WrapperNode [2025-03-19 13:37:17,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-19 13:37:17,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-19 13:37:17,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-19 13:37:17,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-19 13:37:17,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:17,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:17,981 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 223 [2025-03-19 13:37:17,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-19 13:37:17,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-19 13:37:17,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-19 13:37:17,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-19 13:37:17,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:17,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:17,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:17,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:17,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:18,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:18,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:18,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:18,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:18,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-19 13:37:18,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-19 13:37:18,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-19 13:37:18,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-19 13:37:18,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (1/1) ... [2025-03-19 13:37:18,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 13:37:18,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 13:37:18,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-19 13:37:18,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-19 13:37:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-19 13:37:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-19 13:37:18,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-19 13:37:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-19 13:37:18,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-19 13:37:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-19 13:37:18,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-19 13:37:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-19 13:37:18,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-19 13:37:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-19 13:37:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-19 13:37:18,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-19 13:37:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-19 13:37:18,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-19 13:37:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-19 13:37:18,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-19 13:37:18,058 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-19 13:37:18,134 INFO L234 CfgBuilder]: Building ICFG [2025-03-19 13:37:18,135 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-19 13:37:18,424 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-19 13:37:18,425 INFO L283 CfgBuilder]: Performing block encoding [2025-03-19 13:37:18,603 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-19 13:37:18,604 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-19 13:37:18,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:37:18 BoogieIcfgContainer [2025-03-19 13:37:18,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-19 13:37:18,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-19 13:37:18,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-19 13:37:18,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-19 13:37:18,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 01:37:17" (1/3) ... [2025-03-19 13:37:18,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b9e62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 01:37:18, skipping insertion in model container [2025-03-19 13:37:18,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:37:17" (2/3) ... [2025-03-19 13:37:18,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b9e62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 01:37:18, skipping insertion in model container [2025-03-19 13:37:18,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:37:18" (3/3) ... [2025-03-19 13:37:18,615 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2025-03-19 13:37:18,625 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-19 13:37:18,627 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier-loop.wvr.c that has 7 procedures, 95 locations, 96 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-19 13:37:18,627 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-19 13:37:18,702 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-19 13:37:18,746 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 13:37:18,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-19 13:37:18,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 13:37:18,749 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-03-19 13:37:18,752 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-03-19 13:37:18,815 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 13:37:18,827 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork3 ======== [2025-03-19 13:37:18,833 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;@4601a41e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 13:37:18,834 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-19 13:37:19,936 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-19 13:37:19,938 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-03-19 13:37:19,943 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-03-19 13:37:19,945 INFO L320 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE,SAFE (1/3) [2025-03-19 13:37:19,950 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 13:37:19,951 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 13:37:19,951 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Thread1of1ForFork1 ======== [2025-03-19 13:37:19,951 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;@4601a41e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 13:37:19,952 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-19 13:37:20,010 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-19 13:37:20,011 INFO L791 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-03-19 13:37:20,012 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-03-19 13:37:20,012 INFO L320 ceAbstractionStarter]: Result for error location thread1Thread1of1ForFork1 was SAFE,SAFE (2/3) [2025-03-19 13:37:20,022 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 13:37:20,023 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 13:37:20,023 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 13:37:20,023 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;@4601a41e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 13:37:20,024 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-19 13:37:20,047 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:37:20,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:37:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1174979261, now seen corresponding path program 1 times [2025-03-19 13:37:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:37:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092168950] [2025-03-19 13:37:20,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 13:37:20,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:37:20,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-19 13:37:20,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-19 13:37:20,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 13:37:20,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:37:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 13:37:20,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:37:20,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092168950] [2025-03-19 13:37:20,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092168950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 13:37:20,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 13:37:20,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-19 13:37:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77989532] [2025-03-19 13:37:20,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 13:37:20,255 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-19 13:37:20,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:37:20,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-19 13:37:20,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-19 13:37:20,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:20,274 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:37:20,276 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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-03-19 13:37:20,276 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:23,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:23,046 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-19 13:37:23,047 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:37:23,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:37:23,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1346487597, now seen corresponding path program 1 times [2025-03-19 13:37:23,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:37:23,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433725079] [2025-03-19 13:37:23,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 13:37:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:37:23,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-19 13:37:23,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-19 13:37:23,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 13:37:23,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:37:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 13:37:23,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:37:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433725079] [2025-03-19 13:37:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433725079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 13:37:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 13:37:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 13:37:23,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646113099] [2025-03-19 13:37:23,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 13:37:23,553 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 13:37:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:37:23,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 13:37:23,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 13:37:23,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:23,560 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:37:23,561 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-03-19 13:37:23,561 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:23,561 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:23,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:23,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:23,973 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-19 13:37:23,973 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:37:23,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:37:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash -422575649, now seen corresponding path program 2 times [2025-03-19 13:37:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:37:23,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485427565] [2025-03-19 13:37:23,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 13:37:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:37:24,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 383 statements into 2 equivalence classes. [2025-03-19 13:37:24,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 231 of 383 statements. [2025-03-19 13:37:24,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-19 13:37:24,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:37:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-19 13:37:24,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:37:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485427565] [2025-03-19 13:37:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485427565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 13:37:24,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 13:37:24,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 13:37:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442192890] [2025-03-19 13:37:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 13:37:24,147 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 13:37:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:37:24,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 13:37:24,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 13:37:24,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:24,148 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:37:24,148 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-03-19 13:37:24,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:24,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:24,148 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:26,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:26,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:26,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:26,646 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-19 13:37:26,648 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:37:26,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:37:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2041688963, now seen corresponding path program 3 times [2025-03-19 13:37:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:37:26,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626261575] [2025-03-19 13:37:26,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-19 13:37:26,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:37:26,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 591 statements into 3 equivalence classes. [2025-03-19 13:37:26,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 295 of 591 statements. [2025-03-19 13:37:26,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-19 13:37:26,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:37:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-19 13:37:26,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:37:26,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626261575] [2025-03-19 13:37:26,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626261575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 13:37:26,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 13:37:26,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 13:37:26,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069131128] [2025-03-19 13:37:26,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 13:37:26,882 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 13:37:26,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:37:26,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 13:37:26,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 13:37:26,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:26,884 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:37:26,884 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-03-19 13:37:26,884 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:26,884 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:26,884 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:26,884 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:27,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:27,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:27,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:27,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:27,462 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-19 13:37:27,462 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:37:27,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:37:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash -658444335, now seen corresponding path program 4 times [2025-03-19 13:37:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:37:27,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541079245] [2025-03-19 13:37:27,462 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-19 13:37:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:37:27,471 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-19 13:37:27,501 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-19 13:37:27,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-19 13:37:27,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:37:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-19 13:37:27,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:37:27,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541079245] [2025-03-19 13:37:27,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541079245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 13:37:27,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 13:37:27,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 13:37:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96111917] [2025-03-19 13:37:27,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 13:37:27,569 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 13:37:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:37:27,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 13:37:27,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 13:37:27,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:27,570 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:37:27,570 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-03-19 13:37:27,570 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:27,570 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:27,570 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:27,570 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:27,570 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:27,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:27,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:27,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:27,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:27,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:27,992 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-19 13:37:27,992 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:37:27,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:37:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1683253364, now seen corresponding path program 5 times [2025-03-19 13:37:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:37:27,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457661474] [2025-03-19 13:37:27,992 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-19 13:37:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:37:28,002 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 135 statements into 1 equivalence classes. [2025-03-19 13:37:28,011 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-19 13:37:28,012 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-19 13:37:28,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:37:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 13:37:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:37:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457661474] [2025-03-19 13:37:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457661474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 13:37:28,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 13:37:28,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 13:37:28,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328345428] [2025-03-19 13:37:28,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 13:37:28,055 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 13:37:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:37:28,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 13:37:28,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 13:37:28,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:28,056 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:37:28,056 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-03-19 13:37:28,056 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:28,056 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,056 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,056 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,056 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,056 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:28,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:28,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,378 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-19 13:37:28,378 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:37:28,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:37:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1465280675, now seen corresponding path program 1 times [2025-03-19 13:37:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:37:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843501029] [2025-03-19 13:37:28,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 13:37:28,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:37:28,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-19 13:37:28,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-19 13:37:28,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 13:37:28,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 13:37:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 13:37:28,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 13:37:28,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843501029] [2025-03-19 13:37:28,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843501029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 13:37:28,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 13:37:28,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-19 13:37:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906969200] [2025-03-19 13:37:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 13:37:28,478 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 13:37:28,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 13:37:28,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 13:37:28,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 13:37:28,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:28,479 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 13:37:28,479 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-03-19 13:37:28,479 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:28,479 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,479 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,479 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,479 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,479 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,479 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:28,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 13:37:28,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 13:37:28,796 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-19 13:37:28,796 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 13:37:28,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 13:37:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1139542813, now seen corresponding path program 2 times [2025-03-19 13:37:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 13:37:28,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640540096] [2025-03-19 13:37:28,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 13:37:28,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 13:37:28,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 1 equivalence classes. [2025-03-19 13:37:28,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-19 13:37:28,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-19 13:37:28,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 13:37:28,833 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 13:37:28,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-19 13:37:28,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-19 13:37:28,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 13:37:28,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 13:37:28,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-19 13:37:28,917 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 13:37:28,917 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-19 13:37:28,917 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-19 13:37:28,918 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-19 13:37:28,918 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-19 13:37:28,919 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1] [2025-03-19 13:37:28,920 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (3/3) [2025-03-19 13:37:29,037 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-19 13:37:29,037 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-03-19 13:37:29,050 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-03-19 13:37:29,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 01:37:29 BasicIcfg [2025-03-19 13:37:29,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-19 13:37:29,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-19 13:37:29,051 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-19 13:37:29,051 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-19 13:37:29,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:37:18" (3/4) ... [2025-03-19 13:37:29,053 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-19 13:37:29,156 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 25. [2025-03-19 13:37:29,205 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-03-19 13:37:29,205 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-03-19 13:37:29,205 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-19 13:37:29,206 INFO L158 Benchmark]: Toolchain (without parser) took 11482.94ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 92.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 270.0MB. Max. memory is 16.1GB. [2025-03-19 13:37:29,206 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 13:37:29,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.82ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 76.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-19 13:37:29,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.07ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 74.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 13:37:29,207 INFO L158 Benchmark]: Boogie Preprocessor took 32.30ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 73.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 13:37:29,207 INFO L158 Benchmark]: RCFGBuilder took 590.51ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 83.6MB in the end (delta: -10.3MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2025-03-19 13:37:29,207 INFO L158 Benchmark]: TraceAbstraction took 10443.95ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 83.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. [2025-03-19 13:37:29,208 INFO L158 Benchmark]: Witness Printer took 154.28ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 32.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-19 13:37:29,209 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.81ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.82ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 76.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.07ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 74.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.30ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 73.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 590.51ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 83.6MB in the end (delta: -10.3MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10443.95ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 83.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. * Witness Printer took 154.28ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 32.8MB). Peak memory consumption was 25.2MB. 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: 10811, independent: 10214, independent conditional: 5241, independent unconditional: 4973, dependent: 597, dependent conditional: 543, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 0, independent unconditional: 10214, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4819, independent: 4765, independent conditional: 0, independent unconditional: 4765, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4819, independent: 4756, independent conditional: 0, independent unconditional: 4756, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 773, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 647, dependent conditional: 0, dependent unconditional: 647, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10283, independent: 5449, independent conditional: 0, independent unconditional: 5449, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4819, unknown conditional: 0, unknown unconditional: 4819] , Statistics on independence cache: Total cache size (in pairs): 4819, Positive cache size: 4765, Positive conditional cache size: 0, Positive unconditional cache size: 4765, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 528, Persistent sets #1 benchmarks: Persistent set computation time: 0.9s, Number of persistent set computation: 437, Number of trivial persistent sets: 36, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10811, independent: 10214, independent conditional: 5241, independent unconditional: 4973, dependent: 597, dependent conditional: 543, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 0, independent unconditional: 10214, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4819, independent: 4765, independent conditional: 0, independent unconditional: 4765, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4819, independent: 4756, independent conditional: 0, independent unconditional: 4756, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 773, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 647, dependent conditional: 0, dependent unconditional: 647, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10283, independent: 5449, independent conditional: 0, independent unconditional: 5449, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4819, unknown conditional: 0, unknown unconditional: 4819] , Statistics on independence cache: Total cache size (in pairs): 4819, Positive cache size: 4765, Positive conditional cache size: 0, Positive unconditional cache size: 4765, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 528 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6758, independent: 6487, independent conditional: 1765, independent unconditional: 4722, dependent: 271, dependent conditional: 217, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 0, independent unconditional: 6487, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 283, independent: 283, independent conditional: 0, independent unconditional: 283, 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: 283, independent: 283, independent conditional: 0, independent unconditional: 283, 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: 6556, independent: 6204, independent conditional: 0, independent unconditional: 6204, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 283, unknown conditional: 0, unknown unconditional: 283] , Statistics on independence cache: Total cache size (in pairs): 5102, Positive cache size: 5048, Positive conditional cache size: 0, Positive unconditional cache size: 5048, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 202, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 156, Number of trivial persistent sets: 22, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6758, independent: 6487, independent conditional: 1765, independent unconditional: 4722, dependent: 271, dependent conditional: 217, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 0, independent unconditional: 6487, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 283, independent: 283, independent conditional: 0, independent unconditional: 283, 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: 283, independent: 283, independent conditional: 0, independent unconditional: 283, 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: 6556, independent: 6204, independent conditional: 0, independent unconditional: 6204, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 283, unknown conditional: 0, unknown unconditional: 283] , Statistics on independence cache: Total cache size (in pairs): 5102, Positive cache size: 5048, Positive conditional cache size: 0, Positive unconditional cache size: 5048, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 202 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 813709, independent: 735815, independent conditional: 727531, independent unconditional: 8284, dependent: 77894, dependent conditional: 77816, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 752646, independent: 735815, independent conditional: 0, independent unconditional: 735815, dependent: 16831, dependent conditional: 0, dependent unconditional: 16831, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2283, independent: 2253, independent conditional: 0, independent unconditional: 2253, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2283, independent: 2241, independent conditional: 0, independent unconditional: 2241, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 752646, independent: 733562, independent conditional: 0, independent unconditional: 733562, dependent: 16801, dependent conditional: 0, dependent unconditional: 16801, unknown: 2283, unknown conditional: 0, unknown unconditional: 2283] , Statistics on independence cache: Total cache size (in pairs): 7385, Positive cache size: 7301, Positive conditional cache size: 0, Positive unconditional cache size: 7301, Negative cache size: 84, Negative conditional cache size: 0, Negative unconditional cache size: 84, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 61063, Persistent sets #1 benchmarks: Persistent set computation time: 1.5s, Number of persistent set computation: 41681, Number of trivial persistent sets: 41667, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 813709, independent: 735815, independent conditional: 727531, independent unconditional: 8284, dependent: 77894, dependent conditional: 77816, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 752646, independent: 735815, independent conditional: 0, independent unconditional: 735815, dependent: 16831, dependent conditional: 0, dependent unconditional: 16831, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2283, independent: 2253, independent conditional: 0, independent unconditional: 2253, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2283, independent: 2241, independent conditional: 0, independent unconditional: 2241, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 752646, independent: 733562, independent conditional: 0, independent unconditional: 733562, dependent: 16801, dependent conditional: 0, dependent unconditional: 16801, unknown: 2283, unknown conditional: 0, unknown unconditional: 2283] , Statistics on independence cache: Total cache size (in pairs): 7385, Positive cache size: 7301, Positive conditional cache size: 0, Positive unconditional cache size: 7301, Negative cache size: 84, Negative conditional cache size: 0, Negative unconditional cache size: 84, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 61063 - CounterExampleResult [Line: 171]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L36] 0 _Atomic unsigned int x_0, y_1, x_8, y_9; [L37] 0 _Atomic _Bool f1_2, f2_3, f1_10, f2_11; [L38] 0 unsigned int temp_4, temp_5, temp_6, temp_7, temp_12, temp_13, temp_14, temp_15; [L142] 0 pthread_t t1, t4; [L145] 0 x_0 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-1, x_8=0, y_1=0, y_9=0] [L146] 0 y_1 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-1, x_8=0, y_1=3, y_9=0] [L147] 0 x_8 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-1, x_8=4294967295, y_1=3, y_9=0] [L148] 0 y_9 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L149] 0 temp_4 = __VERIFIER_nondet_uint() [L150] 0 temp_5 = __VERIFIER_nondet_uint() [L151] 0 temp_6 = __VERIFIER_nondet_uint() [L152] 0 temp_7 = __VERIFIER_nondet_uint() [L153] 0 temp_12 = __VERIFIER_nondet_uint() [L154] 0 temp_13 = __VERIFIER_nondet_uint() [L155] 0 temp_14 = __VERIFIER_nondet_uint() [L156] 0 temp_15 = __VERIFIER_nondet_uint() [L157] 0 f1_2 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L158] 0 f2_3 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L159] 0 f1_10 = __VERIFIER_nondet_bool() VAL [f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L160] 0 f2_11 = __VERIFIER_nondet_bool() VAL [f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L163] CALL 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L33] COND FALSE 0 !(!cond) [L163] RET 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L165] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(_argptr, Pre)={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t1=-5, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L78] 1 pthread_t t2, t3; VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L80] 1 f1_2 = 0 VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L81] 1 f2_3 = 0 VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L83] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L84] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L166] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L128] 4 pthread_t t5, t6; VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L130] 4 f1_10 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L131] 4 f2_11 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L133] FCALL, FORK 4 pthread_create(&t5, 0, thread5, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L134] FCALL, FORK 4 pthread_create(&t6, 0, thread6, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L42] COND TRUE 2 __VERIFIER_nondet_bool() [L43] 2 temp_4 = x_0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L44] 2 x_0 = temp_4 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, x_0=0, x_8=4294967295, y_1=3, y_9=-4294967293] [L46] 2 f1_2 = 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, x_0=0, x_8=4294967295, y_1=3, y_9=-4294967293] [L60] COND TRUE 3 __VERIFIER_nondet_bool() [L61] 3 temp_6 = y_1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_6=3, x_0=0, x_8=4294967295, y_1=3, y_9=-4294967293] [L62] 3 y_1 = temp_6 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_6=3, x_0=0, x_8=4294967295, y_1=4, y_9=-4294967293] [L64] 3 f2_3 = 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_6=3, x_0=0, x_8=4294967295, y_1=4, y_9=-4294967293] [L47] CALL 2 assume_abort_if_not(f2_3) [L33] COND FALSE 2 !(!cond) [L47] RET 2 assume_abort_if_not(f2_3) [L49] 2 temp_5 = y_1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, x_0=0, x_8=4294967295, y_1=4, y_9=-4294967293] [L50] 2 y_1 = temp_5 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, x_0=0, x_8=4294967295, y_1=5, y_9=-4294967293] [L65] CALL 3 assume_abort_if_not(f1_2) [L33] COND FALSE 3 !(!cond) [L65] RET 3 assume_abort_if_not(f1_2) [L67] 3 temp_7 = x_0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=0, x_8=4294967295, y_1=5, y_9=-4294967293] [L52] 2 f1_2 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=0, x_8=4294967295, y_1=5, y_9=-4294967293] [L68] 3 x_0 = temp_7 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L70] 3 f2_3 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L53] CALL 2 assume_abort_if_not(!f2_3) [L33] COND FALSE 2 !(!cond) [L53] RET 2 assume_abort_if_not(!f2_3) [L71] CALL 3 assume_abort_if_not(!f1_2) [L33] COND FALSE 3 !(!cond) [L71] RET 3 assume_abort_if_not(!f1_2) [L92] COND FALSE 5 !(__VERIFIER_nondet_bool()) [L106] 5 return 0; [L135] FCALL, JOIN 5 pthread_join(t5, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L110] COND FALSE 6 !(__VERIFIER_nondet_bool()) [L124] 6 return 0; [L136] FCALL, JOIN 6 pthread_join(t6, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L138] 4 return 0; [L42] COND FALSE 2 !(__VERIFIER_nondet_bool()) [L56] 2 return 0; [L85] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L60] COND FALSE 3 !(__VERIFIER_nondet_bool()) [L74] 3 return 0; [L86] FCALL, JOIN 3 pthread_join(t3, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L88] 1 return 0; [L167] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L168] FCALL, JOIN 4 pthread_join(t4, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L170] CALL 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L33] COND FALSE 0 !(!cond) [L170] RET 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L171] 0 reach_error() VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] - UnprovableResult [Line: 166]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 165]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread4Thread1of1ForFork3 with 1 thread instances CFG has 13 procedures, 173 locations, 204 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 1.1s, 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: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread1Thread1of1ForFork1 with 1 thread instances CFG has 13 procedures, 173 locations, 204 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, 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: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 13 procedures, 173 locations, 204 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 7.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1980 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1894 ConstructedInterpolants, 0 QuantifiedInterpolants, 2088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-19 13:37:29,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE