./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 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-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 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 15:39:53,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 15:39:53,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 15:39:53,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 15:39:53,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 15:39:53,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 15:39:53,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 15:39:53,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 15:39:53,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 15:39:53,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 15:39:53,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 15:39:53,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 15:39:53,554 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 15:39:53,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 15:39:53,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 15:39:53,555 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 15:39:53,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 15:39:53,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 15:39:53,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 15:39:53,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 15:39:53,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 15:39:53,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 15:39:53,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 15:39:53,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 15:39:53,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 15:39:53,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 15:39:53,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 15:39:53,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 15:39:53,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 15:39:53,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 15:39:53,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 15:39:53,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 15:39:53,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 15:39:53,565 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 15:39:53,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 15:39:53,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 15:39:53,566 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 15:39:53,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 15:39:53,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 15:39:53,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 15:39:53,567 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 15:39:53,567 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP [2024-10-17 15:39:53,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 15:39:53,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 15:39:53,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 15:39:53,796 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 15:39:53,797 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 15:39:53,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-10-17 15:39:55,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 15:39:55,211 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 15:39:55,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-10-17 15:39:55,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3a894662b/022f3390a30a4823a4473c2b1c6bf43a/FLAG0421313ed [2024-10-17 15:39:55,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3a894662b/022f3390a30a4823a4473c2b1c6bf43a [2024-10-17 15:39:55,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 15:39:55,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 15:39:55,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 15:39:55,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 15:39:55,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 15:39:55,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca39fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55, skipping insertion in model container [2024-10-17 15:39:55,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 15:39:55,785 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1936,1949] [2024-10-17 15:39:55,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 15:39:55,794 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 15:39:55,807 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1936,1949] [2024-10-17 15:39:55,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 15:39:55,820 INFO L204 MainTranslator]: Completed translation [2024-10-17 15:39:55,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55 WrapperNode [2024-10-17 15:39:55,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 15:39:55,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 15:39:55,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 15:39:55,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 15:39:55,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,845 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-10-17 15:39:55,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 15:39:55,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 15:39:55,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 15:39:55,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 15:39:55,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 15:39:55,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 15:39:55,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 15:39:55,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 15:39:55,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (1/1) ... [2024-10-17 15:39:55,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 15:39:55,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 15:39:55,894 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-17 15:39:55,901 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-17 15:39:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 15:39:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 15:39:55,937 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 15:39:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 15:39:55,937 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 15:39:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 15:39:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 15:39:55,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 15:39:55,939 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 15:39:56,019 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 15:39:56,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 15:39:56,119 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 15:39:56,120 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 15:39:56,213 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 15:39:56,213 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-17 15:39:56,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 03:39:56 BoogieIcfgContainer [2024-10-17 15:39:56,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 15:39:56,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 15:39:56,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 15:39:56,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 15:39:56,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 03:39:55" (1/3) ... [2024-10-17 15:39:56,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b682789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 03:39:56, skipping insertion in model container [2024-10-17 15:39:56,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 03:39:55" (2/3) ... [2024-10-17 15:39:56,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b682789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 03:39:56, skipping insertion in model container [2024-10-17 15:39:56,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 03:39:56" (3/3) ... [2024-10-17 15:39:56,228 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2024-10-17 15:39:56,243 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 15:39:56,243 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 15:39:56,243 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 15:39:56,288 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-17 15:39:56,320 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 15:39:56,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 15:39:56,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 15:39:56,322 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-17 15:39:56,323 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-17 15:39:56,399 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 15:39:56,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 15:39:56,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 15:39:56,422 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;@50eb56fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 15:39:56,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-17 15:39:56,706 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-17 15:39:56,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 15:39:56,710 INFO L85 PathProgramCache]: Analyzing trace with hash -495857447, now seen corresponding path program 1 times [2024-10-17 15:39:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 15:39:56,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209372260] [2024-10-17 15:39:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 15:39:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 15:39:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 15:39:57,339 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-17 15:39:57,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 15:39:57,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209372260] [2024-10-17 15:39:57,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209372260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 15:39:57,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585688824] [2024-10-17 15:39:57,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 15:39:57,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 15:39:57,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 15:39:57,348 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-17 15:39:57,353 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-17 15:39:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 15:39:57,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-17 15:39:57,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 15:39:57,541 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-17 15:39:57,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 15:39:57,760 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-17 15:39:57,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585688824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 15:39:57,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 15:39:57,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2024-10-17 15:39:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316680756] [2024-10-17 15:39:57,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 15:39:57,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 15:39:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 15:39:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 15:39:57,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-10-17 15:39:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 15:39:57,791 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 15:39:57,792 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-17 15:39:57,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 15:39:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 15:39:57,897 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-17 15:39:58,088 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-17 15:39:58,089 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-17 15:39:58,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 15:39:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1736321302, now seen corresponding path program 1 times [2024-10-17 15:39:58,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 15:39:58,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366429513] [2024-10-17 15:39:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 15:39:58,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 15:39:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 15:39:59,023 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-17 15:39:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 15:39:59,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366429513] [2024-10-17 15:39:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366429513] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 15:39:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308025079] [2024-10-17 15:39:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 15:39:59,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 15:39:59,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 15:39:59,026 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-17 15:39:59,029 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-17 15:39:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 15:39:59,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-17 15:39:59,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 15:39:59,336 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-17 15:39:59,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 15:40:01,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (* (div c_~x_2~0 4294967296) 4294967296)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse4 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1)) (.cse7 (mod c_~x_2~0 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (forall ((v_z_10 Int)) (or (let ((.cse1 (* v_z_10 2))) (< (+ c_~x_2~0 .cse0 (* (div (+ .cse1 c_~x_1~0) 4294967296) 4294967296)) (+ .cse1 c_~x_1~0 4294967297 .cse2))) (< .cse3 v_z_10) (< v_z_10 .cse4))) (or (forall ((v_z_10 Int)) (or (let ((.cse5 (* v_z_10 2))) (< (+ .cse5 c_~x_1~0 4294967294 .cse2) (+ c_~x_2~0 (* (div (+ .cse5 c_~x_1~0) 4294967296) 4294967296) .cse6))) (< .cse3 v_z_10) (< v_z_10 .cse4))) (< (+ .cse0 .cse7) 4294967296)) (forall ((v_z_10 Int)) (or (< .cse3 v_z_10) (< v_z_10 .cse4) (let ((.cse8 (* v_z_10 2))) (< (+ .cse8 c_~x_1~0 .cse2) (+ c_~x_2~0 2 (* (div (+ .cse8 c_~x_1~0) 4294967296) 4294967296) .cse6))))) (or (forall ((v_z_10 Int)) (or (let ((.cse9 (* v_z_10 2))) (< (+ c_~x_2~0 .cse0 (* (div (+ .cse9 c_~x_1~0) 4294967296) 4294967296)) (+ .cse9 c_~x_1~0 .cse2 1))) (< .cse3 v_z_10) (< v_z_10 .cse4))) (< 4294967294 (+ .cse7 .cse6))))) is different from false [2024-10-17 15:40:02,104 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-17 15:40:02,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308025079] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 15:40:02,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 15:40:02,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2024-10-17 15:40:02,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402955462] [2024-10-17 15:40:02,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 15:40:02,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-17 15:40:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 15:40:02,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-17 15:40:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=301, Unknown=1, NotChecked=36, Total=420 [2024-10-17 15:40:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 15:40:02,107 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 15:40:02,108 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-17 15:40:02,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-17 15:40:02,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 15:40:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 15:40:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-17 15:40:02,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-17 15:40:03,093 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-17 15:40:03,094 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-17 15:40:03,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 15:40:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash -716089392, now seen corresponding path program 2 times [2024-10-17 15:40:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 15:40:03,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475359878] [2024-10-17 15:40:03,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 15:40:03,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 15:40:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 15:40:04,156 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-17 15:40:04,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 15:40:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475359878] [2024-10-17 15:40:04,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475359878] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 15:40:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393140501] [2024-10-17 15:40:04,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 15:40:04,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 15:40:04,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 15:40:04,163 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-17 15:40:04,183 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-17 15:40:04,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 15:40:04,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 15:40:04,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-17 15:40:04,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 15:40:05,179 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-17 15:40:05,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 15:40:07,687 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-17 15:40:07,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393140501] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 15:40:07,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 15:40:07,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 31 [2024-10-17 15:40:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788665278] [2024-10-17 15:40:07,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 15:40:07,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-17 15:40:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 15:40:07,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-17 15:40:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2024-10-17 15:40:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 15:40:07,690 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 15:40:07,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.46875) internal successors, (47), 31 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-17 15:40:07,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-17 15:40:07,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-17 15:40:07,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 15:40:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 15:40:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-17 15:40:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-17 15:40:21,346 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-17 15:40:21,534 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-17 15:40:21,535 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-17 15:40:21,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 15:40:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1533514172, now seen corresponding path program 3 times [2024-10-17 15:40:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 15:40:21,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313718822] [2024-10-17 15:40:21,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 15:40:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 15:40:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 15:42:11,531 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-17 15:42:11,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 15:42:11,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313718822] [2024-10-17 15:42:11,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313718822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 15:42:11,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814693965] [2024-10-17 15:42:11,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 15:42:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 15:42:11,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 15:42:11,534 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-17 15:42:11,535 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-17 15:42:11,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-17 15:42:11,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 15:42:11,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-17 15:42:11,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 15:42:12,908 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-17 15:42:12,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 15:42:22,746 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-17 15:42:22,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814693965] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 15:42:22,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 15:42:22,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 55 [2024-10-17 15:42:22,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880883077] [2024-10-17 15:42:22,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 15:42:22,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-17 15:42:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 15:42:22,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-17 15:42:22,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=2581, Unknown=0, NotChecked=0, Total=3080 [2024-10-17 15:42:22,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 15:42:22,755 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 15:42:22,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 55 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-17 15:42:22,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-17 15:42:22,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-17 15:42:22,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-17 15:42:22,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 15:42:24,948 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse38 (* 2 c_~b~0)) (.cse48 (* 2 c_~a~0)) (.cse45 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse54 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse13 (* 6 c_~b~0)) (.cse43 (* 6 c_~a~0)) (.cse10 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse53 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse28 (* 5 c_~b~0)) (.cse56 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse51 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse0 (* 3 c_~a~0)) (.cse25 (* 5 c_~a~0)) (.cse18 (* c_~b~0 4)) (.cse55 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse57 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse52 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse59 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse46 (mod c_~a~0 4294967296)) (.cse20 (* 4 c_~a~0)) (.cse3 (* 3 c_~b~0)) (.cse60 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse8 (mod c_~b~0 4294967296)) (.cse58 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (let ((.cse15 (< .cse8 (+ .cse58 1))) (.cse16 (< .cse60 .cse8)) (.cse1 (* 4294967296 (div (+ c_~x_2~0 .cse3) 4294967296))) (.cse19 (* (div (+ .cse20 c_~x_1~0) 4294967296) 4294967296)) (.cse5 (< .cse59 .cse46)) (.cse7 (< .cse46 (+ .cse52 1))) (.cse17 (< .cse57 .cse46)) (.cse24 (< .cse55 .cse8)) (.cse29 (< .cse8 (+ .cse60 1))) (.cse21 (* 4294967296 (div (+ .cse18 c_~x_2~0) 4294967296))) (.cse27 (* (div (+ c_~x_1~0 .cse25) 4294967296) 4294967296)) (.cse22 (< .cse46 (+ .cse59 1))) (.cse2 (* (div (+ c_~x_1~0 .cse0) 4294967296) 4294967296)) (.cse4 (< .cse8 (+ .cse51 1))) (.cse6 (< .cse58 .cse8)) (.cse23 (< .cse56 .cse46)) (.cse26 (* (div (+ c_~x_2~0 .cse28) 4294967296) 4294967296)) (.cse30 (< .cse46 (+ .cse57 1))) (.cse36 (* (div (+ c_~x_1~0 c_~a~0) 4294967296) 4294967296)) (.cse32 (< .cse8 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse34 (< .cse53 .cse8)) (.cse9 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296) .cse46)) (.cse11 (< .cse46 (+ .cse56 1))) (.cse41 (< .cse8 (+ .cse55 1))) (.cse44 (< .cse10 .cse8)) (.cse42 (* (div (+ .cse43 c_~x_1~0) 4294967296) 4294967296)) (.cse14 (* (div (+ c_~x_2~0 .cse13) 4294967296) 4294967296)) (.cse31 (< .cse54 .cse46)) (.cse35 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296)) (.cse33 (< .cse46 (+ .cse45 1))) (.cse37 (< .cse46 (+ .cse54 1))) (.cse47 (< .cse8 (+ .cse53 1))) (.cse49 (* (div (+ c_~x_1~0 .cse48) 4294967296) 4294967296)) (.cse39 (* (div (+ c_~x_2~0 .cse38) 4294967296) 4294967296)) (.cse40 (< .cse52 .cse46)) (.cse50 (< .cse51 .cse8))) (and (or (= (+ c_~x_1~0 .cse0 .cse1) (+ c_~x_2~0 .cse2 .cse3)) .cse4 .cse5 .cse6 .cse7) (or (< (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse8) .cse9 (< .cse8 (+ .cse10 1)) .cse11 (let ((.cse12 (* 7 c_~a~0))) (= (+ c_~x_2~0 (* (div (+ c_~x_1~0 .cse12) 4294967296) 4294967296) .cse13) (+ .cse14 c_~x_1~0 .cse12)))) (or .cse15 .cse16 .cse17 (= (+ .cse18 .cse19 c_~x_2~0) (+ .cse20 c_~x_1~0 .cse21)) .cse22) (or .cse15 .cse16 (= (+ .cse20 c_~x_1~0 .cse1) (+ .cse19 c_~x_2~0 .cse3)) .cse5 .cse7) (or .cse23 .cse24 (= (+ c_~x_1~0 .cse25 .cse26) (+ .cse27 c_~x_2~0 .cse28)) .cse29 .cse30) (or .cse17 .cse24 .cse29 (= (+ c_~x_1~0 .cse25 .cse21) (+ .cse18 .cse27 c_~x_2~0)) .cse22) (= c_~x_2~0 0) (or .cse31 .cse32 .cse33 .cse34 (= (+ .cse35 c_~x_1~0 c_~a~0) (+ c_~x_2~0 c_~b~0 .cse36))) (or .cse37 (= (+ c_~x_2~0 .cse2 .cse38) (+ .cse39 c_~x_1~0 .cse0)) .cse4 .cse40 .cse6) (or .cse41 .cse23 (= (+ c_~x_2~0 .cse42 .cse28) (+ .cse43 c_~x_1~0 .cse26)) .cse30 .cse44) (or (= (+ c_~x_2~0 .cse36) (+ c_~x_1~0 (* (div c_~x_2~0 4294967296) 4294967296) c_~a~0)) (< .cse45 .cse46) .cse32 .cse34) (or .cse9 .cse11 .cse41 .cse44 (= (+ c_~x_2~0 .cse13 .cse42) (+ .cse43 .cse14 c_~x_1~0))) (or .cse31 .cse47 (= (+ .cse35 c_~x_1~0 .cse48) (+ c_~x_2~0 .cse49 c_~b~0)) .cse33 .cse50) (= c_~x_1~0 0) (or .cse37 .cse47 (= (+ c_~x_2~0 .cse49 .cse38) (+ .cse39 c_~x_1~0 .cse48)) .cse40 .cse50)))) is different from false [2024-10-17 15:42:27,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse47 (* 2 c_~b~0)) (.cse57 (* 2 c_~a~0)) (.cse54 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse63 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse13 (* 6 c_~b~0)) (.cse52 (* 6 c_~a~0)) (.cse10 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse62 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse29 (* 5 c_~b~0)) (.cse65 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse60 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse0 (* 3 c_~a~0)) (.cse26 (* 5 c_~a~0)) (.cse18 (* c_~b~0 4)) (.cse64 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse66 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse61 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse68 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse55 (mod c_~a~0 4294967296)) (.cse20 (* 4 c_~a~0)) (.cse3 (* 3 c_~b~0)) (.cse69 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse8 (mod c_~b~0 4294967296)) (.cse67 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (let ((.cse15 (< .cse8 (+ .cse67 1))) (.cse16 (< .cse69 .cse8)) (.cse1 (* 4294967296 (div (+ c_~x_2~0 .cse3) 4294967296))) (.cse19 (* (div (+ .cse20 c_~x_1~0) 4294967296) 4294967296)) (.cse5 (< .cse68 .cse55)) (.cse7 (< .cse55 (+ .cse61 1))) (.cse23 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse17 (< .cse66 .cse55)) (.cse25 (< .cse64 .cse8)) (.cse30 (< .cse8 (+ .cse69 1))) (.cse21 (* 4294967296 (div (+ .cse18 c_~x_2~0) 4294967296))) (.cse28 (* (div (+ c_~x_1~0 .cse26) 4294967296) 4294967296)) (.cse22 (< .cse55 (+ .cse68 1))) (.cse2 (* (div (+ c_~x_1~0 .cse0) 4294967296) 4294967296)) (.cse4 (< .cse8 (+ .cse60 1))) (.cse6 (< .cse67 .cse8)) (.cse24 (< .cse65 .cse55)) (.cse27 (* (div (+ c_~x_2~0 .cse29) 4294967296) 4294967296)) (.cse31 (< .cse55 (+ .cse66 1))) (.cse45 (* (div (+ c_~x_1~0 c_~a~0) 4294967296) 4294967296)) (.cse34 (* (div c_~x_2~0 4294967296) 4294967296)) (.cse41 (< .cse8 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse43 (< .cse62 .cse8)) (.cse9 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296) .cse55)) (.cse11 (< .cse55 (+ .cse65 1))) (.cse50 (< .cse8 (+ .cse64 1))) (.cse53 (< .cse10 .cse8)) (.cse51 (* (div (+ .cse52 c_~x_1~0) 4294967296) 4294967296)) (.cse14 (* (div (+ c_~x_2~0 .cse13) 4294967296) 4294967296)) (.cse40 (< .cse63 .cse55)) (.cse44 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296)) (.cse42 (< .cse55 (+ .cse54 1))) (.cse46 (< .cse55 (+ .cse63 1))) (.cse56 (< .cse8 (+ .cse62 1))) (.cse58 (* (div (+ c_~x_1~0 .cse57) 4294967296) 4294967296)) (.cse48 (* (div (+ c_~x_2~0 .cse47) 4294967296) 4294967296)) (.cse49 (< .cse61 .cse55)) (.cse59 (< .cse60 .cse8))) (and (or (= (+ c_~x_1~0 .cse0 .cse1) (+ c_~x_2~0 .cse2 .cse3)) .cse4 .cse5 .cse6 .cse7) (or (< (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse8) .cse9 (< .cse8 (+ .cse10 1)) .cse11 (let ((.cse12 (* 7 c_~a~0))) (= (+ c_~x_2~0 (* (div (+ c_~x_1~0 .cse12) 4294967296) 4294967296) .cse13) (+ .cse14 c_~x_1~0 .cse12)))) (or .cse15 .cse16 .cse17 (= (+ .cse18 .cse19 c_~x_2~0) (+ .cse20 c_~x_1~0 .cse21)) .cse22) (or .cse15 .cse16 (= (+ .cse20 c_~x_1~0 .cse1) (+ .cse19 c_~x_2~0 .cse3)) .cse5 .cse7) (<= 0 .cse23) (or .cse24 .cse25 (= (+ c_~x_1~0 .cse26 .cse27) (+ .cse28 c_~x_2~0 .cse29)) .cse30 .cse31) (let ((.cse32 (* 7 c_thread1Thread1of1ForFork0_~i~0)) (.cse33 (* 30064771072 (div c_~b~0 4294967296))) (.cse38 (* 4294967296 (div c_~x_1~0 4294967296))) (.cse39 (* .cse23 30064771072)) (.cse35 (* 7 c_~b~0))) (or (< (+ c_~x_2~0 .cse32 .cse33 4294967190) (+ .cse34 .cse35)) (let ((.cse36 (+ c_~x_1~0 .cse34)) (.cse37 (+ c_~x_2~0 .cse38))) (and (<= .cse36 .cse37) (or (< (+ c_~x_2~0 .cse32 .cse33 .cse38) (+ c_~x_1~0 .cse39 .cse34 1 .cse35)) (= .cse36 .cse37)))) (< (+ 4294967345 .cse32 .cse33 .cse38) (+ c_~x_1~0 .cse39 .cse35)))) (or .cse17 .cse25 .cse30 (= (+ c_~x_1~0 .cse26 .cse21) (+ .cse18 .cse28 c_~x_2~0)) .cse22) (or .cse40 .cse41 .cse42 .cse43 (= (+ .cse44 c_~x_1~0 c_~a~0) (+ c_~x_2~0 c_~b~0 .cse45))) (or .cse46 (= (+ c_~x_2~0 .cse2 .cse47) (+ .cse48 c_~x_1~0 .cse0)) .cse4 .cse49 .cse6) (or .cse50 .cse24 (= (+ c_~x_2~0 .cse51 .cse29) (+ .cse52 c_~x_1~0 .cse27)) .cse31 .cse53) (or (= (+ c_~x_2~0 .cse45) (+ c_~x_1~0 .cse34 c_~a~0)) (< .cse54 .cse55) .cse41 .cse43) (or .cse9 .cse11 .cse50 .cse53 (= (+ c_~x_2~0 .cse13 .cse51) (+ .cse52 .cse14 c_~x_1~0))) (or .cse40 .cse56 (= (+ .cse44 c_~x_1~0 .cse57) (+ c_~x_2~0 .cse58 c_~b~0)) .cse42 .cse59) (or .cse46 .cse56 (= (+ c_~x_2~0 .cse58 .cse47) (+ .cse48 c_~x_1~0 .cse57)) .cse49 .cse59)))) is different from false [2024-10-17 15:42:54,967 WARN L286 SmtUtils]: Spent 24.33s on a formula simplification. DAG size of input: 211 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 15:43:12,415 WARN L286 SmtUtils]: Spent 11.67s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 15:44:22,866 WARN L286 SmtUtils]: Spent 1.11m on a formula simplification. DAG size of input: 236 DAG size of output: 215 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 15:44:25,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse38 (* 2 c_~b~0)) (.cse48 (* 2 c_~a~0)) (.cse45 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse54 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse13 (* 6 c_~b~0)) (.cse43 (* 6 c_~a~0)) (.cse10 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse53 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse28 (* 5 c_~b~0)) (.cse56 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse51 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse0 (* 3 c_~a~0)) (.cse25 (* 5 c_~a~0)) (.cse18 (* c_~b~0 4)) (.cse55 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse57 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse52 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse59 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse46 (mod c_~a~0 4294967296)) (.cse20 (* 4 c_~a~0)) (.cse3 (* 3 c_~b~0)) (.cse60 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse8 (mod c_~b~0 4294967296)) (.cse58 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (let ((.cse15 (< .cse8 (+ .cse58 1))) (.cse16 (< .cse60 .cse8)) (.cse1 (* 4294967296 (div (+ c_~x_2~0 .cse3) 4294967296))) (.cse19 (* (div (+ .cse20 c_~x_1~0) 4294967296) 4294967296)) (.cse5 (< .cse59 .cse46)) (.cse7 (< .cse46 (+ .cse52 1))) (.cse17 (< .cse57 .cse46)) (.cse24 (< .cse55 .cse8)) (.cse29 (< .cse8 (+ .cse60 1))) (.cse21 (* 4294967296 (div (+ .cse18 c_~x_2~0) 4294967296))) (.cse27 (* (div (+ c_~x_1~0 .cse25) 4294967296) 4294967296)) (.cse22 (< .cse46 (+ .cse59 1))) (.cse2 (* (div (+ c_~x_1~0 .cse0) 4294967296) 4294967296)) (.cse4 (< .cse8 (+ .cse51 1))) (.cse6 (< .cse58 .cse8)) (.cse23 (< .cse56 .cse46)) (.cse26 (* (div (+ c_~x_2~0 .cse28) 4294967296) 4294967296)) (.cse30 (< .cse46 (+ .cse57 1))) (.cse36 (* (div (+ c_~x_1~0 c_~a~0) 4294967296) 4294967296)) (.cse32 (< .cse8 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse34 (< .cse53 .cse8)) (.cse9 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296) .cse46)) (.cse11 (< .cse46 (+ .cse56 1))) (.cse41 (< .cse8 (+ .cse55 1))) (.cse44 (< .cse10 .cse8)) (.cse42 (* (div (+ .cse43 c_~x_1~0) 4294967296) 4294967296)) (.cse14 (* (div (+ c_~x_2~0 .cse13) 4294967296) 4294967296)) (.cse31 (< .cse54 .cse46)) (.cse35 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296)) (.cse33 (< .cse46 (+ .cse45 1))) (.cse37 (< .cse46 (+ .cse54 1))) (.cse47 (< .cse8 (+ .cse53 1))) (.cse49 (* (div (+ c_~x_1~0 .cse48) 4294967296) 4294967296)) (.cse39 (* (div (+ c_~x_2~0 .cse38) 4294967296) 4294967296)) (.cse40 (< .cse52 .cse46)) (.cse50 (< .cse51 .cse8))) (and (or (= (+ c_~x_1~0 .cse0 .cse1) (+ c_~x_2~0 .cse2 .cse3)) .cse4 .cse5 .cse6 .cse7) (or (< (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse8) .cse9 (< .cse8 (+ .cse10 1)) .cse11 (let ((.cse12 (* 7 c_~a~0))) (= (+ c_~x_2~0 (* (div (+ c_~x_1~0 .cse12) 4294967296) 4294967296) .cse13) (+ .cse14 c_~x_1~0 .cse12)))) (or .cse15 .cse16 .cse17 (= (+ .cse18 .cse19 c_~x_2~0) (+ .cse20 c_~x_1~0 .cse21)) .cse22) (or .cse15 .cse16 (= (+ .cse20 c_~x_1~0 .cse1) (+ .cse19 c_~x_2~0 .cse3)) .cse5 .cse7) (or .cse23 .cse24 (= (+ c_~x_1~0 .cse25 .cse26) (+ .cse27 c_~x_2~0 .cse28)) .cse29 .cse30) (or .cse17 .cse24 .cse29 (= (+ c_~x_1~0 .cse25 .cse21) (+ .cse18 .cse27 c_~x_2~0)) .cse22) (or .cse31 .cse32 .cse33 .cse34 (= (+ .cse35 c_~x_1~0 c_~a~0) (+ c_~x_2~0 c_~b~0 .cse36))) (or .cse37 (= (+ c_~x_2~0 .cse2 .cse38) (+ .cse39 c_~x_1~0 .cse0)) .cse4 .cse40 .cse6) (or .cse41 .cse23 (= (+ c_~x_2~0 .cse42 .cse28) (+ .cse43 c_~x_1~0 .cse26)) .cse30 .cse44) (or (= (+ c_~x_2~0 .cse36) (+ c_~x_1~0 (* (div c_~x_2~0 4294967296) 4294967296) c_~a~0)) (< .cse45 .cse46) .cse32 .cse34) (or .cse9 .cse11 .cse41 .cse44 (= (+ c_~x_2~0 .cse13 .cse42) (+ .cse43 .cse14 c_~x_1~0))) (or .cse31 .cse47 (= (+ .cse35 c_~x_1~0 .cse48) (+ c_~x_2~0 .cse49 c_~b~0)) .cse33 .cse50) (or .cse37 .cse47 (= (+ c_~x_2~0 .cse49 .cse38) (+ .cse39 c_~x_1~0 .cse48)) .cse40 .cse50)))) is different from false [2024-10-17 15:44:56,983 WARN L286 SmtUtils]: Spent 25.70s on a formula simplification that was a NOOP. DAG size: 196 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 15:45:54,795 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-17 15:45:56,799 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-17 15:45:58,869 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-17 15:46:08,609 WARN L286 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 15:46:10,622 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-17 15:46:12,686 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-17 15:46:14,690 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-17 15:46:15,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 15:46:48,355 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-17 15:46:50,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 15:46:53,139 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-17 15:46:55,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 15:46:58,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 15:47:04,173 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-17 15:47:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 15:47:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-17 15:47:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-17 15:47:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-17 15:47:15,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-17 15:47:15,288 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-17 15:47:15,288 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-17 15:47:15,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 15:47:15,289 INFO L85 PathProgramCache]: Analyzing trace with hash -725647572, now seen corresponding path program 4 times [2024-10-17 15:47:15,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 15:47:15,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243664565] [2024-10-17 15:47:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 15:47:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 15:47:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 15:47:17,946 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-17 15:47:17,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 15:47:17,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243664565] [2024-10-17 15:47:17,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243664565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 15:47:17,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137515601] [2024-10-17 15:47:17,946 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 15:47:17,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 15:47:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 15:47:17,948 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-17 15:47:17,949 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-17 15:47:18,067 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 15:47:18,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 15:47:18,073 WARN L253 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-17 15:47:18,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 15:47:22,282 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-17 15:47:22,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 15:48:04,744 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-17 15:48:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137515601] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 15:48:04,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 15:48:04,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 36] total 103 [2024-10-17 15:48:04,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766979550] [2024-10-17 15:48:04,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 15:48:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-10-17 15:48:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 15:48:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-10-17 15:48:04,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1954, Invalid=8757, Unknown=1, NotChecked=0, Total=10712 [2024-10-17 15:48:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 15:48:04,758 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 15:48:04,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 103 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-17 15:48:04,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-17 15:48:04,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-17 15:48:04,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-17 15:48:04,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-10-17 15:48:04,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 15:48:07,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse105 (* 14 c_~b~0)) (.cse87 (* 2 c_~b~0)) (.cse101 (* 2 c_~a~0)) (.cse56 (* 9 c_~b~0)) (.cse109 (* 9 c_~a~0)) (.cse9 (* 12 c_~a~0)) (.cse14 (* c_~b~0 11)) (.cse125 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse115 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse32 (* c_~b~0 13)) (.cse5 (* 13 c_~a~0)) (.cse122 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse97 (* c_~b~0 8)) (.cse114 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse30 (* 14 c_~a~0)) (.cse129 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse130 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse74 (* 7 c_~b~0)) (.cse43 (* 7 c_~a~0)) (.cse94 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse119 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse41 (* 6 c_~b~0)) (.cse92 (* 6 c_~a~0)) (.cse132 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse131 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse123 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse133 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse75 (* 8 c_~a~0)) (.cse118 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse69 (* 5 c_~b~0)) (.cse135 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse116 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse20 (* 3 c_~a~0)) (.cse66 (* 5 c_~a~0)) (.cse47 (* c_~b~0 4)) (.cse134 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse136 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse120 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse59 (* 10 c_~a~0)) (.cse61 (* c_~b~0 10)) (.cse124 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse121 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse140 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse13 (* 11 c_~a~0)) (.cse127 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse117 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse138 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse49 (* 4 c_~a~0)) (.cse23 (* 3 c_~b~0)) (.cse139 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse113 (mod c_~b~0 4294967296)) (.cse137 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse128 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse3 (* c_~b~0 12)) (.cse95 (mod c_~a~0 4294967296)) (.cse126 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296))) (let ((.cse1 (< .cse95 (+ .cse126 1))) (.cse4 (* (div (+ c_~x_2~0 .cse3) 4294967296) 4294967296)) (.cse6 (< .cse128 .cse95)) (.cse44 (< .cse113 (+ .cse137 1))) (.cse45 (< .cse139 .cse113)) (.cse21 (* 4294967296 (div (+ c_~x_2~0 .cse23) 4294967296))) (.cse48 (* (div (+ .cse49 c_~x_1~0) 4294967296) 4294967296)) (.cse25 (< .cse138 .cse95)) (.cse27 (< .cse95 (+ .cse117 1))) (.cse16 (< .cse127 .cse113)) (.cse15 (* (div (+ c_~x_1~0 .cse13) 4294967296) 4294967296)) (.cse18 (< .cse113 (+ .cse140 1))) (.cse60 (< .cse95 (+ .cse121 1))) (.cse63 (< .cse124 .cse95)) (.cse62 (* (div (+ c_~x_2~0 .cse61) 4294967296) 4294967296)) (.cse57 (* (div (+ c_~x_1~0 .cse59) 4294967296) 4294967296)) (.cse53 (< .cse113 (+ .cse120 1))) (.cse55 (< .cse140 .cse113)) (.cse46 (< .cse136 .cse95)) (.cse65 (< .cse134 .cse113)) (.cse70 (< .cse113 (+ .cse139 1))) (.cse50 (* 4294967296 (div (+ .cse47 c_~x_2~0) 4294967296))) (.cse68 (* (div (+ c_~x_1~0 .cse66) 4294967296) 4294967296)) (.cse51 (< .cse95 (+ .cse138 1))) (.cse22 (* (div (+ c_~x_1~0 .cse20) 4294967296) 4294967296)) (.cse24 (< .cse113 (+ .cse116 1))) (.cse26 (< .cse137 .cse113)) (.cse64 (< .cse135 .cse95)) (.cse67 (* (div (+ c_~x_2~0 .cse69) 4294967296) 4294967296)) (.cse71 (< .cse95 (+ .cse136 1))) (.cse85 (* (div (+ c_~x_1~0 c_~a~0) 4294967296) 4294967296)) (.cse81 (< .cse113 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse83 (< .cse118 .cse113)) (.cse73 (* (div (+ .cse75 c_~x_1~0) 4294967296) 4294967296)) (.cse72 (< .cse113 (+ .cse133 1))) (.cse79 (< .cse123 .cse113)) (.cse37 (< .cse131 .cse95)) (.cse39 (< .cse95 (+ .cse135 1))) (.cse90 (< .cse113 (+ .cse134 1))) (.cse93 (< .cse132 .cse113)) (.cse91 (* (div (+ .cse92 c_~x_1~0) 4294967296) 4294967296)) (.cse42 (* (div (+ c_~x_2~0 .cse41) 4294967296) 4294967296)) (.cse80 (< .cse119 .cse95)) (.cse84 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296)) (.cse82 (< .cse95 (+ .cse94 1))) (.cse36 (< .cse133 .cse113)) (.cse38 (< .cse113 (+ .cse132 1))) (.cse40 (* (div (+ c_~x_1~0 .cse43) 4294967296) 4294967296)) (.cse76 (* 4294967296 (div (+ c_~x_2~0 .cse74) 4294967296))) (.cse77 (< .cse130 .cse95)) (.cse78 (< .cse95 (+ .cse131 1))) (.cse28 (< .cse113 (+ .cse129 1))) (.cse31 (* 4294967296 (div (+ c_~x_1~0 .cse30) 4294967296))) (.cse33 (< .cse114 .cse113)) (.cse96 (* (div (+ .cse97 c_~x_2~0) 4294967296) 4294967296)) (.cse98 (< .cse122 .cse95)) (.cse99 (< .cse95 (+ .cse130 1))) (.cse0 (< .cse129 .cse113)) (.cse2 (* (div (+ c_~x_1~0 .cse5) 4294967296) 4294967296)) (.cse29 (* (div (+ c_~x_2~0 .cse32) 4294967296) 4294967296)) (.cse34 (< .cse115 .cse95)) (.cse35 (< .cse95 (+ .cse128 1))) (.cse7 (< .cse113 (+ .cse125 1))) (.cse8 (< .cse113 (+ .cse127 1))) (.cse12 (* (div (+ c_~x_2~0 .cse14) 4294967296) 4294967296)) (.cse10 (* (div (+ c_~x_1~0 .cse9) 4294967296) 4294967296)) (.cse17 (< .cse126 .cse95)) (.cse11 (< .cse125 .cse113)) (.cse19 (< .cse95 (+ .cse124 1))) (.cse108 (* (div (+ .cse109 c_~x_1~0) 4294967296) 4294967296)) (.cse58 (* (div (+ c_~x_2~0 .cse56) 4294967296) 4294967296)) (.cse110 (< .cse113 (+ .cse123 1))) (.cse52 (< .cse95 (+ .cse122 1))) (.cse54 (< .cse121 .cse95)) (.cse111 (< .cse120 .cse113)) (.cse86 (< .cse95 (+ .cse119 1))) (.cse100 (< .cse113 (+ .cse118 1))) (.cse102 (* (div (+ c_~x_1~0 .cse101) 4294967296) 4294967296)) (.cse88 (* (div (+ c_~x_2~0 .cse87) 4294967296) 4294967296)) (.cse89 (< .cse117 .cse95)) (.cse103 (< .cse116 .cse113)) (.cse104 (* 4294967296 (div (+ c_~x_2~0 .cse105) 4294967296))) (.cse106 (< .cse95 (+ .cse115 1))) (.cse107 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse95))) (and (or .cse0 .cse1 (= (+ c_~x_2~0 .cse2 .cse3) (+ c_~x_1~0 .cse4 .cse5)) .cse6 .cse7) (or .cse8 .cse1 (= (+ c_~x_1~0 .cse4 .cse9) (+ c_~x_2~0 .cse3 .cse10)) .cse11 .cse6) (or (= (+ c_~x_1~0 .cse12 .cse13) (+ c_~x_2~0 .cse14 .cse15)) .cse16 .cse17 .cse18 .cse19) (or (= (+ c_~x_1~0 .cse20 .cse21) (+ c_~x_2~0 .cse22 .cse23)) .cse24 .cse25 .cse26 .cse27) (or .cse28 (= (+ .cse29 c_~x_1~0 .cse30) (+ c_~x_2~0 .cse31 .cse32)) .cse33 .cse34 .cse35) (or .cse36 .cse37 .cse38 .cse39 (= (+ c_~x_2~0 .cse40 .cse41) (+ .cse42 c_~x_1~0 .cse43))) (or .cse44 .cse45 .cse46 (= (+ .cse47 .cse48 c_~x_2~0) (+ .cse49 c_~x_1~0 .cse50)) .cse51) (or .cse44 .cse45 (= (+ .cse49 c_~x_1~0 .cse21) (+ .cse48 c_~x_2~0 .cse23)) .cse25 .cse27) (or .cse52 .cse53 .cse54 .cse55 (= (+ c_~x_2~0 .cse56 .cse57) (+ .cse58 c_~x_1~0 .cse59))) (or .cse60 .cse16 (= (+ c_~x_2~0 .cse61 .cse15) (+ .cse62 c_~x_1~0 .cse13)) .cse63 .cse18) (or .cse64 .cse65 (= (+ c_~x_1~0 .cse66 .cse67) (+ .cse68 c_~x_2~0 .cse69)) .cse70 .cse71) (or .cse72 (= (+ c_~x_2~0 .cse73 .cse74) (+ .cse75 c_~x_1~0 .cse76)) .cse77 .cse78 .cse79) (or .cse60 .cse63 (= (+ .cse62 c_~x_1~0 .cse59) (+ c_~x_2~0 .cse61 .cse57)) .cse53 .cse55) (or .cse46 .cse65 .cse70 (= (+ c_~x_1~0 .cse66 .cse50) (+ .cse47 .cse68 c_~x_2~0)) .cse51) (= c_~x_2~0 0) (or .cse80 .cse81 .cse82 .cse83 (= (+ .cse84 c_~x_1~0 c_~a~0) (+ c_~x_2~0 c_~b~0 .cse85))) (or .cse86 (= (+ c_~x_2~0 .cse22 .cse87) (+ .cse88 c_~x_1~0 .cse20)) .cse24 .cse89 .cse26) (or .cse90 .cse64 (= (+ c_~x_2~0 .cse91 .cse69) (+ .cse92 c_~x_1~0 .cse67)) .cse71 .cse93) (or (= (+ c_~x_2~0 .cse85) (+ c_~x_1~0 (* (div c_~x_2~0 4294967296) 4294967296) c_~a~0)) (< .cse94 .cse95) .cse81 .cse83) (or (= (+ .cse75 c_~x_1~0 .cse96) (+ .cse97 c_~x_2~0 .cse73)) .cse72 .cse98 .cse99 .cse79) (or .cse37 .cse39 .cse90 .cse93 (= (+ c_~x_2~0 .cse41 .cse91) (+ .cse92 .cse42 c_~x_1~0))) (or .cse80 .cse100 (= (+ .cse84 c_~x_1~0 .cse101) (+ c_~x_2~0 .cse102 c_~b~0)) .cse82 .cse103) (or .cse36 .cse38 (= (+ c_~x_2~0 .cse40 .cse74) (+ c_~x_1~0 .cse43 .cse76)) .cse77 .cse78) (or .cse28 (= (+ .cse104 c_~x_1~0 .cse30) (+ c_~x_2~0 .cse31 .cse105)) .cse106 .cse33 .cse107) (or (= (+ .cse97 c_~x_2~0 .cse108) (+ .cse109 c_~x_1~0 .cse96)) .cse110 .cse98 .cse111 .cse99) (= c_~x_1~0 0) (or .cse0 (= (+ c_~x_2~0 .cse32 .cse2) (+ .cse29 c_~x_1~0 .cse5)) .cse34 .cse35 .cse7) (or .cse8 (= (+ c_~x_1~0 .cse12 .cse9) (+ c_~x_2~0 .cse14 .cse10)) .cse17 .cse11 .cse19) (or (= (+ c_~x_2~0 .cse56 .cse108) (+ .cse58 .cse109 c_~x_1~0)) .cse110 .cse52 .cse54 .cse111) (or .cse86 .cse100 (= (+ c_~x_2~0 .cse102 .cse87) (+ .cse88 c_~x_1~0 .cse101)) .cse89 .cse103) (or (let ((.cse112 (* 15 c_~a~0))) (= (+ .cse104 c_~x_1~0 .cse112) (+ c_~x_2~0 .cse105 (* (div (+ c_~x_1~0 .cse112) 4294967296) 4294967296)))) (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse113) .cse106 (< .cse113 (+ .cse114 1)) .cse107)))) is different from false [2024-10-17 15:48:10,056 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse114 (* 14 c_~b~0)) (.cse88 (* 2 c_~b~0)) (.cse110 (* 2 c_~a~0)) (.cse56 (* 9 c_~b~0)) (.cse118 (* 9 c_~a~0)) (.cse9 (* 12 c_~a~0)) (.cse14 (* c_~b~0 11)) (.cse134 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse124 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse32 (* c_~b~0 13)) (.cse5 (* 13 c_~a~0)) (.cse131 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse106 (* c_~b~0 8)) (.cse123 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse30 (* 14 c_~a~0)) (.cse138 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse139 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse75 (* 7 c_~b~0)) (.cse43 (* 7 c_~a~0)) (.cse103 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse128 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse41 (* 6 c_~b~0)) (.cse93 (* 6 c_~a~0)) (.cse141 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse140 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse132 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse142 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse76 (* 8 c_~a~0)) (.cse127 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse70 (* 5 c_~b~0)) (.cse144 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse125 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse20 (* 3 c_~a~0)) (.cse67 (* 5 c_~a~0)) (.cse47 (* c_~b~0 4)) (.cse143 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse145 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse129 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse59 (* 10 c_~a~0)) (.cse62 (* c_~b~0 10)) (.cse133 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse130 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse149 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse13 (* 11 c_~a~0)) (.cse136 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse126 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse147 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse49 (* 4 c_~a~0)) (.cse23 (* 3 c_~b~0)) (.cse148 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse122 (mod c_~b~0 4294967296)) (.cse146 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse137 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse3 (* c_~b~0 12)) (.cse104 (mod c_~a~0 4294967296)) (.cse135 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296))) (let ((.cse1 (< .cse104 (+ .cse135 1))) (.cse4 (* (div (+ c_~x_2~0 .cse3) 4294967296) 4294967296)) (.cse6 (< .cse137 .cse104)) (.cse44 (< .cse122 (+ .cse146 1))) (.cse45 (< .cse148 .cse122)) (.cse21 (* 4294967296 (div (+ c_~x_2~0 .cse23) 4294967296))) (.cse48 (* (div (+ .cse49 c_~x_1~0) 4294967296) 4294967296)) (.cse25 (< .cse147 .cse104)) (.cse27 (< .cse104 (+ .cse126 1))) (.cse16 (< .cse136 .cse122)) (.cse15 (* (div (+ c_~x_1~0 .cse13) 4294967296) 4294967296)) (.cse18 (< .cse122 (+ .cse149 1))) (.cse61 (< .cse104 (+ .cse130 1))) (.cse64 (< .cse133 .cse104)) (.cse63 (* (div (+ c_~x_2~0 .cse62) 4294967296) 4294967296)) (.cse57 (* (div (+ c_~x_1~0 .cse59) 4294967296) 4294967296)) (.cse53 (< .cse122 (+ .cse129 1))) (.cse55 (< .cse149 .cse122)) (.cse46 (< .cse145 .cse104)) (.cse66 (< .cse143 .cse122)) (.cse71 (< .cse122 (+ .cse148 1))) (.cse50 (* 4294967296 (div (+ .cse47 c_~x_2~0) 4294967296))) (.cse69 (* (div (+ c_~x_1~0 .cse67) 4294967296) 4294967296)) (.cse51 (< .cse104 (+ .cse147 1))) (.cse22 (* (div (+ c_~x_1~0 .cse20) 4294967296) 4294967296)) (.cse24 (< .cse122 (+ .cse125 1))) (.cse26 (< .cse146 .cse122)) (.cse65 (< .cse144 .cse104)) (.cse68 (* (div (+ c_~x_2~0 .cse70) 4294967296) 4294967296)) (.cse72 (< .cse104 (+ .cse145 1))) (.cse60 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse86 (* (div (+ c_~x_1~0 c_~a~0) 4294967296) 4294967296)) (.cse97 (* (div c_~x_2~0 4294967296) 4294967296)) (.cse82 (< .cse122 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse84 (< .cse127 .cse122)) (.cse74 (* (div (+ .cse76 c_~x_1~0) 4294967296) 4294967296)) (.cse73 (< .cse122 (+ .cse142 1))) (.cse80 (< .cse132 .cse122)) (.cse37 (< .cse140 .cse104)) (.cse39 (< .cse104 (+ .cse144 1))) (.cse91 (< .cse122 (+ .cse143 1))) (.cse94 (< .cse141 .cse122)) (.cse92 (* (div (+ .cse93 c_~x_1~0) 4294967296) 4294967296)) (.cse42 (* (div (+ c_~x_2~0 .cse41) 4294967296) 4294967296)) (.cse81 (< .cse128 .cse104)) (.cse85 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296)) (.cse83 (< .cse104 (+ .cse103 1))) (.cse36 (< .cse142 .cse122)) (.cse38 (< .cse122 (+ .cse141 1))) (.cse40 (* (div (+ c_~x_1~0 .cse43) 4294967296) 4294967296)) (.cse77 (* 4294967296 (div (+ c_~x_2~0 .cse75) 4294967296))) (.cse78 (< .cse139 .cse104)) (.cse79 (< .cse104 (+ .cse140 1))) (.cse28 (< .cse122 (+ .cse138 1))) (.cse31 (* 4294967296 (div (+ c_~x_1~0 .cse30) 4294967296))) (.cse33 (< .cse123 .cse122)) (.cse105 (* (div (+ .cse106 c_~x_2~0) 4294967296) 4294967296)) (.cse107 (< .cse131 .cse104)) (.cse108 (< .cse104 (+ .cse139 1))) (.cse0 (< .cse138 .cse122)) (.cse2 (* (div (+ c_~x_1~0 .cse5) 4294967296) 4294967296)) (.cse29 (* (div (+ c_~x_2~0 .cse32) 4294967296) 4294967296)) (.cse34 (< .cse124 .cse104)) (.cse35 (< .cse104 (+ .cse137 1))) (.cse7 (< .cse122 (+ .cse134 1))) (.cse8 (< .cse122 (+ .cse136 1))) (.cse12 (* (div (+ c_~x_2~0 .cse14) 4294967296) 4294967296)) (.cse10 (* (div (+ c_~x_1~0 .cse9) 4294967296) 4294967296)) (.cse17 (< .cse135 .cse104)) (.cse11 (< .cse134 .cse122)) (.cse19 (< .cse104 (+ .cse133 1))) (.cse117 (* (div (+ .cse118 c_~x_1~0) 4294967296) 4294967296)) (.cse58 (* (div (+ c_~x_2~0 .cse56) 4294967296) 4294967296)) (.cse119 (< .cse122 (+ .cse132 1))) (.cse52 (< .cse104 (+ .cse131 1))) (.cse54 (< .cse130 .cse104)) (.cse120 (< .cse129 .cse122)) (.cse87 (< .cse104 (+ .cse128 1))) (.cse109 (< .cse122 (+ .cse127 1))) (.cse111 (* (div (+ c_~x_1~0 .cse110) 4294967296) 4294967296)) (.cse89 (* (div (+ c_~x_2~0 .cse88) 4294967296) 4294967296)) (.cse90 (< .cse126 .cse104)) (.cse112 (< .cse125 .cse122)) (.cse113 (* 4294967296 (div (+ c_~x_2~0 .cse114) 4294967296))) (.cse115 (< .cse104 (+ .cse124 1))) (.cse116 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse104))) (and (or .cse0 .cse1 (= (+ c_~x_2~0 .cse2 .cse3) (+ c_~x_1~0 .cse4 .cse5)) .cse6 .cse7) (or .cse8 .cse1 (= (+ c_~x_1~0 .cse4 .cse9) (+ c_~x_2~0 .cse3 .cse10)) .cse11 .cse6) (or (= (+ c_~x_1~0 .cse12 .cse13) (+ c_~x_2~0 .cse14 .cse15)) .cse16 .cse17 .cse18 .cse19) (or (= (+ c_~x_1~0 .cse20 .cse21) (+ c_~x_2~0 .cse22 .cse23)) .cse24 .cse25 .cse26 .cse27) (or .cse28 (= (+ .cse29 c_~x_1~0 .cse30) (+ c_~x_2~0 .cse31 .cse32)) .cse33 .cse34 .cse35) (or .cse36 .cse37 .cse38 .cse39 (= (+ c_~x_2~0 .cse40 .cse41) (+ .cse42 c_~x_1~0 .cse43))) (or .cse44 .cse45 .cse46 (= (+ .cse47 .cse48 c_~x_2~0) (+ .cse49 c_~x_1~0 .cse50)) .cse51) (or .cse44 .cse45 (= (+ .cse49 c_~x_1~0 .cse21) (+ .cse48 c_~x_2~0 .cse23)) .cse25 .cse27) (or .cse52 .cse53 .cse54 .cse55 (= (+ c_~x_2~0 .cse56 .cse57) (+ .cse58 c_~x_1~0 .cse59))) (<= 0 .cse60) (or .cse61 .cse16 (= (+ c_~x_2~0 .cse62 .cse15) (+ .cse63 c_~x_1~0 .cse13)) .cse64 .cse18) (or .cse65 .cse66 (= (+ c_~x_1~0 .cse67 .cse68) (+ .cse69 c_~x_2~0 .cse70)) .cse71 .cse72) (or .cse73 (= (+ c_~x_2~0 .cse74 .cse75) (+ .cse76 c_~x_1~0 .cse77)) .cse78 .cse79 .cse80) (or .cse61 .cse64 (= (+ .cse63 c_~x_1~0 .cse59) (+ c_~x_2~0 .cse62 .cse57)) .cse53 .cse55) (or .cse46 .cse66 .cse71 (= (+ c_~x_1~0 .cse67 .cse50) (+ .cse47 .cse69 c_~x_2~0)) .cse51) (or .cse81 .cse82 .cse83 .cse84 (= (+ .cse85 c_~x_1~0 c_~a~0) (+ c_~x_2~0 c_~b~0 .cse86))) (or .cse87 (= (+ c_~x_2~0 .cse22 .cse88) (+ .cse89 c_~x_1~0 .cse20)) .cse24 .cse90 .cse26) (or .cse91 .cse65 (= (+ c_~x_2~0 .cse92 .cse70) (+ .cse93 c_~x_1~0 .cse68)) .cse72 .cse94) (let ((.cse95 (* 64424509440 (div c_~b~0 4294967296))) (.cse96 (* 15 c_thread1Thread1of1ForFork0_~i~0)) (.cse101 (* 4294967296 (div c_~x_1~0 4294967296))) (.cse102 (* .cse60 64424509440)) (.cse98 (* c_~b~0 15))) (or (< (+ 4294966830 .cse95 c_~x_2~0 .cse96) (+ .cse97 .cse98)) (let ((.cse99 (+ c_~x_1~0 .cse97)) (.cse100 (+ c_~x_2~0 .cse101))) (and (<= .cse99 .cse100) (or (= .cse99 .cse100) (< (+ .cse95 c_~x_2~0 .cse96 .cse101) (+ .cse102 c_~x_1~0 .cse97 1 .cse98))))) (< (+ .cse95 .cse96 4294967521 .cse101) (+ .cse102 c_~x_1~0 .cse98)))) (or (= (+ c_~x_2~0 .cse86) (+ c_~x_1~0 .cse97 c_~a~0)) (< .cse103 .cse104) .cse82 .cse84) (or (= (+ .cse76 c_~x_1~0 .cse105) (+ .cse106 c_~x_2~0 .cse74)) .cse73 .cse107 .cse108 .cse80) (or .cse37 .cse39 .cse91 .cse94 (= (+ c_~x_2~0 .cse41 .cse92) (+ .cse93 .cse42 c_~x_1~0))) (or .cse81 .cse109 (= (+ .cse85 c_~x_1~0 .cse110) (+ c_~x_2~0 .cse111 c_~b~0)) .cse83 .cse112) (or .cse36 .cse38 (= (+ c_~x_2~0 .cse40 .cse75) (+ c_~x_1~0 .cse43 .cse77)) .cse78 .cse79) (or .cse28 (= (+ .cse113 c_~x_1~0 .cse30) (+ c_~x_2~0 .cse31 .cse114)) .cse115 .cse33 .cse116) (or (= (+ .cse106 c_~x_2~0 .cse117) (+ .cse118 c_~x_1~0 .cse105)) .cse119 .cse107 .cse120 .cse108) (or .cse0 (= (+ c_~x_2~0 .cse32 .cse2) (+ .cse29 c_~x_1~0 .cse5)) .cse34 .cse35 .cse7) (or .cse8 (= (+ c_~x_1~0 .cse12 .cse9) (+ c_~x_2~0 .cse14 .cse10)) .cse17 .cse11 .cse19) (or (= (+ c_~x_2~0 .cse56 .cse117) (+ .cse58 .cse118 c_~x_1~0)) .cse119 .cse52 .cse54 .cse120) (or .cse87 .cse109 (= (+ c_~x_2~0 .cse111 .cse88) (+ .cse89 c_~x_1~0 .cse110)) .cse90 .cse112) (or (let ((.cse121 (* 15 c_~a~0))) (= (+ .cse113 c_~x_1~0 .cse121) (+ c_~x_2~0 .cse114 (* (div (+ c_~x_1~0 .cse121) 4294967296) 4294967296)))) (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse122) .cse115 (< .cse122 (+ .cse123 1)) .cse116)))) is different from false Killed by 15