./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-hard1.wvr.c --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 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/test-hard1.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 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 04:01:41,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 04:01:41,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 04:01:41,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 04:01:41,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 04:01:41,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 04:01:41,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 04:01:41,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 04:01:41,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 04:01:41,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 04:01:41,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 04:01:41,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 04:01:41,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 04:01:41,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 04:01:41,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 04:01:41,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 04:01:41,846 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 04:01:41,846 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 -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-04-25 04:01:42,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 04:01:42,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 04:01:42,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 04:01:42,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 04:01:42,080 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 04:01:42,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-04-25 04:01:43,368 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fbc04d30a/e901d45e092640f4bab99cea5421e045/FLAGecec6f60f [2025-04-25 04:01:43,574 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 04:01:43,575 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-04-25 04:01:43,580 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fbc04d30a/e901d45e092640f4bab99cea5421e045/FLAGecec6f60f [2025-04-25 04:01:44,368 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fbc04d30a/e901d45e092640f4bab99cea5421e045 [2025-04-25 04:01:44,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 04:01:44,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 04:01:44,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 04:01:44,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 04:01:44,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 04:01:44,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9be154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44, skipping insertion in model container [2025-04-25 04:01:44,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 04:01:44,542 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c[3425,3438] [2025-04-25 04:01:44,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 04:01:44,555 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 04:01:44,588 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c[3425,3438] [2025-04-25 04:01:44,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 04:01:44,601 INFO L204 MainTranslator]: Completed translation [2025-04-25 04:01:44,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44 WrapperNode [2025-04-25 04:01:44,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 04:01:44,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 04:01:44,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 04:01:44,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 04:01:44,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,633 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-04-25 04:01:44,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 04:01:44,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 04:01:44,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 04:01:44,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 04:01:44,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 04:01:44,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 04:01:44,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 04:01:44,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 04:01:44,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (1/1) ... [2025-04-25 04:01:44,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 04:01:44,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 04:01:44,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 04:01:44,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 04:01:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 04:01:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 04:01:44,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 04:01:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 04:01:44,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 04:01:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 04:01:44,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 04:01:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-25 04:01:44,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-25 04:01:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 04:01:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-25 04:01:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-25 04:01:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 04:01:44,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 04:01:44,703 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 04:01:44,776 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 04:01:44,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 04:01:44,933 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 04:01:44,933 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 04:01:45,049 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 04:01:45,049 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 04:01:45,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 04:01:45 BoogieIcfgContainer [2025-04-25 04:01:45,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 04:01:45,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 04:01:45,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 04:01:45,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 04:01:45,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 04:01:44" (1/3) ... [2025-04-25 04:01:45,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690deaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 04:01:45, skipping insertion in model container [2025-04-25 04:01:45,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:01:44" (2/3) ... [2025-04-25 04:01:45,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690deaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 04:01:45, skipping insertion in model container [2025-04-25 04:01:45,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 04:01:45" (3/3) ... [2025-04-25 04:01:45,058 INFO L128 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2025-04-25 04:01:45,068 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 04:01:45,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-hard1.wvr.c that has 5 procedures, 41 locations, 40 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-25 04:01:45,069 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 04:01:45,122 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-25 04:01:45,154 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 04:01:45,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 04:01:45,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 04:01:45,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 04:01:45,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 04:01:45,221 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 04:01:45,228 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 04:01:45,233 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;@4d71f980, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 04:01:45,233 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-25 04:01:46,130 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 04:01:46,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:01:46,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1146247591, now seen corresponding path program 1 times [2025-04-25 04:01:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:01:46,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074691294] [2025-04-25 04:01:46,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:01:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:01:46,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-25 04:01:46,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-25 04:01:46,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:01:46,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:01:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 04:01:49,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:01:49,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074691294] [2025-04-25 04:01:49,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074691294] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:01:49,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:01:49,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-25 04:01:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993268049] [2025-04-25 04:01:49,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:01:49,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-25 04:01:49,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:01:49,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-25 04:01:49,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-04-25 04:01:49,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:01:49,704 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:01:49,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 04:01:49,706 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:01:51,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:01:51,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 04:01:51,041 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 04:01:51,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:01:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1758946009, now seen corresponding path program 2 times [2025-04-25 04:01:51,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:01:51,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066612254] [2025-04-25 04:01:51,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 04:01:51,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:01:51,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-04-25 04:01:51,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-04-25 04:01:51,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 04:01:51,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:01:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 04:01:51,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:01:51,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066612254] [2025-04-25 04:01:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066612254] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 04:01:51,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916911409] [2025-04-25 04:01:51,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 04:01:51,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 04:01:51,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 04:01:51,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 04:01:51,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 04:01:51,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-04-25 04:01:51,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-04-25 04:01:51,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 04:01:51,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:01:51,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-25 04:01:51,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 04:01:54,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 04:01:54,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 04:01:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 04:01:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916911409] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 04:01:55,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 04:01:55,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 20] total 52 [2025-04-25 04:01:55,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027863438] [2025-04-25 04:01:55,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 04:01:55,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-25 04:01:55,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:01:55,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-25 04:01:55,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=2262, Unknown=0, NotChecked=0, Total=2756 [2025-04-25 04:01:55,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:01:55,245 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:01:55,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.188679245283019) internal successors, (169), 52 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 04:01:55,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:01:55,245 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:01:59,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:01:59,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-25 04:01:59,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-25 04:01:59,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-25 04:01:59,880 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 04:01:59,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:01:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2040944845, now seen corresponding path program 3 times [2025-04-25 04:01:59,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:01:59,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406963521] [2025-04-25 04:01:59,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 04:01:59,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:01:59,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 5 equivalence classes. [2025-04-25 04:01:59,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 63 of 93 statements. [2025-04-25 04:01:59,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 04:01:59,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:02:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-04-25 04:02:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:02:00,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406963521] [2025-04-25 04:02:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406963521] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:02:00,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:02:00,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 04:02:00,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831608692] [2025-04-25 04:02:00,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:02:00,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 04:02:00,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:02:00,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 04:02:00,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-25 04:02:00,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:02:00,094 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:02:00,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 04:02:00,094 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:02:00,094 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2025-04-25 04:02:00,094 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:02:00,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:02:00,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-25 04:02:00,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:02:00,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 04:02:00,197 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 04:02:00,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:02:00,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2104342291, now seen corresponding path program 4 times [2025-04-25 04:02:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:02:00,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416305204] [2025-04-25 04:02:00,198 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 04:02:00,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:02:00,205 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-04-25 04:02:00,228 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-04-25 04:02:00,229 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 04:02:00,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:02:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-04-25 04:02:00,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:02:00,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416305204] [2025-04-25 04:02:00,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416305204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:02:00,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:02:00,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 04:02:00,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223827055] [2025-04-25 04:02:00,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:02:00,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 04:02:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:02:00,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 04:02:00,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-25 04:02:00,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:02:00,439 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:02:00,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 04:02:00,439 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:02:00,439 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2025-04-25 04:02:00,439 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:02:00,439 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:02:00,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:02:00,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-25 04:02:00,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:02:00,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:02:00,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 04:02:00,526 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 04:02:00,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:02:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash 358607896, now seen corresponding path program 5 times [2025-04-25 04:02:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:02:00,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907513171] [2025-04-25 04:02:00,526 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 04:02:00,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:02:00,537 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 96 statements into 5 equivalence classes. [2025-04-25 04:02:00,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 96 of 96 statements. [2025-04-25 04:02:00,605 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-25 04:02:00,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:02:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 30 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 04:02:02,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:02:02,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907513171] [2025-04-25 04:02:02,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907513171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 04:02:02,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12042006] [2025-04-25 04:02:02,768 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 04:02:02,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 04:02:02,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 04:02:02,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 04:02:02,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 04:02:02,815 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 96 statements into 5 equivalence classes. [2025-04-25 04:02:02,899 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 96 of 96 statements. [2025-04-25 04:02:02,899 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-25 04:02:02,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:02:02,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-25 04:02:02,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 04:02:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-04-25 04:02:02,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 04:02:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-04-25 04:02:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12042006] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-25 04:02:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-25 04:02:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [38, 6] total 44 [2025-04-25 04:02:03,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246663199] [2025-04-25 04:02:03,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:02:03,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 04:02:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:02:03,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 04:02:03,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1465, Unknown=0, NotChecked=0, Total=1892 [2025-04-25 04:02:03,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:02:03,031 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:02:03,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 04:02:03,031 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:02:03,031 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2025-04-25 04:02:03,031 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:02:03,032 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:02:03,032 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:02:03,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:02:03,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-25 04:02:03,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:02:03,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:02:03,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 04:02:03,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-25 04:02:03,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 04:02:03,364 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 04:02:03,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:02:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 919260311, now seen corresponding path program 6 times [2025-04-25 04:02:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:02:03,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280000785] [2025-04-25 04:02:03,365 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 04:02:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:02:03,373 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 93 statements into 5 equivalence classes. [2025-04-25 04:02:03,470 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 93 of 93 statements. [2025-04-25 04:02:03,471 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-25 04:02:03,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:02:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 04:02:07,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:02:07,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280000785] [2025-04-25 04:02:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280000785] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 04:02:07,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364762955] [2025-04-25 04:02:07,160 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 04:02:07,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 04:02:07,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 04:02:07,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 04:02:07,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-25 04:02:07,202 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 93 statements into 5 equivalence classes. [2025-04-25 04:02:07,257 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 93 of 93 statements. [2025-04-25 04:02:07,257 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-25 04:02:07,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:02:07,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-25 04:02:07,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 04:02:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 04:02:42,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 04:04:03,058 WARN L849 $PredicateComparison]: unable to prove that (or (let ((.cse5 (not (= 16 c_~n2~0))) (.cse1 (* 14 c_~p2~0)) (.cse7 (* 12 c_~p2~0)) (.cse9 (not (= 14 c_~n2~0)))) (and (or (not (= 8 c_~n1~0)) (let ((.cse0 (mod (+ (* 4294967289 c_~p2~0) c_~p1~0) 4294967296))) (and (or (and (forall ((v_z_31 Int)) (or (< 4294967295 v_z_31) (forall ((v_z_54 Int) (v_y_31 Int) (v_y_54 Int)) (or (< (+ v_z_54 v_z_31 .cse0) 4294967297) (< 4294967295 (+ v_z_54 .cse0)) (< v_z_54 0) (not (= (+ (* v_z_54 46017506745) (* v_y_54 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))))))) (forall ((v_z_31 Int)) (or (forall ((v_z_54 Int) (v_y_31 Int) (v_y_54 Int)) (let ((.cse2 (+ v_z_54 v_z_31 .cse0))) (or (< .cse2 4294967297) (< 4294967295 v_z_54) (= 8589934592 .cse2) (< (+ v_z_54 .cse0) 4294967296) (not (= (+ (* v_z_54 46017506745) (* v_y_54 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1)))))) (< v_z_31 0) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (< v_z_31 0) (forall ((v_z_54 Int) (v_y_31 Int) (v_y_54 Int)) (let ((.cse3 (+ v_z_54 v_z_31 .cse0))) (or (< .cse3 4294967297) (< 4294967295 v_z_54) (= 8589934592 .cse3) (< v_z_54 0) (not (= (+ (* v_z_54 46017506745) (* v_y_54 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1)))))) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (forall ((v_z_54 Int) (v_y_31 Int) (v_y_54 Int)) (let ((.cse4 (+ v_z_54 v_z_31 .cse0))) (or (< 4294967295 (+ v_z_54 .cse0)) (= .cse4 4294967296) (< v_z_54 0) (not (= (+ (* v_z_54 46017506745) (* v_y_54 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (< .cse4 1)))) (< v_z_31 0) (< 4294967295 v_z_31)))) .cse5) (or (and (forall ((v_z_31 Int)) (or (forall ((v_z_52 Int) (v_y_52 Int) (v_y_31 Int)) (let ((.cse6 (+ v_z_52 v_z_31 .cse0))) (or (< 4294967295 (+ v_z_52 .cse0)) (= .cse6 4294967296) (< .cse6 1) (not (= (+ (* v_y_52 55834574848) (* v_z_52 39881839179)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7))) (< v_z_52 0)))) (< v_z_31 0) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (< v_z_31 0) (< 4294967295 v_z_31) (forall ((v_z_52 Int) (v_y_52 Int) (v_y_31 Int)) (let ((.cse8 (+ v_z_52 v_z_31 .cse0))) (or (< .cse8 4294967297) (= .cse8 8589934592) (not (= (+ (* v_y_52 55834574848) (* v_z_52 39881839179)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7))) (< v_z_52 0) (< 4294967295 v_z_52))))))) .cse9)))) (or (< c_~n1~0 10) (and (or (< 11 c_~n1~0) (and (or (= 11 c_~n1~0) (let ((.cse10 (mod (+ (* 4294967287 c_~p2~0) c_~p1~0) 4294967296))) (and (or (and (forall ((v_z_31 Int)) (or (forall ((v_z_37 Int) (v_y_37 Int) (v_y_31 Int)) (or (< 4294967295 (+ .cse10 v_z_37)) (not (= (+ (* 14316557655 v_z_37) (* v_y_37 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (< v_z_37 0) (< (+ .cse10 v_z_31 v_z_37) 4294967297))) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (forall ((v_z_37 Int) (v_y_37 Int) (v_y_31 Int)) (let ((.cse11 (+ .cse10 v_z_31 v_z_37))) (or (not (= (+ (* 14316557655 v_z_37) (* v_y_37 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (< 4294967295 v_z_37) (< v_z_37 0) (= 8589934592 .cse11) (< .cse11 4294967297)))) (< v_z_31 0) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (forall ((v_z_37 Int) (v_y_37 Int) (v_y_31 Int)) (let ((.cse12 (+ .cse10 v_z_31 v_z_37))) (or (< 4294967295 (+ .cse10 v_z_37)) (not (= (+ (* 14316557655 v_z_37) (* v_y_37 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (< .cse12 1) (< v_z_37 0) (= .cse12 4294967296)))) (< v_z_31 0) (< 4294967295 v_z_31)))) .cse5) (or .cse9 (and (forall ((v_z_31 Int)) (or (< v_z_31 0) (forall ((v_z_38 Int) (v_y_38 Int) (v_y_31 Int)) (let ((.cse13 (+ .cse10 v_z_31 v_z_38))) (or (= .cse13 4294967296) (< v_z_38 0) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (+ (* 12407683301 v_z_38) (* v_y_38 55834574848)))) (< .cse13 1) (< 4294967295 (+ .cse10 v_z_38))))) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (forall ((v_z_38 Int) (v_y_38 Int) (v_y_31 Int)) (let ((.cse14 (+ .cse10 v_z_31 v_z_38))) (or (< 4294967295 v_z_38) (< .cse14 4294967297) (< v_z_38 0) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (+ (* 12407683301 v_z_38) (* v_y_38 55834574848)))) (= 8589934592 .cse14)))) (< v_z_31 0) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (forall ((v_z_38 Int) (v_y_38 Int) (v_y_31 Int)) (or (< (+ .cse10 v_z_31 v_z_38) 4294967297) (< v_z_38 0) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (+ (* 12407683301 v_z_38) (* v_y_38 55834574848)))) (< 4294967295 (+ .cse10 v_z_38)))) (< 4294967295 v_z_31)))))))) (or (= 10 c_~n1~0) (let ((.cse16 (* 4294967286 c_~p2~0))) (and (or .cse9 (forall ((v_~p2~0_129 Int) (v_z_31 Int) (v_y_31 Int)) (let ((.cse15 (+ v_z_31 (mod (+ (* v_~p2~0_129 10) c_~p1~0 .cse16) 4294967296)))) (or (< .cse15 1) (< v_z_31 0) (= .cse15 4294967296) (< 4294967295 v_z_31) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (* v_~p2~0_129 13))))))) (or (forall ((v_~p2~0_129 Int) (v_z_31 Int) (v_y_31 Int)) (let ((.cse17 (+ v_z_31 (mod (+ (* v_~p2~0_129 10) c_~p1~0 .cse16) 4294967296)))) (or (< .cse17 1) (< v_z_31 0) (= .cse17 4294967296) (< 4294967295 v_z_31) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1) (* v_~p2~0_129 15)))))) .cse5)))))) (or (< c_~n1~0 12) (and (or (let ((.cse18 (mod (+ c_~p1~0 (* 4294967285 c_~p2~0)) 4294967296))) (and (or (and (forall ((v_z_42 Int)) (or (< 4294967295 (+ v_z_42 .cse18)) (< v_z_42 0) (forall ((v_z_31 Int) (v_y_31 Int) (v_y_42 Int)) (let ((.cse19 (+ v_z_42 v_z_31 .cse18))) (or (< .cse19 1) (not (= (+ (* v_y_42 64424509440) (* v_z_42 46854188685)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (< v_z_31 0) (< 4294967295 v_z_31) (= .cse19 4294967296)))))) (forall ((v_z_42 Int)) (or (forall ((v_z_31 Int) (v_y_31 Int) (v_y_42 Int)) (let ((.cse20 (+ v_z_42 v_z_31 .cse18))) (or (< .cse20 4294967297) (not (= (+ (* v_y_42 64424509440) (* v_z_42 46854188685)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (= 8589934592 .cse20) (< v_z_31 0) (< 4294967295 v_z_31)))) (< 4294967295 v_z_42) (< (+ v_z_42 .cse18) 4294967296))) (forall ((v_z_42 Int)) (or (< 4294967295 v_z_42) (forall ((v_y_31 Int) (v_z_31 Int) (v_y_42 Int)) (let ((.cse21 (+ v_z_42 v_z_31 .cse18))) (or (< .cse21 4294967297) (not (= (+ (* v_y_42 64424509440) (* v_z_42 46854188685)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (= 8589934592 .cse21) (< v_z_31 0) (< 4294967295 v_z_31)))) (< v_z_42 0)))) .cse5) (or (and (forall ((v_z_31 Int)) (or (< v_z_31 0) (< 4294967295 v_z_31) (forall ((v_y_40 Int) (v_z_40 Int) (v_y_31 Int)) (let ((.cse22 (+ v_z_40 v_z_31 .cse18))) (or (= 8589934592 .cse22) (< (+ v_z_40 .cse18) 4294967296) (< 4294967295 v_z_40) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (+ (* v_y_40 55834574848) (* v_z_40 40606963527)))) (< .cse22 4294967297)))))) (forall ((v_z_31 Int)) (or (forall ((v_y_40 Int) (v_z_40 Int) (v_y_31 Int)) (let ((.cse23 (+ v_z_40 v_z_31 .cse18))) (or (= 8589934592 .cse23) (< v_z_40 0) (< 4294967295 v_z_40) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (+ (* v_y_40 55834574848) (* v_z_40 40606963527)))) (< .cse23 4294967297)))) (< v_z_31 0) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (< v_z_31 0) (< 4294967295 v_z_31) (forall ((v_y_40 Int) (v_z_40 Int) (v_y_31 Int)) (let ((.cse24 (+ v_z_40 v_z_31 .cse18))) (or (< .cse24 1) (< 4294967295 (+ v_z_40 .cse18)) (= .cse24 4294967296) (< v_z_40 0) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (+ (* v_y_40 55834574848) (* v_z_40 40606963527)))))))))) .cse9))) (< 12 c_~n1~0)) (or (and (or (< 14 c_~n1~0) (and (or (let ((.cse26 (* 4294967284 c_~p2~0))) (and (or (forall ((v_~p2~0_129 Int) (v_z_31 Int) (v_y_31 Int)) (let ((.cse25 (+ v_z_31 (mod (+ .cse26 c_~p1~0 (* v_~p2~0_129 12)) 4294967296)))) (or (< .cse25 1) (< v_z_31 0) (< 4294967295 v_z_31) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (* v_~p2~0_129 13))) (= .cse25 4294967296)))) .cse9) (or .cse5 (forall ((v_~p2~0_129 Int) (v_z_31 Int) (v_y_31 Int)) (let ((.cse27 (+ v_z_31 (mod (+ .cse26 c_~p1~0 (* v_~p2~0_129 12)) 4294967296)))) (or (< .cse27 1) (< v_z_31 0) (< 4294967295 v_z_31) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1) (* v_~p2~0_129 15))) (= .cse27 4294967296))))))) (= 14 c_~n1~0)) (or (= 13 c_~n1~0) (let ((.cse29 (mod (+ (* 4294967283 c_~p2~0) c_~p1~0) 4294967296))) (and (or .cse5 (and (forall ((v_z_31 Int)) (or (forall ((v_z_47 Int) (v_y_47 Int) (v_y_31 Int)) (let ((.cse28 (+ v_z_47 v_z_31 .cse29))) (or (not (= (+ (* v_y_47 64424509440) (* 49557314955 v_z_47)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (< 4294967295 v_z_47) (= 8589934592 .cse28) (< v_z_47 0) (< .cse28 4294967297)))) (< v_z_31 0) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (forall ((v_z_47 Int) (v_y_47 Int) (v_y_31 Int)) (let ((.cse30 (+ v_z_47 v_z_31 .cse29))) (or (not (= (+ (* v_y_47 64424509440) (* 49557314955 v_z_47)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (= 4294967296 .cse30) (< 4294967295 (+ v_z_47 .cse29)) (< .cse30 1) (< v_z_47 0)))) (< v_z_31 0) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (< 4294967295 v_z_31) (forall ((v_z_47 Int) (v_y_47 Int) (v_y_31 Int)) (or (not (= (+ (* v_y_47 64424509440) (* 49557314955 v_z_47)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (< 4294967295 (+ v_z_47 .cse29)) (< v_z_47 0) (< (+ v_z_47 v_z_31 .cse29) 4294967297))))))) (or (and (forall ((v_z_44 Int)) (or (< 4294967295 (+ v_z_44 .cse29)) (< v_z_44 0) (forall ((v_z_31 Int) (v_y_31 Int) (v_y_44 Int)) (or (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (+ (* 42949672961 v_z_44) (* v_y_44 55834574848)))) (< (+ v_z_44 v_z_31 .cse29) 4294967297) (< 4294967295 v_z_31))))) (forall ((v_z_44 Int)) (or (< v_z_44 0) (< 4294967295 v_z_44) (forall ((v_y_31 Int) (v_z_31 Int) (v_y_44 Int)) (let ((.cse31 (+ v_z_44 v_z_31 .cse29))) (or (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (+ (* 42949672961 v_z_44) (* v_y_44 55834574848)))) (= .cse31 8589934592) (< .cse31 4294967297) (< v_z_31 0) (< 4294967295 v_z_31)))))) (forall ((v_z_44 Int)) (or (< 4294967295 (+ v_z_44 .cse29)) (< v_z_44 0) (forall ((v_z_31 Int) (v_y_31 Int) (v_y_44 Int)) (let ((.cse32 (+ v_z_44 v_z_31 .cse29))) (or (= .cse32 4294967296) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (+ (* 42949672961 v_z_44) (* v_y_44 55834574848)))) (< .cse32 1) (< v_z_31 0) (< 4294967295 v_z_31)))))) (forall ((v_z_44 Int)) (or (forall ((v_z_31 Int) (v_y_31 Int) (v_y_44 Int)) (let ((.cse33 (+ v_z_44 v_z_31 .cse29))) (or (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (+ (* 42949672961 v_z_44) (* v_y_44 55834574848)))) (= .cse33 8589934592) (< .cse33 4294967297) (< v_z_31 0) (< 4294967295 v_z_31)))) (< 4294967295 v_z_44) (< (+ v_z_44 .cse29) 4294967296)))) .cse9)))))) (or (and (or (< 15 c_~n1~0) (let ((.cse35 (* 4294967282 c_~p2~0))) (and (or (forall ((v_~p2~0_129 Int) (v_z_31 Int) (v_y_31 Int)) (let ((.cse34 (+ (mod (+ (* v_~p2~0_129 14) .cse35 c_~p1~0) 4294967296) v_z_31))) (or (< .cse34 1) (< v_z_31 0) (< 4294967295 v_z_31) (= 4294967296 .cse34) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7) (* v_~p2~0_129 13)))))) .cse9) (or (forall ((v_~p2~0_129 Int) (v_z_31 Int) (v_y_31 Int)) (let ((.cse36 (+ (mod (+ (* v_~p2~0_129 14) .cse35 c_~p1~0) 4294967296) v_z_31))) (or (< .cse36 1) (< v_z_31 0) (< 4294967295 v_z_31) (= 4294967296 .cse36) (not (= (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1) (* v_~p2~0_129 15)))))) .cse5)))) (or (= 15 c_~n1~0) (let ((.cse38 (mod (+ (* 4294967281 c_~p2~0) c_~p1~0) 4294967296))) (and (or .cse5 (and (forall ((v_z_31 Int)) (or (forall ((v_z_49 Int) (v_y_49 Int) (v_y_31 Int)) (let ((.cse37 (+ .cse38 v_z_49 v_z_31))) (or (not (= (+ (* 60129542145 v_z_49) (* v_y_49 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (< 4294967295 v_z_49) (< .cse37 4294967297) (< v_z_49 0) (= 8589934592 .cse37)))) (< v_z_31 0) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (forall ((v_z_49 Int) (v_y_49 Int) (v_y_31 Int)) (let ((.cse39 (+ .cse38 v_z_49 v_z_31))) (or (not (= (+ (* 60129542145 v_z_49) (* v_y_49 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (< (+ .cse38 v_z_49) 4294967296) (< 4294967295 v_z_49) (< .cse39 4294967297) (= 8589934592 .cse39)))) (< v_z_31 0) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (< 4294967295 v_z_31) (forall ((v_z_49 Int) (v_y_49 Int) (v_y_31 Int)) (or (not (= (+ (* 60129542145 v_z_49) (* v_y_49 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (< (+ .cse38 v_z_49 v_z_31) 4294967297) (< v_z_49 0) (< 4294967295 (+ .cse38 v_z_49)))))) (forall ((v_z_31 Int)) (or (< v_z_31 0) (< 4294967295 v_z_31) (forall ((v_z_49 Int) (v_y_49 Int) (v_y_31 Int)) (let ((.cse40 (+ .cse38 v_z_49 v_z_31))) (or (< .cse40 1) (not (= (+ (* 60129542145 v_z_49) (* v_y_49 64424509440)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse1))) (= .cse40 4294967296) (< v_z_49 0) (< 4294967295 (+ .cse38 v_z_49))))))))) (or (and (forall ((v_z_31 Int)) (or (forall ((v_z_50 Int) (v_y_50 Int) (v_y_31 Int)) (let ((.cse41 (+ .cse38 v_z_50 v_z_31))) (or (< .cse41 1) (= .cse41 4294967296) (not (= (+ (* v_y_50 55834574848) (* v_z_50 52112269859)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7))) (< v_z_50 0) (< 4294967295 (+ .cse38 v_z_50))))) (< v_z_31 0) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (forall ((v_z_50 Int) (v_y_50 Int) (v_y_31 Int)) (or (< (+ .cse38 v_z_50 v_z_31) 4294967297) (not (= (+ (* v_y_50 55834574848) (* v_z_50 52112269859)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7))) (< v_z_50 0) (< 4294967295 (+ .cse38 v_z_50)))) (< 4294967295 v_z_31))) (forall ((v_z_31 Int)) (or (< v_z_31 0) (< 4294967295 v_z_31) (forall ((v_z_50 Int) (v_y_50 Int) (v_y_31 Int)) (let ((.cse42 (+ .cse38 v_z_50 v_z_31))) (or (< .cse42 4294967297) (= 8589934592 .cse42) (not (= (+ (* v_y_50 55834574848) (* v_z_50 52112269859)) (+ (* v_y_31 4294967296) (* v_z_31 4294967295) .cse7))) (< v_z_50 0) (< 4294967295 v_z_50))))))) .cse9))))) (< c_~n1~0 15))) (= 12 c_~n1~0)))))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0)) is different from false [2025-04-25 04:04:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 04:04:41,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364762955] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 04:04:41,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 04:04:41,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 34] total 101 [2025-04-25 04:04:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253980493] [2025-04-25 04:04:41,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 04:04:41,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-04-25 04:04:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:04:41,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-04-25 04:04:41,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=9298, Unknown=5, NotChecked=198, Total=10302 [2025-04-25 04:04:41,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:04:41,870 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:04:41,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 2.5392156862745097) internal successors, (259), 101 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 04:04:41,870 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:04:41,870 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2025-04-25 04:04:41,870 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:04:41,870 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:04:41,870 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 04:04:41,870 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:05:09,155 WARN L286 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 485 DAG size of output: 20 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-25 04:05:22,157 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-25 04:05:31,126 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-25 04:05:42,393 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-25 04:05:51,075 WARN L286 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 336 DAG size of output: 326 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-25 04:05:54,898 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-25 04:07:26,156 WARN L286 SmtUtils]: Spent 1.47m on a formula simplification. DAG size of input: 365 DAG size of output: 336 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-25 04:07:43,656 WARN L286 SmtUtils]: Spent 7.75s on a formula simplification. DAG size of input: 340 DAG size of output: 321 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-25 04:08:24,734 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 863 DAG size of output: 853 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)