./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/mult-comm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 44c38e66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/mult-comm.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 de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 19:46:46,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 19:46:46,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 19:46:46,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 19:46:46,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 19:46:46,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 19:46:46,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 19:46:46,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 19:46:46,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 19:46:46,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 19:46:46,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 19:46:46,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 19:46:46,274 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 19:46:46,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 19:46:46,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 19:46:46,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 19:46:46,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 19:46:46,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 19:46:46,276 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 19:46:46,276 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 -> de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 [2025-04-24 19:46:46,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 19:46:46,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 19:46:46,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 19:46:46,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 19:46:46,516 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 19:46:46,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/mult-comm.wvr.c [2025-04-24 19:46:47,781 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f7ad79e7a/5a2b6ebb431548d8ba74d956fcdb4490/FLAG5811dcccf [2025-04-24 19:46:48,015 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 19:46:48,016 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-comm.wvr.c [2025-04-24 19:46:48,024 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f7ad79e7a/5a2b6ebb431548d8ba74d956fcdb4490/FLAG5811dcccf [2025-04-24 19:46:49,883 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f7ad79e7a/5a2b6ebb431548d8ba74d956fcdb4490 [2025-04-24 19:46:49,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 19:46:49,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 19:46:49,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 19:46:49,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 19:46:49,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 19:46:49,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 07:46:49" (1/1) ... [2025-04-24 19:46:49,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68cf7013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:49, skipping insertion in model container [2025-04-24 19:46:49,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 07:46:49" (1/1) ... [2025-04-24 19:46:49,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 19:46:50,056 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/mult-comm.wvr.c[1936,1949] [2025-04-24 19:46:50,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 19:46:50,067 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 19:46:50,096 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/mult-comm.wvr.c[1936,1949] [2025-04-24 19:46:50,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 19:46:50,110 INFO L204 MainTranslator]: Completed translation [2025-04-24 19:46:50,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50 WrapperNode [2025-04-24 19:46:50,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 19:46:50,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 19:46:50,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 19:46:50,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 19:46:50,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,135 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2025-04-24 19:46:50,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 19:46:50,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 19:46:50,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 19:46:50,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 19:46:50,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,145 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 19:46:50,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 19:46:50,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 19:46:50,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 19:46:50,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (1/1) ... [2025-04-24 19:46:50,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 19:46:50,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:46:50,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 19:46:50,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 19:46:50,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 19:46:50,203 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 19:46:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 19:46:50,203 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 19:46:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 19:46:50,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 19:46:50,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 19:46:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 19:46:50,204 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 19:46:50,266 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 19:46:50,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 19:46:50,359 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 19:46:50,359 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 19:46:50,429 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 19:46:50,429 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 19:46:50,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 07:46:50 BoogieIcfgContainer [2025-04-24 19:46:50,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 19:46:50,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 19:46:50,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 19:46:50,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 19:46:50,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 07:46:49" (1/3) ... [2025-04-24 19:46:50,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbf3ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 07:46:50, skipping insertion in model container [2025-04-24 19:46:50,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:46:50" (2/3) ... [2025-04-24 19:46:50,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbf3ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 07:46:50, skipping insertion in model container [2025-04-24 19:46:50,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 07:46:50" (3/3) ... [2025-04-24 19:46:50,436 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2025-04-24 19:46:50,445 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 19:46:50,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 17 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-24 19:46:50,447 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 19:46:50,491 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-24 19:46:50,516 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:46:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 19:46:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:46:50,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-24 19:46:50,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-24 19:46:50,565 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:46:50,579 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:46:50,586 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;@19670ae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:46:50,586 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-24 19:46:50,705 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:46:50,705 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:46:50,706 INFO L139 ounterexampleChecker]: Examining path program with hash -469606641, occurence #1 [2025-04-24 19:46:50,706 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:46:50,706 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:46:50,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:46:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash -211985893, now seen corresponding path program 1 times [2025-04-24 19:46:50,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:46:50,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103517773] [2025-04-24 19:46:50,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:46:50,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:46:50,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-24 19:46:50,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-24 19:46:50,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:46:50,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:46:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:46:51,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:46:51,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103517773] [2025-04-24 19:46:51,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103517773] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:46:51,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:46:51,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 19:46:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296060237] [2025-04-24 19:46:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:46:51,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 19:46:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:46:51,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 19:46:51,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-24 19:46:51,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:46:51,357 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:46:51,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:46:51,358 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:46:51,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 19:46:51,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 19:46:51,449 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:46:51,449 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:46:51,449 INFO L139 ounterexampleChecker]: Examining path program with hash -469606641, occurence #2 [2025-04-24 19:46:51,449 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 19:46:51,449 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 19:46:51,463 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:46:51,464 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 19:46:51,464 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:46:51,464 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-24 19:46:51,465 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:46:51,465 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 19:46:51,465 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:46:51,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:46:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash -341022696, now seen corresponding path program 1 times [2025-04-24 19:46:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:46:51,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011803751] [2025-04-24 19:46:51,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:46:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:46:51,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-24 19:46:51,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-24 19:46:51,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:46:51,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:46:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:46:52,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:46:52,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011803751] [2025-04-24 19:46:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011803751] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 19:46:52,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894435105] [2025-04-24 19:46:52,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:46:52,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:46:52,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:46:52,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 19:46:52,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 19:46:52,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-24 19:46:52,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-24 19:46:52,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:46:52,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:46:52,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-24 19:46:52,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 19:46:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:46:52,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 19:46:57,284 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296))) (let ((.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse0 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1)) (.cse4 (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse1)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (and (forall ((v_z_5 Int)) (or (< v_z_5 .cse0) (< (mod (+ (* 2 v_z_5) c_~x_1~0) 4294967296) (+ 2 .cse1 .cse2)) (< .cse3 v_z_5))) (forall ((v_z_5 Int)) (let ((.cse5 (mod (+ (* 2 v_z_5) c_~x_1~0) 4294967296))) (or (< .cse4 (+ .cse5 1)) (< v_z_5 .cse0) (< .cse3 v_z_5) (< (+ .cse5 4294967294) (+ .cse1 .cse2))))) (forall ((v_z_5 Int)) (or (< v_z_5 .cse0) (< .cse4 (+ (mod (+ (* 2 v_z_5) c_~x_1~0) 4294967296) 4294967297)) (< .cse3 v_z_5)))))) is different from false [2025-04-24 19:46:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-04-24 19:46:57,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894435105] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 19:46:57,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 19:46:57,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2025-04-24 19:46:57,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868559788] [2025-04-24 19:46:57,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 19:46:57,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-24 19:46:57,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:46:57,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-24 19:46:57,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=301, Unknown=1, NotChecked=36, Total=420 [2025-04-24 19:46:57,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:46:57,514 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:46:57,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:46:57,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 19:46:57,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:46:58,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 19:46:58,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-24 19:46:58,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-24 19:46:58,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-24 19:46:58,585 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:46:58,586 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:46:58,586 INFO L139 ounterexampleChecker]: Examining path program with hash -469606641, occurence #3 [2025-04-24 19:46:58,586 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 19:46:58,586 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 19:46:58,586 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:46:58,586 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 19:46:58,586 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:46:58,586 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-24 19:46:58,586 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:46:58,586 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 19:46:58,586 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:46:58,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:46:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash 173912658, now seen corresponding path program 2 times [2025-04-24 19:46:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:46:58,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269599851] [2025-04-24 19:46:58,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:46:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:46:58,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-24 19:46:58,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-24 19:46:58,633 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 19:46:58,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:46:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:46:59,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:46:59,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269599851] [2025-04-24 19:46:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269599851] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 19:46:59,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432547251] [2025-04-24 19:46:59,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:46:59,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:46:59,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:46:59,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 19:46:59,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 19:46:59,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-24 19:46:59,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-24 19:46:59,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 19:46:59,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:46:59,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-24 19:46:59,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 19:47:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:47:00,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 19:47:13,910 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse5 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)) (.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse2 (+ v_z_10 .cse6))) (or (< .cse0 .cse1) (< .cse2 4294967296) (< .cse3 .cse0) (< 4294967295 v_z_10) (< .cse4 v_z_14) (< v_z_14 .cse5) (= .cse2 (+ (mod (+ (* v_z_14 4) c_~x_1~0) 4294967296) 4294967296))))) (forall ((v_z_15 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse7 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse8 (+ v_z_10 .cse6))) (or (< .cse7 .cse1) (= (mod (+ c_~x_1~0 (* v_z_15 4)) 4294967296) .cse8) (< v_z_10 0) (< .cse3 .cse7) (< 4294967295 .cse8) (< .cse4 v_z_15) (< v_z_15 .cse5)))) (forall ((v_z_17 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse11 (+ v_z_10 .cse6)) (.cse10 (mod (+ (* v_z_17 4) c_~x_1~0) 4294967296))) (or (< .cse9 .cse1) (< v_z_10 0) (< .cse3 .cse9) (< 4294967295 v_z_10) (= (+ .cse10 4294967296) .cse11) (< v_z_17 .cse5) (= .cse11 .cse10) (< .cse4 v_z_17)))))) is different from false [2025-04-24 19:47:18,145 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse8 (+ .cse4 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse3 (+ v_z_10 .cse5))) (or (< .cse0 .cse1) (< v_z_10 0) (< .cse2 .cse0) (< 4294967295 .cse3) (= .cse4 .cse3)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse6 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse7 (+ v_z_10 .cse5))) (or (< .cse6 .cse1) (< v_z_10 0) (< .cse2 .cse6) (= .cse7 .cse8) (< 4294967295 v_z_10) (= .cse4 .cse7)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse10 (+ v_z_10 .cse5))) (or (< .cse9 .cse1) (< .cse10 4294967296) (< .cse2 .cse9) (= .cse10 .cse8) (< 4294967295 v_z_10))))))) is different from false [2025-04-24 19:47:22,371 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse4 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ v_z_10 .cse2))) (or (< v_z_10 0) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (< 4294967295 .cse0) (= .cse1 .cse0)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse3 (+ v_z_10 .cse2))) (or (< v_z_10 0) (= .cse3 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (= .cse1 .cse3)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse5 (+ v_z_10 .cse2))) (or (< .cse5 4294967296) (= .cse5 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)))))))) is different from false [2025-04-24 19:47:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-24 19:47:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432547251] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 19:47:22,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 19:47:22,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2025-04-24 19:47:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15984984] [2025-04-24 19:47:22,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 19:47:22,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-24 19:47:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:47:22,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-24 19:47:22,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=727, Unknown=5, NotChecked=174, Total=1056 [2025-04-24 19:47:22,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:47:22,423 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:47:22,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 32 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:47:22,423 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 19:47:22,423 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-24 19:47:22,423 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:47:26,572 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse4 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ v_z_10 .cse2))) (or (< v_z_10 0) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (< 4294967295 .cse0) (= .cse1 .cse0)))) (= c_~x_2~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse3 (+ v_z_10 .cse2))) (or (< v_z_10 0) (= .cse3 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (= .cse1 .cse3)))) (= c_~x_1~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse5 (+ v_z_10 .cse2))) (or (< .cse5 4294967296) (= .cse5 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)))))))) is different from false [2025-04-24 19:47:30,796 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse8 (+ .cse4 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse3 (+ v_z_10 .cse5))) (or (< .cse0 .cse1) (< v_z_10 0) (< .cse2 .cse0) (< 4294967295 .cse3) (= .cse4 .cse3)))) (= c_~x_2~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse6 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse7 (+ v_z_10 .cse5))) (or (< .cse6 .cse1) (< v_z_10 0) (< .cse2 .cse6) (= .cse7 .cse8) (< 4294967295 v_z_10) (= .cse4 .cse7)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse10 (+ v_z_10 .cse5))) (or (< .cse9 .cse1) (< .cse10 4294967296) (< .cse2 .cse9) (= .cse10 .cse8) (< 4294967295 v_z_10))))))) is different from false [2025-04-24 19:47:34,824 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse5 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)) (.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse2 (+ v_z_10 .cse6))) (or (< .cse0 .cse1) (< .cse2 4294967296) (< .cse3 .cse0) (< 4294967295 v_z_10) (< .cse4 v_z_14) (< v_z_14 .cse5) (= .cse2 (+ (mod (+ (* v_z_14 4) c_~x_1~0) 4294967296) 4294967296))))) (= c_~x_2~0 0) (forall ((v_z_15 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse7 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse8 (+ v_z_10 .cse6))) (or (< .cse7 .cse1) (= (mod (+ c_~x_1~0 (* v_z_15 4)) 4294967296) .cse8) (< v_z_10 0) (< .cse3 .cse7) (< 4294967295 .cse8) (< .cse4 v_z_15) (< v_z_15 .cse5)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0) (forall ((v_z_17 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse11 (+ v_z_10 .cse6)) (.cse10 (mod (+ (* v_z_17 4) c_~x_1~0) 4294967296))) (or (< .cse9 .cse1) (< v_z_10 0) (< .cse3 .cse9) (< 4294967295 v_z_10) (= (+ .cse10 4294967296) .cse11) (< v_z_17 .cse5) (= .cse11 .cse10) (< .cse4 v_z_17)))))) is different from false [2025-04-24 19:48:27,467 WARN L286 SmtUtils]: Spent 36.09s on a formula simplification. DAG size of input: 57 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:48:31,536 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-24 19:48:36,761 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-24 19:48:43,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 19:48:43,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-24 19:48:43,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-24 19:48:43,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-24 19:48:43,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:48:43,349 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:48:43,349 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:48:43,350 INFO L139 ounterexampleChecker]: Examining path program with hash -469606641, occurence #4 [2025-04-24 19:48:43,350 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 19:48:43,350 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 19:48:43,350 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:48:43,350 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 19:48:43,350 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:48:43,350 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-24 19:48:43,350 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:48:43,350 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 19:48:43,350 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:48:43,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:48:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1143750714, now seen corresponding path program 3 times [2025-04-24 19:48:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:48:43,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576869318] [2025-04-24 19:48:43,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 19:48:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:48:43,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 8 equivalence classes. [2025-04-24 19:48:43,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 19:48:43,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-04-24 19:48:43,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:48:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:48:44,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:48:44,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576869318] [2025-04-24 19:48:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576869318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 19:48:44,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441830009] [2025-04-24 19:48:44,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 19:48:44,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:48:44,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:48:44,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 19:48:44,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 19:48:44,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 8 equivalence classes. [2025-04-24 19:48:44,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 19:48:44,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-04-24 19:48:44,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:48:44,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-04-24 19:48:44,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 19:48:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:48:45,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 19:50:04,118 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse7 (+ .cse0 4294967296)) (.cse2 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse3 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse1 (+ v_z_22 .cse5))) (or (= .cse0 .cse1) (< v_z_22 0) (< .cse2 .cse3) (< .cse3 .cse4) (< 4294967295 .cse1)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse6 (+ v_z_22 .cse5)) (.cse8 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse0 .cse6) (= .cse7 .cse6) (< 4294967295 v_z_22) (< v_z_22 0) (< .cse2 .cse8) (< .cse8 .cse4)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse9 (+ v_z_22 .cse5)) (.cse10 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse7 .cse9) (< 4294967295 v_z_22) (< .cse9 4294967296) (< .cse2 .cse10) (< .cse10 .cse4))))))) is different from false [2025-04-24 19:50:08,311 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse2 (+ .cse0 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse1 (+ v_z_22 .cse3))) (or (= .cse0 .cse1) (= .cse2 .cse1) (< 4294967295 v_z_22) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse4 (+ v_z_22 .cse3))) (or (= .cse0 .cse4) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0) (< 4294967295 .cse4)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse5 (+ v_z_22 .cse3))) (or (= .cse2 .cse5) (< 4294967295 v_z_22) (< .cse5 4294967296) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)))))))) is different from false [2025-04-24 19:50:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:50:08,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441830009] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 19:50:08,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 19:50:08,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 57 [2025-04-24 19:50:08,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450447291] [2025-04-24 19:50:08,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 19:50:08,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-24 19:50:08,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:50:08,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-24 19:50:08,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=2711, Unknown=9, NotChecked=218, Total=3306 [2025-04-24 19:50:08,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:50:08,359 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:50:08,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 57 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:50:08,359 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 19:50:08,359 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-24 19:50:08,360 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2025-04-24 19:50:08,360 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:50:12,603 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse2 (+ .cse0 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse1 (+ v_z_22 .cse3))) (or (= .cse0 .cse1) (= .cse2 .cse1) (< 4294967295 v_z_22) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse4 (+ v_z_22 .cse3))) (or (= .cse0 .cse4) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0) (< 4294967295 .cse4)))) (= c_~x_2~0 0) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse5 (+ v_z_22 .cse3))) (or (= .cse2 .cse5) (< 4294967295 v_z_22) (< .cse5 4294967296) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8))))) (= c_~x_1~0 0)))) is different from false [2025-04-24 19:50:16,768 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse7 (+ .cse0 4294967296)) (.cse2 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse3 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse1 (+ v_z_22 .cse5))) (or (= .cse0 .cse1) (< v_z_22 0) (< .cse2 .cse3) (< .cse3 .cse4) (< 4294967295 .cse1)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse6 (+ v_z_22 .cse5)) (.cse8 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse0 .cse6) (= .cse7 .cse6) (< 4294967295 v_z_22) (< v_z_22 0) (< .cse2 .cse8) (< .cse8 .cse4)))) (= c_~x_1~0 0) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse9 (+ v_z_22 .cse5)) (.cse10 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse7 .cse9) (< 4294967295 v_z_22) (< .cse9 4294967296) (< .cse2 .cse10) (< .cse10 .cse4))))))) is different from false [2025-04-24 19:50:20,976 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296) 1)) (.cse7 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse2 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_23 Int)) (or (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse0 (mod (+ c_~x_1~0 (* v_z_23 8)) 4294967296)) (.cse1 (+ v_z_22 .cse5)) (.cse3 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (< 4294967295 v_z_22) (= .cse0 .cse1) (< v_z_22 0) (= (+ 4294967296 .cse0) .cse1) (< .cse2 .cse3) (< .cse3 .cse4)))) (< v_z_23 .cse6) (< .cse7 v_z_23))) (= c_~x_2~0 0) (forall ((v_z_23 Int)) (or (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse8 (+ v_z_22 .cse5)) (.cse9 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (< 4294967295 v_z_22) (< .cse8 4294967296) (= (+ 4294967296 (mod (+ c_~x_1~0 (* v_z_23 8)) 4294967296)) .cse8) (< .cse2 .cse9) (< .cse9 .cse4)))) (< v_z_23 .cse6) (< .cse7 v_z_23))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0) (forall ((v_z_23 Int)) (or (< v_z_23 .cse6) (< .cse7 v_z_23) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse11 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse10 (+ v_z_22 .cse5))) (or (= (mod (+ c_~x_1~0 (* v_z_23 8)) 4294967296) .cse10) (< v_z_22 0) (< .cse2 .cse11) (< .cse11 .cse4) (< 4294967295 .cse10)))))))) is different from false [2025-04-24 19:50:25,006 WARN L849 $PredicateComparison]: unable to prove that (and (= c_~x_1~0 c_~a~0) (let ((.cse0 (mod c_~a~0 4294967296))) (or (< (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse0) (let ((.cse8 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296))) (let ((.cse2 (+ .cse8 4294967296)) (.cse3 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (+ (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse1 (+ v_z_22 .cse6)) (.cse4 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (< 4294967295 v_z_22) (< .cse1 4294967296) (= .cse2 .cse1) (< .cse3 .cse4) (< .cse4 .cse5)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse7 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse9 (+ v_z_22 .cse6))) (or (< v_z_22 0) (< .cse3 .cse7) (< .cse7 .cse5) (= .cse8 .cse9) (< 4294967295 .cse9)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse11 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse10 (+ v_z_22 .cse6))) (or (< 4294967295 v_z_22) (= .cse2 .cse10) (< v_z_22 0) (< .cse3 .cse11) (< .cse11 .cse5) (= .cse8 .cse10))))))) (< .cse0 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296) 1)))) (= c_~x_2~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1)) is different from false [2025-04-24 19:50:33,138 WARN L286 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:50:43,028 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:50:53,696 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:50:55,188 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:51:50,038 WARN L286 SmtUtils]: Spent 33.35s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-24 19:51:54,596 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 [] [2025-04-24 19:51:58,602 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:52:02,157 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:52:15,399 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 [] [2025-04-24 19:52:19,509 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 [] [2025-04-24 19:52:24,186 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:52:28,849 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 [] [2025-04-24 19:52:37,064 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:52:38,878 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:52:42,722 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-24 19:52:44,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 19:52:44,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-24 19:52:44,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-24 19:52:44,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-24 19:52:44,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-24 19:52:44,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:52:44,458 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:52:44,458 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:52:44,458 INFO L139 ounterexampleChecker]: Examining path program with hash -469606641, occurence #5 [2025-04-24 19:52:44,458 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 19:52:44,458 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 19:52:44,458 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:52:44,458 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 19:52:44,458 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:52:44,458 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-04-24 19:52:44,458 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 19:52:44,458 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 19:52:44,458 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:52:44,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:52:44,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1923333806, now seen corresponding path program 4 times [2025-04-24 19:52:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:52:44,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232285895] [2025-04-24 19:52:44,459 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 19:52:44,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:52:44,464 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-24 19:52:44,521 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-24 19:52:44,521 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 19:52:44,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:52:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:52:47,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:52:47,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232285895] [2025-04-24 19:52:47,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232285895] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 19:52:47,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188769058] [2025-04-24 19:52:47,457 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 19:52:47,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 19:52:47,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:52:47,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 19:52:47,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-24 19:52:47,488 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-24 19:52:47,612 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-24 19:52:47,612 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 19:52:47,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:52:47,614 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-04-24 19:52:47,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 19:52:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:52:50,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 19:53:40,192 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) 1)) (.cse1 (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296)) (.cse5 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse6 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_35 Int) (v_z_28 Int) (v_y_28 Int)) (let ((.cse2 (+ v_z_28 .cse7)) (.cse3 (mod (+ (* v_z_35 16) c_~x_1~0) 4294967296)) (.cse4 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< v_z_35 .cse0) (< v_z_28 0) (< .cse1 v_z_35) (= .cse2 .cse3) (= .cse2 (+ .cse3 4294967296)) (< .cse4 .cse5) (< .cse6 .cse4) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int) (v_z_33 Int)) (let ((.cse9 (+ v_z_28 .cse7)) (.cse8 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< .cse1 v_z_33) (< v_z_33 .cse0) (< .cse8 .cse5) (= .cse9 (+ 4294967296 (mod (+ c_~x_1~0 (* v_z_33 16)) 4294967296))) (< .cse9 4294967296) (< .cse6 .cse8) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int) (v_z_32 Int)) (let ((.cse10 (+ v_z_28 .cse7)) (.cse11 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< v_z_28 0) (< v_z_32 .cse0) (< .cse1 v_z_32) (= .cse10 (mod (+ (* v_z_32 16) c_~x_1~0) 4294967296)) (< 4294967295 .cse10) (< .cse11 .cse5) (< .cse6 .cse11)))))) is different from false [2025-04-24 19:53:44,383 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse4 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse5 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse6)) (.cse3 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse0 .cse1) (< v_z_28 0) (= .cse2 .cse0) (< .cse3 .cse4) (< .cse5 .cse3) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse7 (+ v_z_28 .cse6)) (.cse8 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse7 .cse1) (< v_z_28 0) (< 4294967295 .cse7) (< .cse8 .cse4) (< .cse5 .cse8)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse9 (+ v_z_28 .cse6)) (.cse10 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse2 .cse9) (< .cse10 .cse4) (< .cse9 4294967296) (< .cse5 .cse10) (< 4294967295 v_z_28))))))) is different from false [2025-04-24 19:53:48,764 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse3))) (or (= .cse0 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse0) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse4 (+ v_z_28 .cse3))) (or (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse4) (< .cse4 4294967296) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse5 (+ v_z_28 .cse3))) (or (= .cse5 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (< 4294967295 .cse5))))))) is different from false [2025-04-24 19:53:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2025-04-24 19:53:48,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188769058] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 19:53:48,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 19:53:48,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 104 [2025-04-24 19:53:48,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388259694] [2025-04-24 19:53:48,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 19:53:48,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2025-04-24 19:53:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:53:48,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2025-04-24 19:53:48,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1952, Invalid=8357, Unknown=5, NotChecked=606, Total=10920 [2025-04-24 19:53:48,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:48,821 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:53:48,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:53:48,821 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 19:53:48,821 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-24 19:53:48,821 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2025-04-24 19:53:48,821 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2025-04-24 19:53:48,821 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:53:52,942 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse3))) (or (= .cse0 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse0) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse4 (+ v_z_28 .cse3))) (or (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse4) (< .cse4 4294967296) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse5 (+ v_z_28 .cse3))) (or (= .cse5 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (< 4294967295 .cse5)))) (= c_~x_1~0 0)))) is different from false [2025-04-24 19:53:57,157 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse4 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse5 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse6)) (.cse3 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse0 .cse1) (< v_z_28 0) (= .cse2 .cse0) (< .cse3 .cse4) (< .cse5 .cse3) (< 4294967295 v_z_28)))) (= c_~x_2~0 0) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse7 (+ v_z_28 .cse6)) (.cse8 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse7 .cse1) (< v_z_28 0) (< 4294967295 .cse7) (< .cse8 .cse4) (< .cse5 .cse8)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse9 (+ v_z_28 .cse6)) (.cse10 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse2 .cse9) (< .cse10 .cse4) (< .cse9 4294967296) (< .cse5 .cse10) (< 4294967295 v_z_28))))))) is different from false [2025-04-24 19:54:01,192 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) 1)) (.cse1 (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296)) (.cse5 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse6 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (forall ((v_z_35 Int) (v_z_28 Int) (v_y_28 Int)) (let ((.cse2 (+ v_z_28 .cse7)) (.cse3 (mod (+ (* v_z_35 16) c_~x_1~0) 4294967296)) (.cse4 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< v_z_35 .cse0) (< v_z_28 0) (< .cse1 v_z_35) (= .cse2 .cse3) (= .cse2 (+ .cse3 4294967296)) (< .cse4 .cse5) (< .cse6 .cse4) (< 4294967295 v_z_28)))) (= c_~x_1~0 0) (forall ((v_z_28 Int) (v_y_28 Int) (v_z_33 Int)) (let ((.cse9 (+ v_z_28 .cse7)) (.cse8 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< .cse1 v_z_33) (< v_z_33 .cse0) (< .cse8 .cse5) (= .cse9 (+ 4294967296 (mod (+ c_~x_1~0 (* v_z_33 16)) 4294967296))) (< .cse9 4294967296) (< .cse6 .cse8) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int) (v_z_32 Int)) (let ((.cse10 (+ v_z_28 .cse7)) (.cse11 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< v_z_28 0) (< v_z_32 .cse0) (< .cse1 v_z_32) (= .cse10 (mod (+ (* v_z_32 16) c_~x_1~0) 4294967296)) (< 4294967295 .cse10) (< .cse11 .cse5) (< .cse6 .cse11)))))) is different from false [2025-04-24 19:54:05,225 WARN L849 $PredicateComparison]: unable to prove that (and (= c_~x_1~0 c_~a~0) (= c_~x_2~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1) (let ((.cse0 (mod c_~a~0 4294967296))) (or (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296) .cse0) (let ((.cse4 (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296))) (let ((.cse1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse9 (+ .cse4 4294967296)) (.cse5 (+ (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse2 (+ (* v_z_28 4008636143) (* v_y_28 4294967296))) (.cse3 (+ v_z_28 .cse6))) (or (< .cse1 .cse2) (< v_z_28 0) (= .cse3 .cse4) (< .cse2 .cse5) (< 4294967295 .cse3)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse8 (+ v_z_28 .cse6)) (.cse7 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< .cse1 .cse7) (< v_z_28 0) (= .cse8 .cse4) (= .cse8 .cse9) (< .cse7 .cse5) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse10 (+ (* v_z_28 4008636143) (* v_y_28 4294967296))) (.cse11 (+ v_z_28 .cse6))) (or (< .cse1 .cse10) (= .cse11 .cse9) (< .cse10 .cse5) (< .cse11 4294967296) (< 4294967295 v_z_28))))))) (< .cse0 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) 1))))) is different from false [2025-04-24 19:54:09,876 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse89 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse94 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse92 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse97 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse98 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse96 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse91 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse100 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse95 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse90 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse93 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse88 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse99 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse42 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse103 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse106 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse112 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse101 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse102 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse111 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse110 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse104 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse105 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse109 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse108 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse113 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse41 (mod c_~b~0 4294967296)) (.cse33 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse107 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse34 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse107 .cse34)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse28 (< .cse34 (+ .cse33 1))) (.cse26 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (.cse27 (< .cse41 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse29 (< .cse113 .cse41)) (.cse36 (< .cse34 (+ .cse108 1))) (.cse38 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse34)) (.cse40 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse109 .cse34)) (.cse5 (< .cse34 (+ .cse105 1))) (.cse0 (< .cse41 (+ .cse104 1))) (.cse1 (< .cse110 .cse41)) (.cse4 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (.cse6 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (.cse8 (< .cse41 (+ .cse111 1))) (.cse11 (< .cse102 .cse41)) (.cse9 (< .cse101 .cse34)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse34 (+ .cse112 1))) (.cse30 (< .cse41 (+ .cse113 1))) (.cse31 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse32 (< .cse106 .cse41)) (.cse52 (< .cse112 .cse34)) (.cse53 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse65 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse64 (< .cse111 .cse41)) (.cse66 (< .cse41 (+ .cse110 1))) (.cse54 (< .cse34 (+ .cse109 1))) (.cse35 (< .cse41 (+ .cse103 1))) (.cse37 (< .cse42 .cse41)) (.cse58 (< .cse108 .cse34)) (.cse39 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse57 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse59 (< .cse34 (+ .cse99 1))) (.cse43 (< .cse41 (+ .cse88 1))) (.cse47 (< .cse93 .cse41)) (.cse44 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse76 (< .cse34 (+ .cse90 1))) (.cse77 (< .cse95 .cse34)) (.cse78 (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296)) (.cse73 (< .cse34 (+ .cse107 1))) (.cse49 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse75 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse50 (< .cse41 (+ .cse106 1))) (.cse74 (< .cse105 .cse34)) (.cse51 (< .cse104 .cse41)) (.cse55 (< .cse103 .cse41)) (.cse56 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse60 (< .cse41 (+ .cse100 1))) (.cse67 (< .cse91 .cse41)) (.cse62 (< .cse96 .cse34)) (.cse68 (< .cse41 (+ .cse102 1))) (.cse63 (< .cse34 (+ .cse101 1))) (.cse61 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296)) (.cse70 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (.cse12 (< .cse41 (+ .cse98 1))) (.cse82 (< .cse34 (+ .cse97 1))) (.cse83 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse100 .cse41)) (.cse84 (< .cse99 .cse34)) (.cse19 (< .cse98 .cse41)) (.cse13 (< .cse97 .cse34)) (.cse23 (< .cse41 (+ .cse92 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse34 (+ .cse94 1))) (.cse69 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse71 (< .cse89 .cse34)) (.cse72 (< .cse34 (+ .cse96 1))) (.cse18 (< .cse34 (+ .cse95 1))) (.cse20 (< .cse94 .cse34)) (.cse79 (< .cse41 (+ .cse93 1))) (.cse80 (< .cse92 .cse41)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse81 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296)) (.cse45 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse86 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse85 (< .cse41 (+ .cse91 1))) (.cse46 (< .cse90 .cse34)) (.cse48 (< .cse34 (+ .cse89 1))) (.cse87 (< .cse88 .cse41))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 (= .cse14 .cse15) .cse16 .cse17) (or .cse18 .cse19 .cse20 (= .cse21 .cse22) .cse23) (or .cse24 (= .cse25 .cse26) .cse27 .cse28 .cse29) (or .cse24 .cse30 (= .cse25 .cse31) .cse28 .cse32) (or (= (mod c_~x_2~0 4294967296) .cse26) (< .cse33 .cse34) .cse27 .cse29) (or .cse35 .cse36 .cse37 .cse38 (= .cse39 .cse40)) (or (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse41) .cse36 (< .cse41 (+ .cse42 1)) .cse38 (= (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296) .cse40)) (or .cse43 (= .cse44 .cse45) .cse46 .cse47 .cse48) (or (= .cse49 .cse3) .cse50 .cse2 .cse51 .cse5) (or .cse0 .cse1 .cse52 (= .cse53 .cse4) .cse54) (or .cse55 (= .cse56 .cse57) .cse58 .cse59 .cse60) (or (= .cse61 .cse6) .cse62 .cse63 .cse8 .cse11) (or .cse9 .cse64 (= .cse65 .cse7) .cse66 .cse10) (or .cse67 .cse68 (= .cse69 .cse70) .cse71 .cse72) (or .cse73 .cse30 .cse74 (= .cse75 .cse31) .cse32) (or .cse52 (= .cse53 .cse65) .cse64 .cse66 .cse54) (or .cse35 .cse37 .cse58 (= .cse39 .cse57) .cse59) (or .cse43 .cse76 .cse77 .cse47 (= .cse78 .cse44)) (or .cse76 .cse79 .cse77 .cse80 (= .cse78 .cse81)) (or .cse73 (= .cse49 .cse75) .cse50 .cse74 .cse51) (or .cse55 .cse82 (= .cse83 .cse56) .cse84 .cse60) (or .cse67 .cse62 .cse68 .cse63 (= .cse61 .cse70)) (or .cse12 .cse82 (= .cse83 .cse15) .cse16 .cse84) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (or .cse85 (= .cse86 .cse69) .cse71 .cse72 .cse87) (or .cse18 .cse20 .cse79 .cse80 (= .cse21 .cse81)) (or (= .cse45 .cse86) .cse85 .cse46 .cse48 .cse87)))) is different from false