./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 559b036c 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 ../../../trunk/examples/svcomp/weaver/mult-dist.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 c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c --- Real Ultimate output --- This is Ultimate 0.2.3-?-559b036-m [2023-11-23 03:33:10,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 03:33:10,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-23 03:33:10,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 03:33:10,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 03:33:10,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 03:33:10,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 03:33:10,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 03:33:10,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 03:33:10,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 03:33:10,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 03:33:10,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 03:33:10,594 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 03:33:10,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 03:33:10,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 03:33:10,596 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 03:33:10,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 03:33:10,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 03:33:10,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 03:33:10,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 03:33:10,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 03:33:10,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 03:33:10,598 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 03:33:10,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 03:33:10,599 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 03:33:10,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 03:33:10,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 03:33:10,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 03:33:10,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 03:33:10,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 03:33:10,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 03:33:10,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 03:33:10,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 03:33:10,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 03:33:10,603 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-23 03:33:10,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 03:33:10,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 03:33:10,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-23 03:33:10,604 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 03:33:10,604 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-23 03:33:10,604 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-23 03:33:10,604 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 -> c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c [2023-11-23 03:33:10,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 03:33:10,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 03:33:10,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 03:33:10,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 03:33:10,855 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 03:33:10,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-11-23 03:33:12,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 03:33:12,229 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 03:33:12,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-11-23 03:33:12,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9284ac8d4/785169f3a5e84f9e933fea39ce05086e/FLAGc04619294 [2023-11-23 03:33:12,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9284ac8d4/785169f3a5e84f9e933fea39ce05086e [2023-11-23 03:33:12,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 03:33:12,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 03:33:12,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 03:33:12,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 03:33:12,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 03:33:12,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410cb4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12, skipping insertion in model container [2023-11-23 03:33:12,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,291 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 03:33:12,470 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2155,2168] [2023-11-23 03:33:12,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 03:33:12,485 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 03:33:12,517 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2155,2168] [2023-11-23 03:33:12,520 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 03:33:12,534 INFO L206 MainTranslator]: Completed translation [2023-11-23 03:33:12,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12 WrapperNode [2023-11-23 03:33:12,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 03:33:12,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 03:33:12,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 03:33:12,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 03:33:12,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,587 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2023-11-23 03:33:12,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 03:33:12,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 03:33:12,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 03:33:12,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 03:33:12,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 03:33:12,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 03:33:12,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 03:33:12,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 03:33:12,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (1/1) ... [2023-11-23 03:33:12,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 03:33:12,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 03:33:12,690 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) [2023-11-23 03:33:12,703 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 [2023-11-23 03:33:12,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 03:33:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-23 03:33:12,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-23 03:33:12,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-23 03:33:12,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-23 03:33:12,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-23 03:33:12,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-23 03:33:12,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 03:33:12,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 03:33:12,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 03:33:12,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 03:33:12,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 03:33:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 03:33:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 03:33:12,754 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 03:33:12,873 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 03:33:12,875 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 03:33:13,188 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 03:33:13,373 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 03:33:13,374 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 03:33:13,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:33:13 BoogieIcfgContainer [2023-11-23 03:33:13,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 03:33:13,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 03:33:13,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 03:33:13,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 03:33:13,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:33:12" (1/3) ... [2023-11-23 03:33:13,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313b873d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:33:13, skipping insertion in model container [2023-11-23 03:33:13,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:33:12" (2/3) ... [2023-11-23 03:33:13,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313b873d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:33:13, skipping insertion in model container [2023-11-23 03:33:13,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:33:13" (3/3) ... [2023-11-23 03:33:13,382 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2023-11-23 03:33:13,389 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 03:33:13,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 03:33:13,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 03:33:13,398 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 03:33:13,457 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-23 03:33:13,491 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 03:33:13,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-23 03:33:13,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 03:33:13,493 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) [2023-11-23 03:33:13,516 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 [2023-11-23 03:33:13,536 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-23 03:33:13,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-23 03:33:13,553 INFO L357 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, mHoare=true, 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;@40dd0570, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 03:33:13,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-23 03:33:13,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-23 03:33:13,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 03:33:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1193994924, now seen corresponding path program 1 times [2023-11-23 03:33:13,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 03:33:13,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506360220] [2023-11-23 03:33:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 03:33:13,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 03:33:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 03:33:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 03:33:14,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 03:33:14,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506360220] [2023-11-23 03:33:14,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506360220] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 03:33:14,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261815108] [2023-11-23 03:33:14,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 03:33:14,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 03:33:14,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 03:33:14,617 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) [2023-11-23 03:33:14,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 03:33:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 03:33:14,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-23 03:33:14,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 03:33:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 03:33:15,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 03:33:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 03:33:15,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261815108] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 03:33:15,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 03:33:15,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2023-11-23 03:33:15,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561986927] [2023-11-23 03:33:15,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 03:33:15,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 03:33:15,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 03:33:15,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 03:33:15,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2023-11-23 03:33:15,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 03:33:15,753 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 03:33:15,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 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) [2023-11-23 03:33:15,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 03:33:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 03:33:16,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 03:33:17,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-23 03:33:17,077 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-23 03:33:17,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 03:33:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1259933876, now seen corresponding path program 1 times [2023-11-23 03:33:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 03:33:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792245453] [2023-11-23 03:33:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 03:33:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 03:33:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 03:33:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 03:33:18,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 03:33:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792245453] [2023-11-23 03:33:18,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792245453] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 03:33:18,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456204400] [2023-11-23 03:33:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 03:33:18,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 03:33:18,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 03:33:18,194 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) [2023-11-23 03:33:18,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 03:33:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 03:33:18,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-23 03:33:18,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 03:33:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 03:33:22,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 03:33:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 03:33:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456204400] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 03:33:24,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 03:33:24,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 37 [2023-11-23 03:33:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658862523] [2023-11-23 03:33:24,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 03:33:24,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-23 03:33:24,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 03:33:24,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-23 03:33:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2023-11-23 03:33:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 03:33:24,034 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 03:33:24,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 37 states have internal predecessors, (57), 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) [2023-11-23 03:33:24,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-23 03:33:24,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 03:33:31,544 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 96 DAG size of output: 84 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-23 03:34:10,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 03:34:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 03:34:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-23 03:34:36,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 03:34:36,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 03:34:36,630 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-23 03:34:36,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 03:34:36,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1613697164, now seen corresponding path program 2 times [2023-11-23 03:34:36,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 03:34:36,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549508068] [2023-11-23 03:34:36,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 03:34:36,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 03:34:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 03:34:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 03:34:38,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 03:34:38,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549508068] [2023-11-23 03:34:38,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549508068] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 03:34:38,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124228924] [2023-11-23 03:34:38,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 03:34:38,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 03:34:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 03:34:38,823 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) [2023-11-23 03:34:38,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 03:34:38,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 03:34:38,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 03:34:38,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-23 03:34:38,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 03:34:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 03:34:43,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 03:34:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 03:34:53,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124228924] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 03:34:53,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 03:34:53,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 61 [2023-11-23 03:34:53,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831592399] [2023-11-23 03:34:53,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 03:34:53,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-23 03:34:53,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 03:34:53,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-23 03:34:53,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=2984, Unknown=0, NotChecked=0, Total=3660 [2023-11-23 03:34:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 03:34:53,996 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 03:34:53,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 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) [2023-11-23 03:34:53,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-23 03:34:53,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-23 03:34:53,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 03:37:14,458 WARN L293 SmtUtils]: Spent 1.84m on a formula simplification. DAG size of input: 142 DAG size of output: 101 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-23 03:37:16,494 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse25 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296)) (.cse48 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse31 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse62 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse52 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse53 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse13 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse14 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse36 (mod c_~a~0 4294967296)) (.cse51 (mod c_~b~0 4294967296)) (.cse35 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse41 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse45 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse30 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse24 (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse11 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse21 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse63 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse64 (mod (+ 7 c_thread2Thread1of1ForFork0_~i~1) 4294967296)) (.cse29 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse23 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse61 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse46 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse61 .cse46)) (.cse6 (+ 4294967294 .cse23)) (.cse5 (+ .cse29 4294967297)) (.cse17 (+ (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse64)) (.cse16 (+ 4294967297 .cse63)) (.cse12 (+ 4294967294 .cse21)) (.cse10 (+ .cse0 1)) (.cse33 (+ .cse11 4294967294)) (.cse34 (+ .cse0 4294967297)) (.cse27 (+ .cse24 .cse64)) (.cse18 (+ .cse45 2 .cse30)) (.cse32 (+ .cse11 1)) (.cse15 (+ .cse35 .cse41)) (.cse37 (< .cse41 .cse51)) (.cse49 (< .cse14 .cse36)) (.cse38 (< .cse51 (+ .cse13 1))) (.cse50 (< .cse36 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse39 (< .cse63 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse20 (+ .cse63 1)) (.cse40 (+ .cse53 .cse35)) (.cse3 (+ .cse52 1)) (.cse47 (+ .cse45 .cse46)) (.cse54 (+ .cse61 .cse62)) (.cse8 (+ .cse53 2 .cse62)) (.cse59 (+ .cse52 4294967297)) (.cse60 (+ .cse0 4294967294)) (.cse7 (+ .cse48 .cse31)) (.cse2 (+ .cse45 .cse30)) (.cse4 (+ .cse24 .cse25)) (.cse26 (+ .cse29 1)) (.cse56 (+ .cse48 2 .cse31)) (.cse9 (+ .cse61 .cse46)) (.cse57 (+ 4294967297 .cse21)) (.cse58 (+ .cse52 4294967294)) (.cse22 (+ 2 .cse35 .cse41)) (.cse19 (+ .cse53 .cse62)) (.cse55 (+ .cse21 1)) (.cse28 (+ .cse48 .cse25)) (.cse42 (+ .cse11 4294967297)) (.cse43 (+ .cse29 4294967294)) (.cse44 (+ .cse30 .cse31))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse7)) (or (< .cse0 .cse8) (< .cse9 .cse3)) (or (< .cse2 .cse10) (< .cse11 .cse1)) (or (< .cse12 (+ .cse13 .cse14)) (< .cse15 .cse16)) (or (< .cse17 6) (< 4 .cse4)) (or (< .cse11 .cse18) (< .cse7 .cse10)) (or (< .cse19 .cse20) (< .cse21 .cse22)) (or (< .cse23 (+ .cse24 2 .cse25)) (< .cse17 .cse26)) (or (< .cse27 .cse5) (< .cse6 .cse28)) (or (< .cse29 (+ 2 .cse30 .cse31)) (< .cse28 .cse32)) (or (< .cse33 .cse9) (< .cse2 .cse34)) (or (< .cse12 .cse15) (< .cse19 .cse16)) (or (< .cse35 .cse36) .cse37 (< .cse36 (+ .cse14 1)) .cse38 .cse39) (or (< .cse6 .cse4) (< .cse17 .cse5)) (or (< .cse17 4294967302) (< 4294967300 .cse4)) (or (< .cse33 .cse2) (< .cse7 .cse34)) (or (< .cse40 .cse16) (< .cse12 (+ .cse14 .cse41))) (or (< .cse4 .cse42) (< .cse43 .cse7)) (or (< .cse44 .cse10) (< .cse11 (+ .cse45 2 .cse46))) (or (< .cse33 .cse47) (< .cse44 .cse34)) (or (< .cse23 (+ .cse48 2 .cse25)) (< .cse27 .cse26)) (or (< .cse29 .cse18) (< .cse7 .cse32)) (or .cse49 .cse50 (< .cse13 .cse51) .cse39) (or (< .cse52 (+ .cse53 2 .cse35)) (< .cse54 .cse55)) (or (< .cse4 .cse32) (< .cse29 .cse56)) (or (< .cse19 .cse57) (< .cse58 .cse15)) (or (< .cse15 .cse20) (< .cse21 (+ .cse13 2 .cse14))) (or .cse37 .cse49 .cse38 .cse50 .cse39) (= c_thread1Thread1of1ForFork2_~i~0 0) (or (< .cse2 .cse59) (< .cse60 .cse9)) (or (< .cse21 (+ 2 .cse14 .cse41)) (< .cse40 .cse20)) (or (< .cse54 .cse57) (< .cse58 .cse40)) (or (< .cse47 .cse3) (< .cse0 (+ 2 .cse61 .cse62))) (or (< .cse47 .cse59) (< .cse60 .cse54)) (or (< .cse52 .cse8) (< .cse9 .cse55)) (or (< .cse9 .cse59) (< .cse60 .cse19)) (or (< .cse7 .cse42) (< .cse43 .cse2)) (or (< .cse4 .cse26) (< .cse23 .cse56)) (or (< .cse9 .cse57) (< .cse58 .cse19)) (or (< .cse52 .cse22) (< .cse19 .cse55)) (or (< .cse28 .cse42) (< .cse43 .cse44))))) is different from false [2023-11-23 03:37:19,254 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse25 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296)) (.cse49 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse31 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse63 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse53 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse54 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse13 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse14 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse36 (mod c_~a~0 4294967296)) (.cse52 (mod c_~b~0 4294967296)) (.cse35 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse41 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse45 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse30 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse24 (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse11 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse21 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse64 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse47 (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296)) (.cse65 (mod (+ 7 c_thread2Thread1of1ForFork0_~i~1) 4294967296)) (.cse29 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse23 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse62 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse46 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse62 .cse46)) (.cse6 (+ 4294967294 .cse23)) (.cse5 (+ .cse29 4294967297)) (.cse17 (+ .cse47 .cse65)) (.cse16 (+ 4294967297 .cse64)) (.cse12 (+ 4294967294 .cse21)) (.cse10 (+ .cse0 1)) (.cse33 (+ .cse11 4294967294)) (.cse34 (+ .cse0 4294967297)) (.cse27 (+ .cse24 .cse65)) (.cse18 (+ .cse45 2 .cse30)) (.cse32 (+ .cse11 1)) (.cse15 (+ .cse35 .cse41)) (.cse37 (< .cse41 .cse52)) (.cse50 (< .cse14 .cse36)) (.cse38 (< .cse52 (+ .cse13 1))) (.cse51 (< .cse36 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse39 (< .cse64 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse20 (+ .cse64 1)) (.cse40 (+ .cse54 .cse35)) (.cse3 (+ .cse53 1)) (.cse48 (+ .cse45 .cse46)) (.cse55 (+ .cse62 .cse63)) (.cse8 (+ .cse54 2 .cse63)) (.cse60 (+ .cse53 4294967297)) (.cse61 (+ .cse0 4294967294)) (.cse7 (+ .cse49 .cse31)) (.cse2 (+ .cse45 .cse30)) (.cse4 (+ .cse24 .cse25)) (.cse26 (+ .cse29 1)) (.cse57 (+ .cse49 2 .cse31)) (.cse9 (+ .cse62 .cse46)) (.cse58 (+ 4294967297 .cse21)) (.cse59 (+ .cse53 4294967294)) (.cse22 (+ 2 .cse35 .cse41)) (.cse19 (+ .cse54 .cse63)) (.cse56 (+ .cse21 1)) (.cse28 (+ .cse49 .cse25)) (.cse42 (+ .cse11 4294967297)) (.cse43 (+ .cse29 4294967294)) (.cse44 (+ .cse30 .cse31))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse7)) (or (< .cse0 .cse8) (< .cse9 .cse3)) (or (< .cse2 .cse10) (< .cse11 .cse1)) (or (< .cse12 (+ .cse13 .cse14)) (< .cse15 .cse16)) (or (< .cse17 6) (< 4 .cse4)) (or (< .cse11 .cse18) (< .cse7 .cse10)) (or (< .cse19 .cse20) (< .cse21 .cse22)) (or (< .cse23 (+ .cse24 2 .cse25)) (< .cse17 .cse26)) (or (< .cse27 .cse5) (< .cse6 .cse28)) (or (< .cse29 (+ 2 .cse30 .cse31)) (< .cse28 .cse32)) (or (< .cse33 .cse9) (< .cse2 .cse34)) (or (< .cse12 .cse15) (< .cse19 .cse16)) (or (< .cse35 .cse36) .cse37 (< .cse36 (+ .cse14 1)) .cse38 .cse39) (or (< .cse6 .cse4) (< .cse17 .cse5)) (or (< .cse17 4294967302) (< 4294967300 .cse4)) (or (< .cse33 .cse2) (< .cse7 .cse34)) (or (< .cse40 .cse16) (< .cse12 (+ .cse14 .cse41))) (or (< .cse4 .cse42) (< .cse43 .cse7)) (or (< .cse44 .cse10) (< .cse11 (+ .cse45 2 .cse46))) (< .cse47 4294967295) (or (< .cse33 .cse48) (< .cse44 .cse34)) (or (< .cse23 (+ .cse49 2 .cse25)) (< .cse27 .cse26)) (or (< .cse29 .cse18) (< .cse7 .cse32)) (or .cse50 .cse51 (< .cse13 .cse52) .cse39) (or (< .cse53 (+ .cse54 2 .cse35)) (< .cse55 .cse56)) (or (< .cse4 .cse32) (< .cse29 .cse57)) (or (< .cse19 .cse58) (< .cse59 .cse15)) (or (< .cse15 .cse20) (< .cse21 (+ .cse13 2 .cse14))) (or .cse37 .cse50 .cse38 .cse51 .cse39) (or (< .cse2 .cse60) (< .cse61 .cse9)) (or (< .cse21 (+ 2 .cse14 .cse41)) (< .cse40 .cse20)) (or (< .cse55 .cse58) (< .cse59 .cse40)) (or (< .cse48 .cse3) (< .cse0 (+ 2 .cse62 .cse63))) (or (< .cse48 .cse60) (< .cse61 .cse55)) (or (< .cse53 .cse8) (< .cse9 .cse56)) (or (< .cse9 .cse60) (< .cse61 .cse19)) (or (< .cse7 .cse42) (< .cse43 .cse2)) (or (< .cse4 .cse26) (< .cse23 .cse57)) (or (< .cse9 .cse58) (< .cse59 .cse19)) (or (< .cse53 .cse22) (< .cse19 .cse56)) (or (< .cse28 .cse42) (< .cse43 .cse44))))) is different from false [2023-11-23 03:37:22,024 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse23 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse24 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse29 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse30 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse12 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296)) (.cse17 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse14 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse15 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse19 (mod c_~a~0 4294967296)) (.cse27 (mod c_~b~0 4294967296)) (.cse18 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse31 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296))) (let ((.cse16 (+ .cse18 .cse31)) (.cse20 (< .cse31 .cse27)) (.cse25 (< .cse15 .cse19)) (.cse21 (< .cse27 (+ .cse14 1))) (.cse26 (< .cse19 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse22 (< .cse17 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse7 (+ .cse11 .cse12)) (.cse4 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse3 (+ .cse29 .cse30)) (.cse10 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse9 (+ .cse23 .cse24)) (.cse0 (+ (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296))) (.cse1 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse2 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse8 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse28 (+ .cse5 .cse6)) (.cse13 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296))) (and (or (< .cse0 (+ .cse1 4294967297)) (< (+ 4294967294 .cse2) .cse3)) (or (< .cse4 (+ .cse5 2 .cse6)) (< .cse7 (+ .cse8 1))) (or (< .cse9 (+ .cse4 1)) (< .cse10 (+ 2 .cse11 .cse12))) (or (< (+ 4294967294 .cse13) (+ .cse14 .cse15)) (< .cse16 (+ 4294967297 .cse17))) (or (< (+ .cse10 4294967294) .cse7) (< .cse9 (+ .cse4 4294967297))) (or (< .cse18 .cse19) .cse20 (< .cse19 (+ .cse15 1)) .cse21 .cse22) (or (< .cse1 (+ .cse23 2 .cse24)) (< .cse3 (+ .cse10 1))) (or .cse25 .cse26 (< .cse14 .cse27) .cse22) (or (< .cse28 (+ 4294967297 .cse13)) (< (+ .cse8 4294967294) .cse16)) (or (< .cse16 (+ .cse17 1)) (< .cse13 (+ .cse14 2 .cse15))) (or .cse20 .cse25 .cse21 .cse26 .cse22) (or (< .cse7 (+ .cse8 4294967297)) (< (+ .cse4 4294967294) .cse28)) (or (< .cse3 (+ .cse10 4294967297)) (< (+ .cse1 4294967294) .cse9)) (or (< .cse0 (+ .cse1 1)) (< .cse2 (+ .cse29 2 .cse30))) (or (< .cse8 (+ 2 .cse18 .cse31)) (< .cse28 (+ .cse13 1)))))) is different from false [2023-11-23 03:37:25,335 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse25 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296)) (.cse49 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse31 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse60 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse50 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse51 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse13 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse62 (mod c_~b~0 4294967296)) (.cse35 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse41 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse45 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse30 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse24 (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse11 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse21 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse61 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse47 (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296)) (.cse63 (mod (+ 7 c_thread2Thread1of1ForFork0_~i~1) 4294967296)) (.cse29 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse23 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse59 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse46 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse59 .cse46)) (.cse6 (+ 4294967294 .cse23)) (.cse5 (+ .cse29 4294967297)) (.cse17 (+ .cse47 .cse63)) (.cse16 (+ 4294967297 .cse61)) (.cse12 (+ 4294967294 .cse21)) (.cse10 (+ .cse0 1)) (.cse33 (+ .cse11 4294967294)) (.cse34 (+ .cse0 4294967297)) (.cse27 (+ .cse24 .cse63)) (.cse18 (+ .cse45 2 .cse30)) (.cse32 (+ .cse11 1)) (.cse15 (+ .cse35 .cse41)) (.cse37 (< .cse41 .cse62)) (.cse38 (< .cse62 (+ .cse13 1))) (.cse36 (mod c_~a~0 4294967296)) (.cse39 (< .cse61 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse14 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse20 (+ .cse61 1)) (.cse40 (+ .cse51 .cse35)) (.cse3 (+ .cse50 1)) (.cse48 (+ .cse45 .cse46)) (.cse52 (+ .cse59 .cse60)) (.cse8 (+ .cse51 2 .cse60)) (.cse57 (+ .cse50 4294967297)) (.cse58 (+ .cse0 4294967294)) (.cse7 (+ .cse49 .cse31)) (.cse2 (+ .cse45 .cse30)) (.cse4 (+ .cse24 .cse25)) (.cse26 (+ .cse29 1)) (.cse54 (+ .cse49 2 .cse31)) (.cse9 (+ .cse59 .cse46)) (.cse55 (+ 4294967297 .cse21)) (.cse56 (+ .cse50 4294967294)) (.cse22 (+ 2 .cse35 .cse41)) (.cse19 (+ .cse51 .cse60)) (.cse53 (+ .cse21 1)) (.cse28 (+ .cse49 .cse25)) (.cse42 (+ .cse11 4294967297)) (.cse43 (+ .cse29 4294967294)) (.cse44 (+ .cse30 .cse31))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse7)) (or (< .cse0 .cse8) (< .cse9 .cse3)) (or (< .cse2 .cse10) (< .cse11 .cse1)) (or (< .cse12 (+ .cse13 .cse14)) (< .cse15 .cse16)) (or (< .cse17 6) (< 4 .cse4)) (or (< .cse11 .cse18) (< .cse7 .cse10)) (or (< .cse19 .cse20) (< .cse21 .cse22)) (or (< .cse23 (+ .cse24 2 .cse25)) (< .cse17 .cse26)) (or (< .cse27 .cse5) (< .cse6 .cse28)) (or (< .cse29 (+ 2 .cse30 .cse31)) (< .cse28 .cse32)) (or (< .cse33 .cse9) (< .cse2 .cse34)) (or (< .cse12 .cse15) (< .cse19 .cse16)) (or (< .cse35 .cse36) .cse37 (< .cse36 (+ .cse14 1)) .cse38 .cse39) (or (< .cse6 .cse4) (< .cse17 .cse5)) (or (< .cse17 4294967302) (< 4294967300 .cse4)) (or (< .cse33 .cse2) (< .cse7 .cse34)) (or (< .cse40 .cse16) (< .cse12 (+ .cse14 .cse41))) (or (< .cse4 .cse42) (< .cse43 .cse7)) (or (< .cse44 .cse10) (< .cse11 (+ .cse45 2 .cse46))) (< .cse47 4294967295) (or (< .cse33 .cse48) (< .cse44 .cse34)) (or (< .cse23 (+ .cse49 2 .cse25)) (< .cse27 .cse26)) (or (< .cse29 .cse18) (< .cse7 .cse32)) (or (< .cse50 (+ .cse51 2 .cse35)) (< .cse52 .cse53)) (or (< .cse4 .cse32) (< .cse29 .cse54)) (or (< .cse19 .cse55) (< .cse56 .cse15)) (or (< .cse15 .cse20) (< .cse21 (+ .cse13 2 .cse14))) (or .cse37 (< .cse14 .cse36) .cse38 (< .cse36 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) .cse39) (or (< .cse2 .cse57) (< .cse58 .cse9)) (or (< .cse21 (+ 2 .cse14 .cse41)) (< .cse40 .cse20)) (or (< .cse52 .cse55) (< .cse56 .cse40)) (or (< .cse48 .cse3) (< .cse0 (+ 2 .cse59 .cse60))) (or (< .cse48 .cse57) (< .cse58 .cse52)) (or (< .cse50 .cse8) (< .cse9 .cse53)) (or (< .cse9 .cse57) (< .cse58 .cse19)) (or (< .cse7 .cse42) (< .cse43 .cse2)) (or (< .cse4 .cse26) (< .cse23 .cse54)) (or (< .cse9 .cse55) (< .cse56 .cse19)) (or (< .cse50 .cse22) (< .cse19 .cse53)) (or (< .cse28 .cse42) (< .cse43 .cse44))))) is different from false [2023-11-23 03:39:48,860 WARN L293 SmtUtils]: Spent 1.46m on a formula simplification. DAG size of input: 140 DAG size of output: 112 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-23 03:39:58,683 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 [] [2023-11-23 03:40:00,721 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse25 (mod (+ c_thread2Thread1of1ForFork0_~i~1 6) 4294967296)) (.cse48 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse31 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse59 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse49 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse50 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse35 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse37 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse44 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse30 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse24 (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse11 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse21 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse39 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse46 (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296)) (.cse60 (mod (+ 7 c_thread2Thread1of1ForFork0_~i~1) 4294967296)) (.cse29 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse23 (mod (+ 6 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse58 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse45 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse58 .cse45)) (.cse6 (+ 4294967294 .cse23)) (.cse5 (+ .cse29 4294967297)) (.cse17 (+ .cse46 .cse60)) (.cse16 (+ 4294967297 .cse39)) (.cse12 (+ 4294967294 .cse21)) (.cse10 (+ .cse0 1)) (.cse33 (+ .cse11 4294967294)) (.cse34 (+ .cse0 4294967297)) (.cse27 (+ .cse24 .cse60)) (.cse18 (+ .cse44 2 .cse30)) (.cse32 (+ .cse11 1)) (.cse15 (+ .cse35 .cse37)) (.cse13 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse14 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse20 (+ .cse39 1)) (.cse40 (+ .cse50 .cse35)) (.cse3 (+ .cse49 1)) (.cse47 (+ .cse44 .cse45)) (.cse51 (+ .cse58 .cse59)) (.cse8 (+ .cse50 2 .cse59)) (.cse56 (+ .cse49 4294967297)) (.cse57 (+ .cse0 4294967294)) (.cse7 (+ .cse48 .cse31)) (.cse2 (+ .cse44 .cse30)) (.cse4 (+ .cse24 .cse25)) (.cse26 (+ .cse29 1)) (.cse53 (+ .cse48 2 .cse31)) (.cse9 (+ .cse58 .cse45)) (.cse54 (+ 4294967297 .cse21)) (.cse55 (+ .cse49 4294967294)) (.cse22 (+ 2 .cse35 .cse37)) (.cse19 (+ .cse50 .cse59)) (.cse52 (+ .cse21 1)) (.cse28 (+ .cse48 .cse25)) (.cse41 (+ .cse11 4294967297)) (.cse42 (+ .cse29 4294967294)) (.cse43 (+ .cse30 .cse31))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse7)) (or (< .cse0 .cse8) (< .cse9 .cse3)) (or (< .cse2 .cse10) (< .cse11 .cse1)) (or (< .cse12 (+ .cse13 .cse14)) (< .cse15 .cse16)) (or (< .cse17 6) (< 4 .cse4)) (or (< .cse11 .cse18) (< .cse7 .cse10)) (or (< .cse19 .cse20) (< .cse21 .cse22)) (or (< .cse23 (+ .cse24 2 .cse25)) (< .cse17 .cse26)) (or (< .cse27 .cse5) (< .cse6 .cse28)) (or (< .cse29 (+ 2 .cse30 .cse31)) (< .cse28 .cse32)) (or (< .cse33 .cse9) (< .cse2 .cse34)) (or (< .cse12 .cse15) (< .cse19 .cse16)) (let ((.cse36 (mod c_~a~0 4294967296)) (.cse38 (mod c_~b~0 4294967296))) (or (< .cse35 .cse36) (< .cse37 .cse38) (< .cse36 (+ .cse14 1)) (< .cse38 (+ .cse13 1)) (< .cse39 (mod (+ c_~b~0 c_~a~0) 4294967296)))) (or (< .cse6 .cse4) (< .cse17 .cse5)) (or (< .cse17 4294967302) (< 4294967300 .cse4)) (or (< .cse33 .cse2) (< .cse7 .cse34)) (or (< .cse40 .cse16) (< .cse12 (+ .cse14 .cse37))) (or (< .cse4 .cse41) (< .cse42 .cse7)) (or (< .cse43 .cse10) (< .cse11 (+ .cse44 2 .cse45))) (< .cse46 4294967295) (or (< .cse33 .cse47) (< .cse43 .cse34)) (or (< .cse23 (+ .cse48 2 .cse25)) (< .cse27 .cse26)) (or (< .cse29 .cse18) (< .cse7 .cse32)) (or (< .cse49 (+ .cse50 2 .cse35)) (< .cse51 .cse52)) (or (< .cse4 .cse32) (< .cse29 .cse53)) (or (< .cse19 .cse54) (< .cse55 .cse15)) (or (< .cse15 .cse20) (< .cse21 (+ .cse13 2 .cse14))) (or (< .cse2 .cse56) (< .cse57 .cse9)) (or (< .cse21 (+ 2 .cse14 .cse37)) (< .cse40 .cse20)) (or (< .cse51 .cse54) (< .cse55 .cse40)) (or (< .cse47 .cse3) (< .cse0 (+ 2 .cse58 .cse59))) (or (< .cse47 .cse56) (< .cse57 .cse51)) (or (< .cse49 .cse8) (< .cse9 .cse52)) (or (< .cse9 .cse56) (< .cse57 .cse19)) (or (< .cse7 .cse41) (< .cse42 .cse2)) (or (< .cse4 .cse26) (< .cse23 .cse53)) (or (< .cse9 .cse54) (< .cse55 .cse19)) (or (< .cse49 .cse22) (< .cse19 .cse52)) (or (< .cse28 .cse41) (< .cse42 .cse43))))) is different from false [2023-11-23 03:42:29,622 WARN L293 SmtUtils]: Spent 1.29m on a formula simplification. DAG size of input: 266 DAG size of output: 195 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15