./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 b03bd7cf Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.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.2.5-dev-b03bd7c-m [2024-10-28 19:24:22,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-28 19:24:22,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-28 19:24:22,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-28 19:24:22,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-28 19:24:22,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-28 19:24:22,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-28 19:24:22,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-28 19:24:22,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-28 19:24:22,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-28 19:24:22,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-28 19:24:22,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-28 19:24:22,487 INFO L153 SettingsManager]: * Use SBE=true [2024-10-28 19:24:22,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-28 19:24:22,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-28 19:24:22,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-28 19:24:22,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-28 19:24:22,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-28 19:24:22,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-28 19:24:22,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-28 19:24:22,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-28 19:24:22,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-28 19:24:22,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-28 19:24:22,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-28 19:24:22,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-28 19:24:22,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-28 19:24:22,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-28 19:24:22,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-28 19:24:22,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-28 19:24:22,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-28 19:24:22,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 19:24:22,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-28 19:24:22,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-28 19:24:22,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-28 19:24:22,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-28 19:24:22,498 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-28 19:24:22,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-28 19:24:22,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-28 19:24:22,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-28 19:24:22,500 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-28 19:24:22,500 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-28 19:24:22,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-28 19:24:22,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-28 19:24:22,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-28 19:24:22,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-28 19:24:22,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-28 19:24:22,764 INFO L274 PluginConnector]: CDTParser initialized [2024-10-28 19:24:22,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/mult-comm.wvr.c [2024-10-28 19:24:24,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-28 19:24:24,333 INFO L384 CDTParser]: Found 1 translation units. [2024-10-28 19:24:24,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-comm.wvr.c [2024-10-28 19:24:24,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a08edce36/3dea2dc9e7ef4a4bbb6241f63e71cdb1/FLAGf1a86adcf [2024-10-28 19:24:24,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a08edce36/3dea2dc9e7ef4a4bbb6241f63e71cdb1 [2024-10-28 19:24:24,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-28 19:24:24,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-28 19:24:24,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-28 19:24:24,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-28 19:24:24,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-28 19:24:24,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc45c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24, skipping insertion in model container [2024-10-28 19:24:24,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-28 19:24:24,569 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-comm.wvr.c[1936,1949] [2024-10-28 19:24:24,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 19:24:24,581 INFO L200 MainTranslator]: Completed pre-run [2024-10-28 19:24:24,596 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-comm.wvr.c[1936,1949] [2024-10-28 19:24:24,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 19:24:24,610 INFO L204 MainTranslator]: Completed translation [2024-10-28 19:24:24,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24 WrapperNode [2024-10-28 19:24:24,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-28 19:24:24,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-28 19:24:24,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-28 19:24:24,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-28 19:24:24,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,641 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-10-28 19:24:24,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-28 19:24:24,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-28 19:24:24,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-28 19:24:24,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-28 19:24:24,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-28 19:24:24,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-28 19:24:24,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-28 19:24:24,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-28 19:24:24,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (1/1) ... [2024-10-28 19:24:24,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 19:24:24,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 19:24:24,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-28 19:24:24,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-28 19:24:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-28 19:24:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-28 19:24:24,746 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-28 19:24:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-28 19:24:24,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-28 19:24:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-28 19:24:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-28 19:24:24,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-28 19:24:24,748 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-28 19:24:24,845 INFO L238 CfgBuilder]: Building ICFG [2024-10-28 19:24:24,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-28 19:24:24,995 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-28 19:24:24,995 INFO L287 CfgBuilder]: Performing block encoding [2024-10-28 19:24:25,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-28 19:24:25,116 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-28 19:24:25,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 07:24:25 BoogieIcfgContainer [2024-10-28 19:24:25,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-28 19:24:25,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-28 19:24:25,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-28 19:24:25,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-28 19:24:25,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 07:24:24" (1/3) ... [2024-10-28 19:24:25,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1110745b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 07:24:25, skipping insertion in model container [2024-10-28 19:24:25,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:24:24" (2/3) ... [2024-10-28 19:24:25,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1110745b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 07:24:25, skipping insertion in model container [2024-10-28 19:24:25,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 07:24:25" (3/3) ... [2024-10-28 19:24:25,126 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2024-10-28 19:24:25,139 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-28 19:24:25,139 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-28 19:24:25,140 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-28 19:24:25,196 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-28 19:24:25,256 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 19:24:25,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-28 19:24:25,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 19:24:25,261 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) [2024-10-28 19:24:25,262 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 [2024-10-28 19:24:25,291 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 19:24:25,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 19:24:25,313 INFO L333 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;@4a04297c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 19:24:25,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-28 19:24:25,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:24:25,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:24:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash -495857447, now seen corresponding path program 1 times [2024-10-28 19:24:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:24:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543039387] [2024-10-28 19:24:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:24:25,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:24:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:24:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:24:26,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 19:24:26,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543039387] [2024-10-28 19:24:26,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543039387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 19:24:26,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522588763] [2024-10-28 19:24:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:24:26,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 19:24:26,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 19:24:26,476 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) [2024-10-28 19:24:26,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-28 19:24:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:24:26,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-28 19:24:26,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 19:24:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:24:26,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 19:24:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:24:27,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522588763] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 19:24:27,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 19:24:27,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2024-10-28 19:24:27,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557220813] [2024-10-28 19:24:27,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 19:24:27,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 19:24:27,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 19:24:27,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 19:24:27,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-10-28 19:24:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:24:27,050 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 19:24:27,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 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) [2024-10-28 19:24:27,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:24:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 19:24:27,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-28 19:24:27,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-28 19:24:27,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:24:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:24:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1736321302, now seen corresponding path program 1 times [2024-10-28 19:24:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:24:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686257909] [2024-10-28 19:24:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:24:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:24:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:24:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:24:28,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 19:24:28,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686257909] [2024-10-28 19:24:28,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686257909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 19:24:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902493861] [2024-10-28 19:24:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:24:28,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 19:24:28,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 19:24:28,601 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) [2024-10-28 19:24:28,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-28 19:24:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:24:28,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-28 19:24:28,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 19:24:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:24:29,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 19:24:31,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296))) (let ((.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse5 (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse1)) (.cse4 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1))) (and (forall ((v_z_10 Int)) (let ((.cse0 (mod (+ (* v_z_10 2) c_~x_1~0) 4294967296))) (or (< (+ .cse0 4294967294) (+ .cse1 .cse2)) (< .cse3 v_z_10) (< v_z_10 .cse4) (< .cse5 (+ .cse0 1))))) (forall ((v_z_10 Int)) (or (< (mod (+ (* v_z_10 2) c_~x_1~0) 4294967296) (+ 2 .cse1 .cse2)) (< .cse3 v_z_10) (< v_z_10 .cse4))) (forall ((v_z_10 Int)) (or (< .cse3 v_z_10) (< .cse5 (+ (mod (+ (* v_z_10 2) c_~x_1~0) 4294967296) 4294967297)) (< v_z_10 .cse4)))))) is different from false [2024-10-28 19:24:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-28 19:24:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902493861] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 19:24:32,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 19:24:32,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2024-10-28 19:24:32,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226102900] [2024-10-28 19:24:32,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 19:24:32,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-28 19:24:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 19:24:32,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-28 19:24:32,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=301, Unknown=1, NotChecked=36, Total=420 [2024-10-28 19:24:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:24:32,023 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 19:24:32,024 INFO L472 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) [2024-10-28 19:24:32,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 19:24:32,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:24:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 19:24:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 19:24:33,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-28 19:24:33,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 19:24:33,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:24:33,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:24:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash -716089392, now seen corresponding path program 2 times [2024-10-28 19:24:33,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:24:33,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128184249] [2024-10-28 19:24:33,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:24:33,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:24:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:24:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:24:34,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 19:24:34,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128184249] [2024-10-28 19:24:34,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128184249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 19:24:34,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068304612] [2024-10-28 19:24:34,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 19:24:34,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 19:24:34,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 19:24:34,848 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) [2024-10-28 19:24:34,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-28 19:24:34,944 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 19:24:34,944 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 19:24:34,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-28 19:24:34,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 19:24:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:24:36,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 19:24:45,851 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse1 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse0 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)) (.cse5 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_y_14 Int) (v_z_21 Int)) (let ((.cse4 (+ v_z_14 .cse6)) (.cse2 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)))) (or (< v_z_21 .cse0) (< .cse1 .cse2) (< .cse3 v_z_21) (= (mod (+ c_~x_1~0 (* v_z_21 4)) 4294967296) .cse4) (< 4294967295 .cse4) (< .cse2 .cse5) (< v_z_14 0)))) (forall ((v_z_14 Int) (v_y_14 Int) (v_z_18 Int)) (let ((.cse7 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14))) (.cse8 (+ v_z_14 .cse6))) (or (< .cse1 .cse7) (< .cse3 v_z_18) (< 4294967295 v_z_14) (< v_z_18 .cse0) (< .cse7 .cse5) (= (+ (mod (+ (* v_z_18 4) c_~x_1~0) 4294967296) 4294967296) .cse8) (< .cse8 4294967296)))) (forall ((v_z_14 Int) (v_y_14 Int) (v_z_20 Int)) (let ((.cse9 (mod (+ (* v_z_20 4) c_~x_1~0) 4294967296)) (.cse10 (+ v_z_14 .cse6)) (.cse11 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)))) (or (< .cse3 v_z_20) (= (+ 4294967296 .cse9) .cse10) (< .cse1 .cse11) (= .cse9 .cse10) (< 4294967295 v_z_14) (< v_z_20 .cse0) (< .cse11 .cse5) (< v_z_14 0)))))) is different from false [2024-10-28 19:24:48,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse4 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse7 (+ .cse2 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse3 (+ v_z_14 .cse5)) (.cse1 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)))) (or (< .cse0 .cse1) (= .cse2 .cse3) (< 4294967295 .cse3) (< .cse1 .cse4) (< v_z_14 0)))) (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse6 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14))) (.cse8 (+ v_z_14 .cse5))) (or (< .cse0 .cse6) (< 4294967295 v_z_14) (< .cse6 .cse4) (= .cse7 .cse8) (< .cse8 4294967296)))) (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse9 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14))) (.cse10 (+ v_z_14 .cse5))) (or (< .cse0 .cse9) (< 4294967295 v_z_14) (= .cse2 .cse10) (< .cse9 .cse4) (= .cse7 .cse10) (< v_z_14 0))))))) is different from false [2024-10-28 19:24:50,478 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse2 (+ .cse0 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse1 (+ v_z_14 .cse3))) (or (< 4294967295 v_z_14) (= .cse0 .cse1) (not (= (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)) 4)) (= .cse2 .cse1) (< v_z_14 0)))) (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse4 (+ v_z_14 .cse3))) (or (< 4294967295 v_z_14) (not (= (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)) 4)) (= .cse2 .cse4) (< .cse4 4294967296)))) (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse5 (+ v_z_14 .cse3))) (or (= .cse0 .cse5) (< 4294967295 .cse5) (not (= (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)) 4)) (< v_z_14 0))))))) is different from false [2024-10-28 19:24:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-28 19:24:50,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068304612] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 19:24:50,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 19:24:50,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-10-28 19:24:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736860146] [2024-10-28 19:24:50,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 19:24:50,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-28 19:24:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 19:24:50,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-28 19:24:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=721, Unknown=5, NotChecked=174, Total=1056 [2024-10-28 19:24:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:24:50,556 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 19:24:50,556 INFO L472 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) [2024-10-28 19:24:50,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 19:24:50,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 19:24:50,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:24:52,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse2 (+ .cse0 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse1 (+ v_z_14 .cse3))) (or (< 4294967295 v_z_14) (= .cse0 .cse1) (not (= (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)) 4)) (= .cse2 .cse1) (< v_z_14 0)))) (= c_~x_2~0 0) (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse4 (+ v_z_14 .cse3))) (or (< 4294967295 v_z_14) (not (= (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)) 4)) (= .cse2 .cse4) (< .cse4 4294967296)))) (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse5 (+ v_z_14 .cse3))) (or (= .cse0 .cse5) (< 4294967295 .cse5) (not (= (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)) 4)) (< v_z_14 0)))) (= c_~x_1~0 0)))) is different from false [2024-10-28 19:24:54,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse4 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse7 (+ .cse2 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse3 (+ v_z_14 .cse5)) (.cse1 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)))) (or (< .cse0 .cse1) (= .cse2 .cse3) (< 4294967295 .cse3) (< .cse1 .cse4) (< v_z_14 0)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse6 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14))) (.cse8 (+ v_z_14 .cse5))) (or (< .cse0 .cse6) (< 4294967295 v_z_14) (< .cse6 .cse4) (= .cse7 .cse8) (< .cse8 4294967296)))) (= c_~x_1~0 0) (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse9 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14))) (.cse10 (+ v_z_14 .cse5))) (or (< .cse0 .cse9) (< 4294967295 v_z_14) (= .cse2 .cse10) (< .cse9 .cse4) (= .cse7 .cse10) (< v_z_14 0))))))) is different from false [2024-10-28 19:24:56,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse1 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse0 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)) (.cse5 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_y_14 Int) (v_z_21 Int)) (let ((.cse4 (+ v_z_14 .cse6)) (.cse2 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)))) (or (< v_z_21 .cse0) (< .cse1 .cse2) (< .cse3 v_z_21) (= (mod (+ c_~x_1~0 (* v_z_21 4)) 4294967296) .cse4) (< 4294967295 .cse4) (< .cse2 .cse5) (< v_z_14 0)))) (forall ((v_z_14 Int) (v_y_14 Int) (v_z_18 Int)) (let ((.cse7 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14))) (.cse8 (+ v_z_14 .cse6))) (or (< .cse1 .cse7) (< .cse3 v_z_18) (< 4294967295 v_z_14) (< v_z_18 .cse0) (< .cse7 .cse5) (= (+ (mod (+ (* v_z_18 4) c_~x_1~0) 4294967296) 4294967296) .cse8) (< .cse8 4294967296)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0) (forall ((v_z_14 Int) (v_y_14 Int) (v_z_20 Int)) (let ((.cse9 (mod (+ (* v_z_20 4) c_~x_1~0) 4294967296)) (.cse10 (+ v_z_14 .cse6)) (.cse11 (+ (* v_y_14 4294967296) (* 2863311531 v_z_14)))) (or (< .cse3 v_z_20) (= (+ 4294967296 .cse9) .cse10) (< .cse1 .cse11) (= .cse9 .cse10) (< 4294967295 v_z_14) (< v_z_20 .cse0) (< .cse11 .cse5) (< v_z_14 0)))))) is different from false [2024-10-28 19:25:14,863 WARN L286 SmtUtils]: Spent 18.10s on a formula simplification. DAG size of input: 57 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 19:25:16,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-10-28 19:25:18,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-10-28 19:25:22,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-10-28 19:25:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 19:25:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 19:25:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-28 19:25:29,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-28 19:25:30,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 19:25:30,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:25:30,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:25:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1533514172, now seen corresponding path program 3 times [2024-10-28 19:25:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:25:30,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428965954] [2024-10-28 19:25:30,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:25:30,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:25:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:25:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:25:32,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 19:25:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428965954] [2024-10-28 19:25:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428965954] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 19:25:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201894211] [2024-10-28 19:25:32,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 19:25:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 19:25:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 19:25:32,230 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) [2024-10-28 19:25:32,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-28 19:25:32,390 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-28 19:25:32,391 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 19:25:32,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-28 19:25:32,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 19:25:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:25:36,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 19:26:06,047 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse0 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (+ .cse3 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse1 (+ (* 3067833783 v_z_26) (* v_y_26 4294967296))) (.cse4 (+ v_z_26 .cse6))) (or (< .cse0 .cse1) (< v_z_26 0) (< .cse1 .cse2) (< 4294967295 v_z_26) (= .cse3 .cse4) (= .cse5 .cse4)))) (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse7 (+ (* 3067833783 v_z_26) (* v_y_26 4294967296))) (.cse8 (+ v_z_26 .cse6))) (or (< .cse0 .cse7) (< v_z_26 0) (< .cse7 .cse2) (< 4294967295 .cse8) (= .cse3 .cse8)))) (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse9 (+ (* 3067833783 v_z_26) (* v_y_26 4294967296))) (.cse10 (+ v_z_26 .cse6))) (or (< .cse0 .cse9) (< .cse10 4294967296) (< .cse9 .cse2) (< 4294967295 v_z_26) (= .cse5 .cse10))))))) is different from false [2024-10-28 19:26:08,270 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse1 (+ .cse4 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse0 (+ v_z_26 .cse2))) (or (< .cse0 4294967296) (not (= (+ (* 3067833783 v_z_26) (* v_y_26 4294967296)) 8)) (< 4294967295 v_z_26) (= .cse1 .cse0)))) (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse3 (+ v_z_26 .cse2))) (or (< v_z_26 0) (not (= (+ (* 3067833783 v_z_26) (* v_y_26 4294967296)) 8)) (< 4294967295 .cse3) (= .cse4 .cse3)))) (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse5 (+ v_z_26 .cse2))) (or (< v_z_26 0) (not (= (+ (* 3067833783 v_z_26) (* v_y_26 4294967296)) 8)) (< 4294967295 v_z_26) (= .cse4 .cse5) (= .cse1 .cse5))))))) is different from false [2024-10-28 19:26:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:26:08,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201894211] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 19:26:08,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 19:26:08,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 56 [2024-10-28 19:26:08,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431001992] [2024-10-28 19:26:08,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 19:26:08,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-28 19:26:08,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 19:26:08,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-28 19:26:08,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=2472, Unknown=8, NotChecked=214, Total=3192 [2024-10-28 19:26:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:26:08,328 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 19:26:08,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 56 states have internal predecessors, (71), 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) [2024-10-28 19:26:08,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 19:26:08,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 19:26:08,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-28 19:26:08,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:26:10,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse1 (+ .cse4 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse0 (+ v_z_26 .cse2))) (or (< .cse0 4294967296) (not (= (+ (* 3067833783 v_z_26) (* v_y_26 4294967296)) 8)) (< 4294967295 v_z_26) (= .cse1 .cse0)))) (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse3 (+ v_z_26 .cse2))) (or (< v_z_26 0) (not (= (+ (* 3067833783 v_z_26) (* v_y_26 4294967296)) 8)) (< 4294967295 .cse3) (= .cse4 .cse3)))) (= c_~x_2~0 0) (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse5 (+ v_z_26 .cse2))) (or (< v_z_26 0) (not (= (+ (* 3067833783 v_z_26) (* v_y_26 4294967296)) 8)) (< 4294967295 v_z_26) (= .cse4 .cse5) (= .cse1 .cse5)))) (= c_~x_1~0 0)))) is different from false [2024-10-28 19:26:12,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse0 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (+ .cse3 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse1 (+ (* 3067833783 v_z_26) (* v_y_26 4294967296))) (.cse4 (+ v_z_26 .cse6))) (or (< .cse0 .cse1) (< v_z_26 0) (< .cse1 .cse2) (< 4294967295 v_z_26) (= .cse3 .cse4) (= .cse5 .cse4)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse7 (+ (* 3067833783 v_z_26) (* v_y_26 4294967296))) (.cse8 (+ v_z_26 .cse6))) (or (< .cse0 .cse7) (< v_z_26 0) (< .cse7 .cse2) (< 4294967295 .cse8) (= .cse3 .cse8)))) (= c_~x_1~0 0) (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse9 (+ (* 3067833783 v_z_26) (* v_y_26 4294967296))) (.cse10 (+ v_z_26 .cse6))) (or (< .cse0 .cse9) (< .cse10 4294967296) (< .cse9 .cse2) (< 4294967295 v_z_26) (= .cse5 .cse10))))))) is different from false [2024-10-28 19:26:14,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296)) (.cse6 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse7 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296) 1))) (and (forall ((v_z_27 Int)) (or (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse1 (+ (* 3067833783 v_z_26) (* v_y_26 4294967296))) (.cse2 (mod (+ c_~x_1~0 (* v_z_27 8)) 4294967296)) (.cse3 (+ v_z_26 .cse5))) (or (< .cse0 .cse1) (< v_z_26 0) (= (+ .cse2 4294967296) .cse3) (< .cse1 .cse4) (< 4294967295 v_z_26) (= .cse2 .cse3)))) (< .cse6 v_z_27) (< v_z_27 .cse7))) (forall ((v_z_27 Int)) (or (< .cse6 v_z_27) (< v_z_27 .cse7) (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse9 (+ v_z_26 .cse5)) (.cse8 (+ (* 3067833783 v_z_26) (* v_y_26 4294967296)))) (or (< .cse0 .cse8) (< .cse9 4294967296) (= (+ (mod (+ c_~x_1~0 (* v_z_27 8)) 4294967296) 4294967296) .cse9) (< .cse8 .cse4) (< 4294967295 v_z_26)))))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0) (forall ((v_z_27 Int)) (or (forall ((v_z_26 Int) (v_y_26 Int)) (let ((.cse10 (+ (* 3067833783 v_z_26) (* v_y_26 4294967296))) (.cse11 (+ v_z_26 .cse5))) (or (< .cse0 .cse10) (< v_z_26 0) (< .cse10 .cse4) (< 4294967295 .cse11) (= (mod (+ c_~x_1~0 (* v_z_27 8)) 4294967296) .cse11)))) (< .cse6 v_z_27) (< v_z_27 .cse7))))) is different from false [2024-10-28 19:26:38,931 WARN L286 SmtUtils]: Spent 18.21s on a formula simplification. DAG size of input: 57 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 19:26:40,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-10-28 19:26:43,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-10-28 19:26:45,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-10-28 19:27:13,492 WARN L286 SmtUtils]: Spent 24.29s on a formula simplification that was a NOOP. DAG size: 192 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 19:27:15,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-10-28 19:28:28,523 WARN L286 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 204 DAG size of output: 184 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 19:28:38,246 WARN L286 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 19:28:44,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:29:12,369 WARN L286 SmtUtils]: Spent 19.46s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 19:29:31,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:29:35,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:29:54,998 WARN L286 SmtUtils]: Spent 11.08s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 19:29:57,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:29:59,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:01,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:09,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:10,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:12,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:17,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:19,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:21,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:23,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:25,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:32,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:35,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:37,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:39,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:42,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:30:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 19:30:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 19:30:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-28 19:30:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-28 19:30:46,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-28 19:30:46,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 19:30:46,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:30:46,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:30:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash -725647572, now seen corresponding path program 4 times [2024-10-28 19:30:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:30:46,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41762471] [2024-10-28 19:30:46,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:30:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:30:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:30:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:30:49,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 19:30:49,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41762471] [2024-10-28 19:30:49,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41762471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 19:30:49,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593185308] [2024-10-28 19:30:49,883 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-28 19:30:49,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 19:30:49,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 19:30:49,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 19:30:49,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-28 19:30:50,015 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-28 19:30:50,015 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 19:30:50,018 WARN L253 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-28 19:30:50,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 19:30:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:30:52,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 19:32:14,989 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse0 (+ .cse6 4294967296)) (.cse2 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse1 (+ v_z_32 .cse5)) (.cse3 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (= .cse0 .cse1) (< .cse1 4294967296) (< 4294967295 v_z_32) (< .cse2 .cse3) (< .cse3 .cse4)))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse7 (+ v_z_32 .cse5)) (.cse8 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (= .cse6 .cse7) (< v_z_32 0) (< .cse2 .cse8) (< 4294967295 .cse7) (< .cse8 .cse4)))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse9 (+ v_z_32 .cse5)) (.cse10 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (= .cse0 .cse9) (< 4294967295 v_z_32) (= .cse6 .cse9) (< v_z_32 0) (< .cse2 .cse10) (< .cse10 .cse4))))))) is different from false [2024-10-28 19:32:17,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse0 (+ .cse2 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse1 (+ v_z_32 .cse3))) (or (= .cse0 .cse1) (< 4294967295 v_z_32) (= .cse2 .cse1) (< v_z_32 0) (not (= (+ (* v_z_32 4008636143) (* v_y_32 4294967296)) 16))))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse4 (+ v_z_32 .cse3))) (or (= .cse2 .cse4) (< v_z_32 0) (< 4294967295 .cse4) (not (= (+ (* v_z_32 4008636143) (* v_y_32 4294967296)) 16))))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse5 (+ v_z_32 .cse3))) (or (= .cse0 .cse5) (< .cse5 4294967296) (< 4294967295 v_z_32) (not (= (+ (* v_z_32 4008636143) (* v_y_32 4294967296)) 16)))))))) is different from false [2024-10-28 19:32:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 19:32:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593185308] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 19:32:17,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 19:32:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 104 [2024-10-28 19:32:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147494177] [2024-10-28 19:32:17,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 19:32:17,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2024-10-28 19:32:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 19:32:17,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2024-10-28 19:32:17,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1952, Invalid=8553, Unknown=9, NotChecked=406, Total=10920 [2024-10-28 19:32:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:32:17,255 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 19:32:17,255 INFO L472 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) [2024-10-28 19:32:17,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 19:32:17,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 19:32:17,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-28 19:32:17,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-10-28 19:32:17,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:32:19,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse0 (+ .cse2 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse1 (+ v_z_32 .cse3))) (or (= .cse0 .cse1) (< 4294967295 v_z_32) (= .cse2 .cse1) (< v_z_32 0) (not (= (+ (* v_z_32 4008636143) (* v_y_32 4294967296)) 16))))) (= c_~x_2~0 0) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse4 (+ v_z_32 .cse3))) (or (= .cse2 .cse4) (< v_z_32 0) (< 4294967295 .cse4) (not (= (+ (* v_z_32 4008636143) (* v_y_32 4294967296)) 16))))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse5 (+ v_z_32 .cse3))) (or (= .cse0 .cse5) (< .cse5 4294967296) (< 4294967295 v_z_32) (not (= (+ (* v_z_32 4008636143) (* v_y_32 4294967296)) 16))))) (= c_~x_1~0 0)))) is different from false [2024-10-28 19:32:21,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse0 (+ .cse6 4294967296)) (.cse2 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse1 (+ v_z_32 .cse5)) (.cse3 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (= .cse0 .cse1) (< .cse1 4294967296) (< 4294967295 v_z_32) (< .cse2 .cse3) (< .cse3 .cse4)))) (= c_~x_2~0 0) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse7 (+ v_z_32 .cse5)) (.cse8 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (= .cse6 .cse7) (< v_z_32 0) (< .cse2 .cse8) (< 4294967295 .cse7) (< .cse8 .cse4)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse9 (+ v_z_32 .cse5)) (.cse10 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (= .cse0 .cse9) (< 4294967295 v_z_32) (= .cse6 .cse9) (< v_z_32 0) (< .cse2 .cse10) (< .cse10 .cse4)))) (= c_~x_1~0 0)))) is different from false [2024-10-28 19:32:23,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse5 (mod c_~x_2~0 4294967296)) (.cse6 (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296)) (.cse7 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) 1))) (and (forall ((v_z_33 Int)) (or (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse0 (+ v_z_32 .cse5)) (.cse1 (mod (+ c_~x_1~0 (* v_z_33 16)) 4294967296)) (.cse3 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (< 4294967295 v_z_32) (= .cse0 (+ 4294967296 .cse1)) (< v_z_32 0) (= .cse0 .cse1) (< .cse2 .cse3) (< .cse3 .cse4)))) (< .cse6 v_z_33) (< v_z_33 .cse7))) (= c_~x_2~0 0) (forall ((v_z_33 Int)) (or (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse8 (+ v_z_32 .cse5)) (.cse9 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (< v_z_32 0) (= .cse8 (mod (+ c_~x_1~0 (* v_z_33 16)) 4294967296)) (< .cse2 .cse9) (< 4294967295 .cse8) (< .cse9 .cse4)))) (< .cse6 v_z_33) (< v_z_33 .cse7))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (forall ((v_z_33 Int)) (or (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse10 (+ v_z_32 .cse5)) (.cse11 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (< .cse10 4294967296) (< 4294967295 v_z_32) (= .cse10 (+ 4294967296 (mod (+ c_~x_1~0 (* v_z_33 16)) 4294967296))) (< .cse2 .cse11) (< .cse11 .cse4)))) (< .cse6 v_z_33) (< v_z_33 .cse7))) (= c_~x_1~0 0))) is different from false [2024-10-28 19:32:25,572 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~x_1~0 c_~a~0) (let ((.cse11 (mod c_~a~0 4294967296))) (or (let ((.cse0 (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296))) (let ((.cse3 (+ (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse8 (+ .cse0 4294967296)) (.cse4 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse1 (+ v_z_32 .cse5)) (.cse2 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (= .cse0 .cse1) (< v_z_32 0) (< .cse2 .cse3) (< 4294967295 .cse1) (< .cse4 .cse2)))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse6 (+ v_z_32 .cse5)) (.cse7 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (< 4294967295 v_z_32) (= .cse0 .cse6) (< v_z_32 0) (< .cse7 .cse3) (= .cse8 .cse6) (< .cse4 .cse7)))) (forall ((v_z_32 Int) (v_y_32 Int)) (let ((.cse9 (+ v_z_32 .cse5)) (.cse10 (+ (* v_z_32 4008636143) (* v_y_32 4294967296)))) (or (< .cse9 4294967296) (< 4294967295 v_z_32) (< .cse10 .cse3) (= .cse8 .cse9) (< .cse4 .cse10))))))) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296) .cse11) (< .cse11 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) 1)))) (= c_~x_2~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1)) is different from false [2024-10-28 19:32:28,836 WARN L851 $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 [2024-10-28 19:32:31,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse91 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse96 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse94 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse99 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse100 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse98 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse93 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse102 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse97 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse92 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse95 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse89 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse101 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse42 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse105 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse108 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse115 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse103 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse104 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse114 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse113 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse106 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse107 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse112 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse111 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse116 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse41 (mod c_~b~0 4294967296)) (.cse76 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse110 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse109 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse90 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse109 .cse90)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse28 (< .cse90 (+ .cse110 1))) (.cse26 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (.cse27 (< .cse41 (+ .cse76 1))) (.cse29 (< .cse116 .cse41)) (.cse36 (< .cse90 (+ .cse111 1))) (.cse38 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse90)) (.cse40 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse112 .cse90)) (.cse5 (< .cse90 (+ .cse107 1))) (.cse0 (< .cse41 (+ .cse106 1))) (.cse1 (< .cse113 .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 (+ .cse114 1))) (.cse11 (< .cse104 .cse41)) (.cse9 (< .cse103 .cse90)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse90 (+ .cse115 1))) (.cse30 (< .cse41 (+ .cse116 1))) (.cse31 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse32 (< .cse108 .cse41)) (.cse52 (< .cse115 .cse90)) (.cse53 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse65 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse64 (< .cse114 .cse41)) (.cse66 (< .cse41 (+ .cse113 1))) (.cse54 (< .cse90 (+ .cse112 1))) (.cse35 (< .cse41 (+ .cse105 1))) (.cse37 (< .cse42 .cse41)) (.cse58 (< .cse111 .cse90)) (.cse39 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse57 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse59 (< .cse90 (+ .cse101 1))) (.cse34 (< .cse110 .cse90)) (.cse33 (mod c_~x_2~0 4294967296)) (.cse43 (< .cse41 (+ .cse89 1))) (.cse47 (< .cse95 .cse41)) (.cse44 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse77 (< .cse90 (+ .cse92 1))) (.cse78 (< .cse97 .cse90)) (.cse79 (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296)) (.cse73 (< .cse90 (+ .cse109 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 (+ .cse108 1))) (.cse74 (< .cse107 .cse90)) (.cse51 (< .cse106 .cse41)) (.cse55 (< .cse105 .cse41)) (.cse56 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse60 (< .cse41 (+ .cse102 1))) (.cse67 (< .cse93 .cse41)) (.cse62 (< .cse98 .cse90)) (.cse68 (< .cse41 (+ .cse104 1))) (.cse63 (< .cse90 (+ .cse103 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 (+ .cse100 1))) (.cse83 (< .cse90 (+ .cse99 1))) (.cse84 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse102 .cse41)) (.cse85 (< .cse101 .cse90)) (.cse19 (< .cse100 .cse41)) (.cse13 (< .cse99 .cse90)) (.cse23 (< .cse41 (+ .cse94 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse90 (+ .cse96 1))) (.cse69 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse71 (< .cse91 .cse90)) (.cse72 (< .cse90 (+ .cse98 1))) (.cse18 (< .cse90 (+ .cse97 1))) (.cse20 (< .cse96 .cse90)) (.cse80 (< .cse41 (+ .cse95 1))) (.cse81 (< .cse94 .cse41)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse82 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296)) (.cse45 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse87 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse86 (< .cse41 (+ .cse93 1))) (.cse46 (< .cse92 .cse90)) (.cse48 (< .cse90 (+ .cse91 1))) (.cse88 (< .cse89 .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 (= .cse33 .cse26) .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 (< .cse76 .cse41) .cse34 (= (mod c_~x_1~0 4294967296) .cse33)) (or .cse43 .cse77 .cse78 .cse47 (= .cse79 .cse44)) (or .cse77 .cse80 .cse78 .cse81 (= .cse79 .cse82)) (or .cse73 (= .cse49 .cse75) .cse50 .cse74 .cse51) (or .cse55 .cse83 (= .cse84 .cse56) .cse85 .cse60) (or .cse67 .cse62 .cse68 .cse63 (= .cse61 .cse70)) (or .cse12 .cse83 (= .cse84 .cse15) .cse16 .cse85) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (or .cse86 (= .cse87 .cse69) .cse71 .cse72 .cse88) (or .cse18 .cse20 .cse80 .cse81 (= .cse21 .cse82)) (or (= .cse45 .cse87) .cse86 .cse46 .cse48 .cse88)))) is different from false [2024-10-28 19:32:40,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse86 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse91 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse89 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse94 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse95 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse93 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse88 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse97 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse92 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse87 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse90 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse84 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse96 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse38 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse100 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse103 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse28 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse109 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse98 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse99 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse108 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse107 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse26 (mod c_~b~0 4294967296)) (.cse101 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse102 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse106 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse105 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse104 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse85 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse104 .cse85)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse27 (< .cse85 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1))) (.cse33 (< .cse85 (+ .cse105 1))) (.cse35 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse85)) (.cse37 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse106 .cse85)) (.cse5 (< .cse85 (+ .cse102 1))) (.cse0 (< .cse26 (+ .cse101 1))) (.cse1 (< .cse107 .cse26)) (.cse4 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (.cse6 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (.cse8 (< .cse26 (+ .cse108 1))) (.cse11 (< .cse99 .cse26)) (.cse9 (< .cse98 .cse85)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse85 (+ .cse109 1))) (.cse29 (< .cse26 (+ .cse28 1))) (.cse30 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse31 (< .cse103 .cse26)) (.cse48 (< .cse109 .cse85)) (.cse49 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse61 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse60 (< .cse108 .cse26)) (.cse62 (< .cse26 (+ .cse107 1))) (.cse50 (< .cse85 (+ .cse106 1))) (.cse32 (< .cse26 (+ .cse100 1))) (.cse34 (< .cse38 .cse26)) (.cse54 (< .cse105 .cse85)) (.cse36 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse53 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse55 (< .cse85 (+ .cse96 1))) (.cse39 (< .cse26 (+ .cse84 1))) (.cse43 (< .cse90 .cse26)) (.cse40 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse72 (< .cse85 (+ .cse87 1))) (.cse73 (< .cse92 .cse85)) (.cse74 (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296)) (.cse69 (< .cse85 (+ .cse104 1))) (.cse45 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse71 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse46 (< .cse26 (+ .cse103 1))) (.cse70 (< .cse102 .cse85)) (.cse47 (< .cse101 .cse26)) (.cse51 (< .cse100 .cse26)) (.cse52 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse56 (< .cse26 (+ .cse97 1))) (.cse63 (< .cse88 .cse26)) (.cse58 (< .cse93 .cse85)) (.cse64 (< .cse26 (+ .cse99 1))) (.cse59 (< .cse85 (+ .cse98 1))) (.cse57 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296)) (.cse66 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (.cse12 (< .cse26 (+ .cse95 1))) (.cse78 (< .cse85 (+ .cse94 1))) (.cse79 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse97 .cse26)) (.cse80 (< .cse96 .cse85)) (.cse19 (< .cse95 .cse26)) (.cse13 (< .cse94 .cse85)) (.cse23 (< .cse26 (+ .cse89 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse85 (+ .cse91 1))) (.cse65 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse67 (< .cse86 .cse85)) (.cse68 (< .cse85 (+ .cse93 1))) (.cse18 (< .cse85 (+ .cse92 1))) (.cse20 (< .cse91 .cse85)) (.cse75 (< .cse26 (+ .cse90 1))) (.cse76 (< .cse89 .cse26)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse77 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296)) (.cse41 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse82 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse81 (< .cse26 (+ .cse88 1))) (.cse42 (< .cse87 .cse85)) (.cse44 (< .cse85 (+ .cse86 1))) (.cse83 (< .cse84 .cse26))) (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 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse26 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) .cse27 (< .cse28 .cse26)) (or .cse24 .cse29 (= .cse25 .cse30) .cse27 .cse31) (or .cse32 .cse33 .cse34 .cse35 (= .cse36 .cse37)) (or (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse26) .cse33 (< .cse26 (+ .cse38 1)) .cse35 (= (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296) .cse37)) (or .cse39 (= .cse40 .cse41) .cse42 .cse43 .cse44) (or (= .cse45 .cse3) .cse46 .cse2 .cse47 .cse5) (or .cse0 .cse1 .cse48 (= .cse49 .cse4) .cse50) (or .cse51 (= .cse52 .cse53) .cse54 .cse55 .cse56) (or (= .cse57 .cse6) .cse58 .cse59 .cse8 .cse11) (or .cse9 .cse60 (= .cse61 .cse7) .cse62 .cse10) (or .cse63 .cse64 (= .cse65 .cse66) .cse67 .cse68) (or .cse69 .cse29 .cse70 (= .cse71 .cse30) .cse31) (or .cse48 (= .cse49 .cse61) .cse60 .cse62 .cse50) (or .cse32 .cse34 .cse54 (= .cse36 .cse53) .cse55) (or .cse39 .cse72 .cse73 .cse43 (= .cse74 .cse40)) (or .cse72 .cse75 .cse73 .cse76 (= .cse74 .cse77)) (or .cse69 (= .cse45 .cse71) .cse46 .cse70 .cse47) (or .cse51 .cse78 (= .cse79 .cse52) .cse80 .cse56) (or .cse63 .cse58 .cse64 .cse59 (= .cse57 .cse66)) (or .cse12 .cse78 (= .cse79 .cse15) .cse16 .cse80) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (or .cse81 (= .cse82 .cse65) .cse67 .cse68 .cse83) (or .cse18 .cse20 .cse75 .cse76 (= .cse21 .cse77)) (or (= .cse41 .cse82) .cse81 .cse42 .cse44 .cse83)))) is different from false [2024-10-28 19:33:08,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:33:16,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:33:44,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:34:06,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-28 19:34:07,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Killed by 15