./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-24 02:05:36,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-24 02:05:36,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-24 02:05:36,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-24 02:05:36,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-24 02:05:36,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-24 02:05:36,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-24 02:05:36,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-24 02:05:36,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-24 02:05:36,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-24 02:05:36,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-24 02:05:36,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-24 02:05:36,844 INFO L153 SettingsManager]: * Use SBE=true [2025-01-24 02:05:36,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-24 02:05:36,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-24 02:05:36,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-24 02:05:36,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-24 02:05:36,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-24 02:05:36,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-24 02:05:36,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-24 02:05:36,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-24 02:05:36,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-24 02:05:36,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-24 02:05:36,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-24 02:05:36,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-24 02:05:36,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-24 02:05:36,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-24 02:05:36,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-24 02:05:36,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-24 02:05:36,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-24 02:05:36,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 02:05:36,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-24 02:05:36,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-24 02:05:36,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-24 02:05:36,850 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-24 02:05:36,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-24 02:05:36,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-24 02:05:36,851 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-24 02:05:36,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-24 02:05:36,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-24 02:05:36,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-24 02:05:36,851 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-24 02:05:36,851 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-24 02:05:36,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2025-01-24 02:05:37,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-24 02:05:37,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-24 02:05:37,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-24 02:05:37,104 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-24 02:05:37,105 INFO L274 PluginConnector]: CDTParser initialized [2025-01-24 02:05:37,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2025-01-24 02:05:38,264 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/8c75d214e/e2128389a90443c2bf87d23c1abf411c/FLAG98702613e [2025-01-24 02:05:38,485 INFO L384 CDTParser]: Found 1 translation units. [2025-01-24 02:05:38,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2025-01-24 02:05:38,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/8c75d214e/e2128389a90443c2bf87d23c1abf411c/FLAG98702613e [2025-01-24 02:05:38,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/8c75d214e/e2128389a90443c2bf87d23c1abf411c [2025-01-24 02:05:38,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-24 02:05:38,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-24 02:05:38,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-24 02:05:38,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-24 02:05:38,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-24 02:05:38,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 02:05:38" (1/1) ... [2025-01-24 02:05:38,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9d4bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:38, skipping insertion in model container [2025-01-24 02:05:38,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 02:05:38" (1/1) ... [2025-01-24 02:05:38,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-24 02:05:38,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1936,1949] [2025-01-24 02:05:38,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 02:05:38,981 INFO L200 MainTranslator]: Completed pre-run [2025-01-24 02:05:39,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1936,1949] [2025-01-24 02:05:39,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 02:05:39,032 INFO L204 MainTranslator]: Completed translation [2025-01-24 02:05:39,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39 WrapperNode [2025-01-24 02:05:39,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-24 02:05:39,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-24 02:05:39,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-24 02:05:39,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-24 02:05:39,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,048 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2025-01-24 02:05:39,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-24 02:05:39,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-24 02:05:39,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-24 02:05:39,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-24 02:05:39,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-24 02:05:39,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-24 02:05:39,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-24 02:05:39,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-24 02:05:39,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (1/1) ... [2025-01-24 02:05:39,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 02:05:39,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:05:39,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-24 02:05:39,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-24 02:05:39,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-24 02:05:39,103 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-24 02:05:39,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-24 02:05:39,103 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-24 02:05:39,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-24 02:05:39,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-24 02:05:39,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-24 02:05:39,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-24 02:05:39,103 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-24 02:05:39,164 INFO L234 CfgBuilder]: Building ICFG [2025-01-24 02:05:39,165 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-24 02:05:39,283 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-24 02:05:39,283 INFO L283 CfgBuilder]: Performing block encoding [2025-01-24 02:05:39,370 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-24 02:05:39,370 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-24 02:05:39,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 02:05:39 BoogieIcfgContainer [2025-01-24 02:05:39,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-24 02:05:39,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-24 02:05:39,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-24 02:05:39,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-24 02:05:39,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 02:05:38" (1/3) ... [2025-01-24 02:05:39,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1b8d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 02:05:39, skipping insertion in model container [2025-01-24 02:05:39,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:05:39" (2/3) ... [2025-01-24 02:05:39,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1b8d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 02:05:39, skipping insertion in model container [2025-01-24 02:05:39,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 02:05:39" (3/3) ... [2025-01-24 02:05:39,380 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2025-01-24 02:05:39,389 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-24 02:05:39,389 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-24 02:05:39,390 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-24 02:05:39,429 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-24 02:05:39,455 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 02:05:39,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-24 02:05:39,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:05:39,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-24 02:05:39,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-24 02:05:39,511 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 02:05:39,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 02:05:39,530 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;@4d0000a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 02:05:39,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-24 02:05:39,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:05:39,659 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:05:39,659 INFO L139 ounterexampleChecker]: Examining path program with hash -469606641, occurence #1 [2025-01-24 02:05:39,660 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:05:39,660 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:05:39,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:05:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash -211985893, now seen corresponding path program 1 times [2025-01-24 02:05:39,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:05:39,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169360669] [2025-01-24 02:05:39,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:05:39,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:05:39,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-24 02:05:39,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-24 02:05:39,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:05:39,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:05:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:05:40,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:05:40,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169360669] [2025-01-24 02:05:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169360669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:05:40,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:05:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 02:05:40,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270682667] [2025-01-24 02:05:40,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:05:40,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-24 02:05:40,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:05:40,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-24 02:05:40,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-24 02:05:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:05:40,268 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:05:40,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:05:40,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:05:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 02:05:40,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-24 02:05:40,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:05:40,345 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:05:40,345 INFO L139 ounterexampleChecker]: Examining path program with hash -469606641, occurence #2 [2025-01-24 02:05:40,345 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 02:05:40,345 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 02:05:40,359 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:05:40,359 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 02:05:40,359 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:05:40,359 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-01-24 02:05:40,360 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:05:40,360 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 02:05:40,360 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:05:40,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:05:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash -341022696, now seen corresponding path program 1 times [2025-01-24 02:05:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:05:40,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295486345] [2025-01-24 02:05:40,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:05:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:05:40,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-24 02:05:40,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-24 02:05:40,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:05:40,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:05:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:05:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:05:41,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295486345] [2025-01-24 02:05:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295486345] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:05:41,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179491450] [2025-01-24 02:05:41,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:05:41,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:05:41,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:05:41,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:05:41,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-24 02:05:41,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-24 02:05:41,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-24 02:05:41,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:05:41,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:05:41,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-24 02:05:41,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:05:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:05:41,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:05:43,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296))) (let ((.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse0 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1)) (.cse4 (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse1)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (and (forall ((v_z_5 Int)) (or (< v_z_5 .cse0) (< (mod (+ (* 2 v_z_5) c_~x_1~0) 4294967296) (+ 2 .cse1 .cse2)) (< .cse3 v_z_5))) (forall ((v_z_5 Int)) (let ((.cse5 (mod (+ (* 2 v_z_5) c_~x_1~0) 4294967296))) (or (< .cse4 (+ .cse5 1)) (< v_z_5 .cse0) (< .cse3 v_z_5) (< (+ .cse5 4294967294) (+ .cse1 .cse2))))) (forall ((v_z_5 Int)) (or (< v_z_5 .cse0) (< .cse4 (+ (mod (+ (* 2 v_z_5) c_~x_1~0) 4294967296) 4294967297)) (< .cse3 v_z_5)))))) is different from false [2025-01-24 02:05:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-01-24 02:05:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179491450] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:05:44,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:05:44,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2025-01-24 02:05:44,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476135563] [2025-01-24 02:05:44,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:05:44,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-24 02:05:44,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:05:44,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-24 02:05:44,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=301, Unknown=1, NotChecked=36, Total=420 [2025-01-24 02:05:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:05:44,175 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:05:44,175 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) [2025-01-24 02:05:44,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 02:05:44,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:05:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 02:05:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:05:44,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-24 02:05:45,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:05:45,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:05:45,112 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:05:45,113 INFO L139 ounterexampleChecker]: Examining path program with hash -469606641, occurence #3 [2025-01-24 02:05:45,113 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 02:05:45,113 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 02:05:45,113 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:05:45,113 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 02:05:45,113 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:05:45,113 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-01-24 02:05:45,113 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:05:45,113 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 02:05:45,113 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:05:45,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:05:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash 173912658, now seen corresponding path program 2 times [2025-01-24 02:05:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:05:45,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631890363] [2025-01-24 02:05:45,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 02:05:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:05:45,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-24 02:05:45,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-24 02:05:45,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 02:05:45,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:05:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:05:45,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:05:45,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631890363] [2025-01-24 02:05:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631890363] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:05:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563685778] [2025-01-24 02:05:45,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 02:05:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:05:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:05:45,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:05:45,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-24 02:05:46,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-24 02:05:46,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-24 02:05:46,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 02:05:46,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:05:46,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-24 02:05:46,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:05:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:05:47,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:05:54,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse5 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)) (.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse2 (+ v_z_10 .cse6))) (or (< .cse0 .cse1) (< .cse2 4294967296) (< .cse3 .cse0) (< 4294967295 v_z_10) (< .cse4 v_z_14) (< v_z_14 .cse5) (= .cse2 (+ (mod (+ (* v_z_14 4) c_~x_1~0) 4294967296) 4294967296))))) (forall ((v_z_15 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse7 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse8 (+ v_z_10 .cse6))) (or (< .cse7 .cse1) (= (mod (+ c_~x_1~0 (* v_z_15 4)) 4294967296) .cse8) (< v_z_10 0) (< .cse3 .cse7) (< 4294967295 .cse8) (< .cse4 v_z_15) (< v_z_15 .cse5)))) (forall ((v_z_17 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse11 (+ v_z_10 .cse6)) (.cse10 (mod (+ (* v_z_17 4) c_~x_1~0) 4294967296))) (or (< .cse9 .cse1) (< v_z_10 0) (< .cse3 .cse9) (< 4294967295 v_z_10) (= (+ .cse10 4294967296) .cse11) (< v_z_17 .cse5) (= .cse11 .cse10) (< .cse4 v_z_17)))))) is different from false [2025-01-24 02:05:56,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse8 (+ .cse4 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse3 (+ v_z_10 .cse5))) (or (< .cse0 .cse1) (< v_z_10 0) (< .cse2 .cse0) (< 4294967295 .cse3) (= .cse4 .cse3)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse6 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse7 (+ v_z_10 .cse5))) (or (< .cse6 .cse1) (< v_z_10 0) (< .cse2 .cse6) (= .cse7 .cse8) (< 4294967295 v_z_10) (= .cse4 .cse7)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse10 (+ v_z_10 .cse5))) (or (< .cse9 .cse1) (< .cse10 4294967296) (< .cse2 .cse9) (= .cse10 .cse8) (< 4294967295 v_z_10))))))) is different from false [2025-01-24 02:05:59,064 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse4 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ v_z_10 .cse2))) (or (< v_z_10 0) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (< 4294967295 .cse0) (= .cse1 .cse0)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse3 (+ v_z_10 .cse2))) (or (< v_z_10 0) (= .cse3 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (= .cse1 .cse3)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse5 (+ v_z_10 .cse2))) (or (< .cse5 4294967296) (= .cse5 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)))))))) is different from false [2025-01-24 02:05:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-01-24 02:05:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563685778] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:05:59,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:05:59,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2025-01-24 02:05:59,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198020323] [2025-01-24 02:05:59,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:05:59,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-24 02:05:59,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:05:59,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-24 02:05:59,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=727, Unknown=5, NotChecked=174, Total=1056 [2025-01-24 02:05:59,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:05:59,124 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:05:59,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 32 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:05:59,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 02:05:59,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:05:59,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:06:01,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse4 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ v_z_10 .cse2))) (or (< v_z_10 0) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (< 4294967295 .cse0) (= .cse1 .cse0)))) (= c_~x_2~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse3 (+ v_z_10 .cse2))) (or (< v_z_10 0) (= .cse3 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (= .cse1 .cse3)))) (= c_~x_1~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse5 (+ v_z_10 .cse2))) (or (< .cse5 4294967296) (= .cse5 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)))))))) is different from false [2025-01-24 02:06:03,237 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse8 (+ .cse4 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse3 (+ v_z_10 .cse5))) (or (< .cse0 .cse1) (< v_z_10 0) (< .cse2 .cse0) (< 4294967295 .cse3) (= .cse4 .cse3)))) (= c_~x_2~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse6 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse7 (+ v_z_10 .cse5))) (or (< .cse6 .cse1) (< v_z_10 0) (< .cse2 .cse6) (= .cse7 .cse8) (< 4294967295 v_z_10) (= .cse4 .cse7)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse10 (+ v_z_10 .cse5))) (or (< .cse9 .cse1) (< .cse10 4294967296) (< .cse2 .cse9) (= .cse10 .cse8) (< 4294967295 v_z_10))))))) is different from false [2025-01-24 02:06:05,290 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse5 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)) (.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse2 (+ v_z_10 .cse6))) (or (< .cse0 .cse1) (< .cse2 4294967296) (< .cse3 .cse0) (< 4294967295 v_z_10) (< .cse4 v_z_14) (< v_z_14 .cse5) (= .cse2 (+ (mod (+ (* v_z_14 4) c_~x_1~0) 4294967296) 4294967296))))) (= c_~x_2~0 0) (forall ((v_z_15 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse7 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse8 (+ v_z_10 .cse6))) (or (< .cse7 .cse1) (= (mod (+ c_~x_1~0 (* v_z_15 4)) 4294967296) .cse8) (< v_z_10 0) (< .cse3 .cse7) (< 4294967295 .cse8) (< .cse4 v_z_15) (< v_z_15 .cse5)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0) (forall ((v_z_17 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse11 (+ v_z_10 .cse6)) (.cse10 (mod (+ (* v_z_17 4) c_~x_1~0) 4294967296))) (or (< .cse9 .cse1) (< v_z_10 0) (< .cse3 .cse9) (< 4294967295 v_z_10) (= (+ .cse10 4294967296) .cse11) (< v_z_17 .cse5) (= .cse11 .cse10) (< .cse4 v_z_17)))))) is different from false [2025-01-24 02:06:33,669 WARN L286 SmtUtils]: Spent 11.92s on a formula simplification. DAG size of input: 57 DAG size of output: 12 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:06:35,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-01-24 02:06:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 02:06:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:06:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-24 02:06:41,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-24 02:06:42,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:06:42,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:06:42,079 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:06:42,079 INFO L139 ounterexampleChecker]: Examining path program with hash -469606641, occurence #4 [2025-01-24 02:06:42,079 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 02:06:42,079 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 02:06:42,079 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:06:42,079 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 02:06:42,079 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:06:42,079 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-01-24 02:06:42,079 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:06:42,080 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 02:06:42,080 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:06:42,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:06:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1143750714, now seen corresponding path program 3 times [2025-01-24 02:06:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:06:42,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692523770] [2025-01-24 02:06:42,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 02:06:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:06:42,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 8 equivalence classes. [2025-01-24 02:06:42,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 28 of 28 statements. [2025-01-24 02:06:42,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-24 02:06:42,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:06:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:06:42,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:06:42,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692523770] [2025-01-24 02:06:42,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692523770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:06:42,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787573725] [2025-01-24 02:06:42,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 02:06:42,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:06:42,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:06:42,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:06:42,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-24 02:06:42,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 8 equivalence classes. [2025-01-24 02:06:43,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 28 of 28 statements. [2025-01-24 02:06:43,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-24 02:06:43,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:06:43,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-01-24 02:06:43,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:06:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:06:43,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:07:36,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse7 (+ .cse0 4294967296)) (.cse2 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse3 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse1 (+ v_z_22 .cse5))) (or (= .cse0 .cse1) (< v_z_22 0) (< .cse2 .cse3) (< .cse3 .cse4) (< 4294967295 .cse1)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse6 (+ v_z_22 .cse5)) (.cse8 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse0 .cse6) (= .cse7 .cse6) (< 4294967295 v_z_22) (< v_z_22 0) (< .cse2 .cse8) (< .cse8 .cse4)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse9 (+ v_z_22 .cse5)) (.cse10 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse7 .cse9) (< 4294967295 v_z_22) (< .cse9 4294967296) (< .cse2 .cse10) (< .cse10 .cse4))))))) is different from false [2025-01-24 02:07:39,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse2 (+ .cse0 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse1 (+ v_z_22 .cse3))) (or (= .cse0 .cse1) (= .cse2 .cse1) (< 4294967295 v_z_22) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse4 (+ v_z_22 .cse3))) (or (= .cse0 .cse4) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0) (< 4294967295 .cse4)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse5 (+ v_z_22 .cse3))) (or (= .cse2 .cse5) (< 4294967295 v_z_22) (< .cse5 4294967296) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)))))))) is different from false [2025-01-24 02:07:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:07:39,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787573725] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:07:39,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:07:39,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 57 [2025-01-24 02:07:39,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082563704] [2025-01-24 02:07:39,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:07:39,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-01-24 02:07:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:07:39,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-01-24 02:07:39,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=2711, Unknown=11, NotChecked=218, Total=3306 [2025-01-24 02:07:39,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:07:39,120 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:07:39,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 57 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:07:39,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 02:07:39,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:07:39,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2025-01-24 02:07:39,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:07:41,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse2 (+ .cse0 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse1 (+ v_z_22 .cse3))) (or (= .cse0 .cse1) (= .cse2 .cse1) (< 4294967295 v_z_22) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse4 (+ v_z_22 .cse3))) (or (= .cse0 .cse4) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0) (< 4294967295 .cse4)))) (= c_~x_2~0 0) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse5 (+ v_z_22 .cse3))) (or (= .cse2 .cse5) (< 4294967295 v_z_22) (< .cse5 4294967296) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8))))) (= c_~x_1~0 0)))) is different from false [2025-01-24 02:07:43,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse7 (+ .cse0 4294967296)) (.cse2 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse3 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse1 (+ v_z_22 .cse5))) (or (= .cse0 .cse1) (< v_z_22 0) (< .cse2 .cse3) (< .cse3 .cse4) (< 4294967295 .cse1)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse6 (+ v_z_22 .cse5)) (.cse8 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse0 .cse6) (= .cse7 .cse6) (< 4294967295 v_z_22) (< v_z_22 0) (< .cse2 .cse8) (< .cse8 .cse4)))) (= c_~x_1~0 0) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse9 (+ v_z_22 .cse5)) (.cse10 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse7 .cse9) (< 4294967295 v_z_22) (< .cse9 4294967296) (< .cse2 .cse10) (< .cse10 .cse4))))))) is different from false [2025-01-24 02:07:45,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296) 1)) (.cse7 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse2 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_23 Int)) (or (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse0 (mod (+ c_~x_1~0 (* v_z_23 8)) 4294967296)) (.cse1 (+ v_z_22 .cse5)) (.cse3 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (< 4294967295 v_z_22) (= .cse0 .cse1) (< v_z_22 0) (= (+ 4294967296 .cse0) .cse1) (< .cse2 .cse3) (< .cse3 .cse4)))) (< v_z_23 .cse6) (< .cse7 v_z_23))) (= c_~x_2~0 0) (forall ((v_z_23 Int)) (or (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse8 (+ v_z_22 .cse5)) (.cse9 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (< 4294967295 v_z_22) (< .cse8 4294967296) (= (+ 4294967296 (mod (+ c_~x_1~0 (* v_z_23 8)) 4294967296)) .cse8) (< .cse2 .cse9) (< .cse9 .cse4)))) (< v_z_23 .cse6) (< .cse7 v_z_23))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0) (forall ((v_z_23 Int)) (or (< v_z_23 .cse6) (< .cse7 v_z_23) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse11 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse10 (+ v_z_22 .cse5))) (or (= (mod (+ c_~x_1~0 (* v_z_23 8)) 4294967296) .cse10) (< v_z_22 0) (< .cse2 .cse11) (< .cse11 .cse4) (< 4294967295 .cse10)))))))) is different from false [2025-01-24 02:07:47,271 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~x_1~0 c_~a~0) (let ((.cse0 (mod c_~a~0 4294967296))) (or (< (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse0) (let ((.cse8 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296))) (let ((.cse2 (+ .cse8 4294967296)) (.cse3 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (+ (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse1 (+ v_z_22 .cse6)) (.cse4 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (< 4294967295 v_z_22) (< .cse1 4294967296) (= .cse2 .cse1) (< .cse3 .cse4) (< .cse4 .cse5)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse7 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse9 (+ v_z_22 .cse6))) (or (< v_z_22 0) (< .cse3 .cse7) (< .cse7 .cse5) (= .cse8 .cse9) (< 4294967295 .cse9)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse11 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse10 (+ v_z_22 .cse6))) (or (< 4294967295 v_z_22) (= .cse2 .cse10) (< v_z_22 0) (< .cse3 .cse11) (< .cse11 .cse5) (= .cse8 .cse10))))))) (< .cse0 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296) 1)))) (= c_~x_2~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1)) is different from false [2025-01-24 02:08:00,712 WARN L286 SmtUtils]: Spent 12.52s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:08:21,485 WARN L286 SmtUtils]: Spent 19.12s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:08:28,365 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 [] [2025-01-24 02:08:54,181 WARN L286 SmtUtils]: Spent 24.62s on a formula simplification that was a NOOP. DAG size: 147 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:08:57,286 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 [] [2025-01-24 02:09:08,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:09:12,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:09:13,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-01-24 02:09:42,259 WARN L286 SmtUtils]: Spent 21.96s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:09:44,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:09:46,742 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 [] [2025-01-24 02:09:48,858 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 [] [2025-01-24 02:09:50,880 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 [] [2025-01-24 02:10:11,067 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 [] [2025-01-24 02:10:13,071 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 [] [2025-01-24 02:10:20,633 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 [] [2025-01-24 02:10:22,637 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 [] [2025-01-24 02:10:32,895 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 [] [2025-01-24 02:10:38,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:10:39,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:10:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 02:10:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:10:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-24 02:10:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-24 02:10:43,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-24 02:10:43,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:10:43,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:10:43,374 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:10:43,374 INFO L139 ounterexampleChecker]: Examining path program with hash -469606641, occurence #5 [2025-01-24 02:10:43,374 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-24 02:10:43,374 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-24 02:10:43,374 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:10:43,374 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-24 02:10:43,374 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:10:43,374 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-01-24 02:10:43,374 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-24 02:10:43,374 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-24 02:10:43,374 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:10:43,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:10:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1923333806, now seen corresponding path program 4 times [2025-01-24 02:10:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:10:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127851821] [2025-01-24 02:10:43,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-24 02:10:43,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:10:43,380 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-01-24 02:10:43,465 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-24 02:10:43,465 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-24 02:10:43,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:10:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:10:46,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:10:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127851821] [2025-01-24 02:10:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127851821] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:10:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477499297] [2025-01-24 02:10:46,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-24 02:10:46,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:10:46,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:10:46,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:10:46,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-24 02:10:46,641 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-01-24 02:10:46,779 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-24 02:10:46,779 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-24 02:10:46,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:10:46,781 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-01-24 02:10:46,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:10:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:10:49,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:12:38,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse4 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse5 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse6)) (.cse3 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse0 .cse1) (< v_z_28 0) (= .cse2 .cse0) (< .cse3 .cse4) (< .cse5 .cse3) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse7 (+ v_z_28 .cse6)) (.cse8 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse7 .cse1) (< v_z_28 0) (< 4294967295 .cse7) (< .cse8 .cse4) (< .cse5 .cse8)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse9 (+ v_z_28 .cse6)) (.cse10 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse2 .cse9) (< .cse10 .cse4) (< .cse9 4294967296) (< .cse5 .cse10) (< 4294967295 v_z_28))))))) is different from false [2025-01-24 02:12:40,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse3))) (or (= .cse0 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse0) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse4 (+ v_z_28 .cse3))) (or (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse4) (< .cse4 4294967296) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse5 (+ v_z_28 .cse3))) (or (= .cse5 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (< 4294967295 .cse5))))))) is different from false [2025-01-24 02:12:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:12:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477499297] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:12:40,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:12:40,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 104 [2025-01-24 02:12:40,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752724205] [2025-01-24 02:12:40,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:12:40,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2025-01-24 02:12:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:12:40,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2025-01-24 02:12:40,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1952, Invalid=8553, Unknown=9, NotChecked=406, Total=10920 [2025-01-24 02:12:40,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:12:40,253 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:12:40,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:12:40,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-24 02:12:40,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-24 02:12:40,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2025-01-24 02:12:40,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2025-01-24 02:12:40,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:12:42,355 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse3))) (or (= .cse0 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse0) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse4 (+ v_z_28 .cse3))) (or (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse4) (< .cse4 4294967296) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse5 (+ v_z_28 .cse3))) (or (= .cse5 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (< 4294967295 .cse5)))) (= c_~x_1~0 0)))) is different from false [2025-01-24 02:12:44,401 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse4 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse5 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse6)) (.cse3 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse0 .cse1) (< v_z_28 0) (= .cse2 .cse0) (< .cse3 .cse4) (< .cse5 .cse3) (< 4294967295 v_z_28)))) (= c_~x_2~0 0) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse7 (+ v_z_28 .cse6)) (.cse8 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse7 .cse1) (< v_z_28 0) (< 4294967295 .cse7) (< .cse8 .cse4) (< .cse5 .cse8)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse9 (+ v_z_28 .cse6)) (.cse10 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse2 .cse9) (< .cse10 .cse4) (< .cse9 4294967296) (< .cse5 .cse10) (< 4294967295 v_z_28))))))) is different from false [2025-01-24 02:12:46,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) 1)) (.cse1 (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296)) (.cse5 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse6 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (forall ((v_z_35 Int) (v_z_28 Int) (v_y_28 Int)) (let ((.cse2 (+ v_z_28 .cse7)) (.cse3 (mod (+ (* v_z_35 16) c_~x_1~0) 4294967296)) (.cse4 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< v_z_35 .cse0) (< v_z_28 0) (< .cse1 v_z_35) (= .cse2 .cse3) (= .cse2 (+ .cse3 4294967296)) (< .cse4 .cse5) (< .cse6 .cse4) (< 4294967295 v_z_28)))) (= c_~x_1~0 0) (forall ((v_z_28 Int) (v_y_28 Int) (v_z_33 Int)) (let ((.cse9 (+ v_z_28 .cse7)) (.cse8 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< .cse1 v_z_33) (< v_z_33 .cse0) (< .cse8 .cse5) (= .cse9 (+ 4294967296 (mod (+ c_~x_1~0 (* v_z_33 16)) 4294967296))) (< .cse9 4294967296) (< .cse6 .cse8) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int) (v_z_32 Int)) (let ((.cse10 (+ v_z_28 .cse7)) (.cse11 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< v_z_28 0) (< v_z_32 .cse0) (< .cse1 v_z_32) (= .cse10 (mod (+ (* v_z_32 16) c_~x_1~0) 4294967296)) (< 4294967295 .cse10) (< .cse11 .cse5) (< .cse6 .cse11)))))) is different from false [2025-01-24 02:12:48,435 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~x_1~0 c_~a~0) (= c_~x_2~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1) (let ((.cse0 (mod c_~a~0 4294967296))) (or (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296) .cse0) (let ((.cse4 (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296))) (let ((.cse1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse9 (+ .cse4 4294967296)) (.cse5 (+ (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse2 (+ (* v_z_28 4008636143) (* v_y_28 4294967296))) (.cse3 (+ v_z_28 .cse6))) (or (< .cse1 .cse2) (< v_z_28 0) (= .cse3 .cse4) (< .cse2 .cse5) (< 4294967295 .cse3)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse8 (+ v_z_28 .cse6)) (.cse7 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< .cse1 .cse7) (< v_z_28 0) (= .cse8 .cse4) (= .cse8 .cse9) (< .cse7 .cse5) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse10 (+ (* v_z_28 4008636143) (* v_y_28 4294967296))) (.cse11 (+ v_z_28 .cse6))) (or (< .cse1 .cse10) (= .cse11 .cse9) (< .cse10 .cse5) (< .cse11 4294967296) (< 4294967295 v_z_28))))))) (< .cse0 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) 1))))) is different from false [2025-01-24 02:12:51,291 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse89 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse94 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse92 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse97 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse98 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse96 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse91 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse100 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse95 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse90 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse93 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse88 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse99 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse42 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse103 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse106 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse112 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse101 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse102 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse111 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse110 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse104 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse105 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse109 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse108 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse113 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse41 (mod c_~b~0 4294967296)) (.cse33 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse107 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse34 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse107 .cse34)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse28 (< .cse34 (+ .cse33 1))) (.cse26 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (.cse27 (< .cse41 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse29 (< .cse113 .cse41)) (.cse36 (< .cse34 (+ .cse108 1))) (.cse38 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse34)) (.cse40 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse109 .cse34)) (.cse5 (< .cse34 (+ .cse105 1))) (.cse0 (< .cse41 (+ .cse104 1))) (.cse1 (< .cse110 .cse41)) (.cse4 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (.cse6 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (.cse8 (< .cse41 (+ .cse111 1))) (.cse11 (< .cse102 .cse41)) (.cse9 (< .cse101 .cse34)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse34 (+ .cse112 1))) (.cse30 (< .cse41 (+ .cse113 1))) (.cse31 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse32 (< .cse106 .cse41)) (.cse52 (< .cse112 .cse34)) (.cse53 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse65 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse64 (< .cse111 .cse41)) (.cse66 (< .cse41 (+ .cse110 1))) (.cse54 (< .cse34 (+ .cse109 1))) (.cse35 (< .cse41 (+ .cse103 1))) (.cse37 (< .cse42 .cse41)) (.cse58 (< .cse108 .cse34)) (.cse39 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse57 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse59 (< .cse34 (+ .cse99 1))) (.cse43 (< .cse41 (+ .cse88 1))) (.cse47 (< .cse93 .cse41)) (.cse44 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse76 (< .cse34 (+ .cse90 1))) (.cse77 (< .cse95 .cse34)) (.cse78 (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296)) (.cse73 (< .cse34 (+ .cse107 1))) (.cse49 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse75 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse50 (< .cse41 (+ .cse106 1))) (.cse74 (< .cse105 .cse34)) (.cse51 (< .cse104 .cse41)) (.cse55 (< .cse103 .cse41)) (.cse56 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse60 (< .cse41 (+ .cse100 1))) (.cse67 (< .cse91 .cse41)) (.cse62 (< .cse96 .cse34)) (.cse68 (< .cse41 (+ .cse102 1))) (.cse63 (< .cse34 (+ .cse101 1))) (.cse61 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296)) (.cse70 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (.cse12 (< .cse41 (+ .cse98 1))) (.cse82 (< .cse34 (+ .cse97 1))) (.cse83 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse100 .cse41)) (.cse84 (< .cse99 .cse34)) (.cse19 (< .cse98 .cse41)) (.cse13 (< .cse97 .cse34)) (.cse23 (< .cse41 (+ .cse92 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse34 (+ .cse94 1))) (.cse69 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse71 (< .cse89 .cse34)) (.cse72 (< .cse34 (+ .cse96 1))) (.cse18 (< .cse34 (+ .cse95 1))) (.cse20 (< .cse94 .cse34)) (.cse79 (< .cse41 (+ .cse93 1))) (.cse80 (< .cse92 .cse41)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse81 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296)) (.cse45 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse86 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse85 (< .cse41 (+ .cse91 1))) (.cse46 (< .cse90 .cse34)) (.cse48 (< .cse34 (+ .cse89 1))) (.cse87 (< .cse88 .cse41))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 (= .cse14 .cse15) .cse16 .cse17) (or .cse18 .cse19 .cse20 (= .cse21 .cse22) .cse23) (or .cse24 (= .cse25 .cse26) .cse27 .cse28 .cse29) (or .cse24 .cse30 (= .cse25 .cse31) .cse28 .cse32) (or (= (mod c_~x_2~0 4294967296) .cse26) (< .cse33 .cse34) .cse27 .cse29) (or .cse35 .cse36 .cse37 .cse38 (= .cse39 .cse40)) (or (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse41) .cse36 (< .cse41 (+ .cse42 1)) .cse38 (= (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296) .cse40)) (or .cse43 (= .cse44 .cse45) .cse46 .cse47 .cse48) (or (= .cse49 .cse3) .cse50 .cse2 .cse51 .cse5) (or .cse0 .cse1 .cse52 (= .cse53 .cse4) .cse54) (or .cse55 (= .cse56 .cse57) .cse58 .cse59 .cse60) (or (= .cse61 .cse6) .cse62 .cse63 .cse8 .cse11) (or .cse9 .cse64 (= .cse65 .cse7) .cse66 .cse10) (or .cse67 .cse68 (= .cse69 .cse70) .cse71 .cse72) (or .cse73 .cse30 .cse74 (= .cse75 .cse31) .cse32) (or .cse52 (= .cse53 .cse65) .cse64 .cse66 .cse54) (or .cse35 .cse37 .cse58 (= .cse39 .cse57) .cse59) (or .cse43 .cse76 .cse77 .cse47 (= .cse78 .cse44)) (or .cse76 .cse79 .cse77 .cse80 (= .cse78 .cse81)) (or .cse73 (= .cse49 .cse75) .cse50 .cse74 .cse51) (or .cse55 .cse82 (= .cse83 .cse56) .cse84 .cse60) (or .cse67 .cse62 .cse68 .cse63 (= .cse61 .cse70)) (or .cse12 .cse82 (= .cse83 .cse15) .cse16 .cse84) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (or .cse85 (= .cse86 .cse69) .cse71 .cse72 .cse87) (or .cse18 .cse20 .cse79 .cse80 (= .cse21 .cse81)) (or (= .cse45 .cse86) .cse85 .cse46 .cse48 .cse87)))) is different from false [2025-01-24 02:12:53,647 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse91 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse96 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse94 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse99 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse100 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse98 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse93 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse102 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse97 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse92 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse95 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse89 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse101 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse42 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse105 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse108 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse115 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse103 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse104 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse114 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse113 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse106 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse107 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse112 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse111 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse116 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse41 (mod c_~b~0 4294967296)) (.cse76 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse110 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse109 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse90 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse109 .cse90)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse28 (< .cse90 (+ .cse110 1))) (.cse26 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (.cse27 (< .cse41 (+ .cse76 1))) (.cse29 (< .cse116 .cse41)) (.cse36 (< .cse90 (+ .cse111 1))) (.cse38 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse90)) (.cse40 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse112 .cse90)) (.cse5 (< .cse90 (+ .cse107 1))) (.cse0 (< .cse41 (+ .cse106 1))) (.cse1 (< .cse113 .cse41)) (.cse4 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (.cse6 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (.cse8 (< .cse41 (+ .cse114 1))) (.cse11 (< .cse104 .cse41)) (.cse9 (< .cse103 .cse90)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse90 (+ .cse115 1))) (.cse30 (< .cse41 (+ .cse116 1))) (.cse31 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse32 (< .cse108 .cse41)) (.cse52 (< .cse115 .cse90)) (.cse53 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse65 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse64 (< .cse114 .cse41)) (.cse66 (< .cse41 (+ .cse113 1))) (.cse54 (< .cse90 (+ .cse112 1))) (.cse35 (< .cse41 (+ .cse105 1))) (.cse37 (< .cse42 .cse41)) (.cse58 (< .cse111 .cse90)) (.cse39 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse57 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse59 (< .cse90 (+ .cse101 1))) (.cse34 (< .cse110 .cse90)) (.cse33 (mod c_~x_2~0 4294967296)) (.cse43 (< .cse41 (+ .cse89 1))) (.cse47 (< .cse95 .cse41)) (.cse44 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse77 (< .cse90 (+ .cse92 1))) (.cse78 (< .cse97 .cse90)) (.cse79 (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296)) (.cse73 (< .cse90 (+ .cse109 1))) (.cse49 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse75 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse50 (< .cse41 (+ .cse108 1))) (.cse74 (< .cse107 .cse90)) (.cse51 (< .cse106 .cse41)) (.cse55 (< .cse105 .cse41)) (.cse56 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse60 (< .cse41 (+ .cse102 1))) (.cse67 (< .cse93 .cse41)) (.cse62 (< .cse98 .cse90)) (.cse68 (< .cse41 (+ .cse104 1))) (.cse63 (< .cse90 (+ .cse103 1))) (.cse61 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296)) (.cse70 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (.cse12 (< .cse41 (+ .cse100 1))) (.cse83 (< .cse90 (+ .cse99 1))) (.cse84 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse102 .cse41)) (.cse85 (< .cse101 .cse90)) (.cse19 (< .cse100 .cse41)) (.cse13 (< .cse99 .cse90)) (.cse23 (< .cse41 (+ .cse94 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse90 (+ .cse96 1))) (.cse69 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse71 (< .cse91 .cse90)) (.cse72 (< .cse90 (+ .cse98 1))) (.cse18 (< .cse90 (+ .cse97 1))) (.cse20 (< .cse96 .cse90)) (.cse80 (< .cse41 (+ .cse95 1))) (.cse81 (< .cse94 .cse41)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse82 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296)) (.cse45 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse87 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse86 (< .cse41 (+ .cse93 1))) (.cse46 (< .cse92 .cse90)) (.cse48 (< .cse90 (+ .cse91 1))) (.cse88 (< .cse89 .cse41))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 (= .cse14 .cse15) .cse16 .cse17) (or .cse18 .cse19 .cse20 (= .cse21 .cse22) .cse23) (or .cse24 (= .cse25 .cse26) .cse27 .cse28 .cse29) (or .cse24 .cse30 (= .cse25 .cse31) .cse28 .cse32) (or (= .cse33 .cse26) .cse34 .cse27 .cse29) (or .cse35 .cse36 .cse37 .cse38 (= .cse39 .cse40)) (or (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse41) .cse36 (< .cse41 (+ .cse42 1)) .cse38 (= (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296) .cse40)) (or .cse43 (= .cse44 .cse45) .cse46 .cse47 .cse48) (or (= .cse49 .cse3) .cse50 .cse2 .cse51 .cse5) (or .cse0 .cse1 .cse52 (= .cse53 .cse4) .cse54) (or .cse55 (= .cse56 .cse57) .cse58 .cse59 .cse60) (or (= .cse61 .cse6) .cse62 .cse63 .cse8 .cse11) (or .cse9 .cse64 (= .cse65 .cse7) .cse66 .cse10) (or .cse67 .cse68 (= .cse69 .cse70) .cse71 .cse72) (or .cse73 .cse30 .cse74 (= .cse75 .cse31) .cse32) (or .cse52 (= .cse53 .cse65) .cse64 .cse66 .cse54) (or .cse35 .cse37 .cse58 (= .cse39 .cse57) .cse59) (or (< .cse76 .cse41) .cse34 (= (mod c_~x_1~0 4294967296) .cse33)) (or .cse43 .cse77 .cse78 .cse47 (= .cse79 .cse44)) (or .cse77 .cse80 .cse78 .cse81 (= .cse79 .cse82)) (or .cse73 (= .cse49 .cse75) .cse50 .cse74 .cse51) (or .cse55 .cse83 (= .cse84 .cse56) .cse85 .cse60) (or .cse67 .cse62 .cse68 .cse63 (= .cse61 .cse70)) (or .cse12 .cse83 (= .cse84 .cse15) .cse16 .cse85) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (or .cse86 (= .cse87 .cse69) .cse71 .cse72 .cse88) (or .cse18 .cse20 .cse80 .cse81 (= .cse21 .cse82)) (or (= .cse45 .cse87) .cse86 .cse46 .cse48 .cse88)))) is different from false [2025-01-24 02:13:00,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse86 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse91 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse89 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse94 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse95 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse93 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse88 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse97 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse92 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse87 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse90 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse84 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse96 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse38 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse100 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse103 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse28 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse109 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse98 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse99 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse108 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse107 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse26 (mod c_~b~0 4294967296)) (.cse101 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse102 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse106 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse105 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse104 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse85 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse104 .cse85)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse27 (< .cse85 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1))) (.cse33 (< .cse85 (+ .cse105 1))) (.cse35 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse85)) (.cse37 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse106 .cse85)) (.cse5 (< .cse85 (+ .cse102 1))) (.cse0 (< .cse26 (+ .cse101 1))) (.cse1 (< .cse107 .cse26)) (.cse4 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (.cse6 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (.cse8 (< .cse26 (+ .cse108 1))) (.cse11 (< .cse99 .cse26)) (.cse9 (< .cse98 .cse85)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse85 (+ .cse109 1))) (.cse29 (< .cse26 (+ .cse28 1))) (.cse30 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse31 (< .cse103 .cse26)) (.cse48 (< .cse109 .cse85)) (.cse49 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse61 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse60 (< .cse108 .cse26)) (.cse62 (< .cse26 (+ .cse107 1))) (.cse50 (< .cse85 (+ .cse106 1))) (.cse32 (< .cse26 (+ .cse100 1))) (.cse34 (< .cse38 .cse26)) (.cse54 (< .cse105 .cse85)) (.cse36 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse53 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse55 (< .cse85 (+ .cse96 1))) (.cse39 (< .cse26 (+ .cse84 1))) (.cse43 (< .cse90 .cse26)) (.cse40 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse72 (< .cse85 (+ .cse87 1))) (.cse73 (< .cse92 .cse85)) (.cse74 (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296)) (.cse69 (< .cse85 (+ .cse104 1))) (.cse45 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse71 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse46 (< .cse26 (+ .cse103 1))) (.cse70 (< .cse102 .cse85)) (.cse47 (< .cse101 .cse26)) (.cse51 (< .cse100 .cse26)) (.cse52 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse56 (< .cse26 (+ .cse97 1))) (.cse63 (< .cse88 .cse26)) (.cse58 (< .cse93 .cse85)) (.cse64 (< .cse26 (+ .cse99 1))) (.cse59 (< .cse85 (+ .cse98 1))) (.cse57 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296)) (.cse66 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (.cse12 (< .cse26 (+ .cse95 1))) (.cse78 (< .cse85 (+ .cse94 1))) (.cse79 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse97 .cse26)) (.cse80 (< .cse96 .cse85)) (.cse19 (< .cse95 .cse26)) (.cse13 (< .cse94 .cse85)) (.cse23 (< .cse26 (+ .cse89 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse85 (+ .cse91 1))) (.cse65 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse67 (< .cse86 .cse85)) (.cse68 (< .cse85 (+ .cse93 1))) (.cse18 (< .cse85 (+ .cse92 1))) (.cse20 (< .cse91 .cse85)) (.cse75 (< .cse26 (+ .cse90 1))) (.cse76 (< .cse89 .cse26)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse77 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296)) (.cse41 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse82 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse81 (< .cse26 (+ .cse88 1))) (.cse42 (< .cse87 .cse85)) (.cse44 (< .cse85 (+ .cse86 1))) (.cse83 (< .cse84 .cse26))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 (= .cse14 .cse15) .cse16 .cse17) (or .cse18 .cse19 .cse20 (= .cse21 .cse22) .cse23) (or .cse24 (= .cse25 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse26 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) .cse27 (< .cse28 .cse26)) (or .cse24 .cse29 (= .cse25 .cse30) .cse27 .cse31) (or .cse32 .cse33 .cse34 .cse35 (= .cse36 .cse37)) (or (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse26) .cse33 (< .cse26 (+ .cse38 1)) .cse35 (= (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296) .cse37)) (or .cse39 (= .cse40 .cse41) .cse42 .cse43 .cse44) (or (= .cse45 .cse3) .cse46 .cse2 .cse47 .cse5) (or .cse0 .cse1 .cse48 (= .cse49 .cse4) .cse50) (or .cse51 (= .cse52 .cse53) .cse54 .cse55 .cse56) (or (= .cse57 .cse6) .cse58 .cse59 .cse8 .cse11) (or .cse9 .cse60 (= .cse61 .cse7) .cse62 .cse10) (or .cse63 .cse64 (= .cse65 .cse66) .cse67 .cse68) (or .cse69 .cse29 .cse70 (= .cse71 .cse30) .cse31) (or .cse48 (= .cse49 .cse61) .cse60 .cse62 .cse50) (or .cse32 .cse34 .cse54 (= .cse36 .cse53) .cse55) (or .cse39 .cse72 .cse73 .cse43 (= .cse74 .cse40)) (or .cse72 .cse75 .cse73 .cse76 (= .cse74 .cse77)) (or .cse69 (= .cse45 .cse71) .cse46 .cse70 .cse47) (or .cse51 .cse78 (= .cse79 .cse52) .cse80 .cse56) (or .cse63 .cse58 .cse64 .cse59 (= .cse57 .cse66)) (or .cse12 .cse78 (= .cse79 .cse15) .cse16 .cse80) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (or .cse81 (= .cse82 .cse65) .cse67 .cse68 .cse83) (or .cse18 .cse20 .cse75 .cse76 (= .cse21 .cse77)) (or (= .cse41 .cse82) .cse81 .cse42 .cse44 .cse83)))) is different from false [2025-01-24 02:13:09,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-01-24 02:13:25,709 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 [] [2025-01-24 02:13:36,647 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 [] [2025-01-24 02:13:39,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:13:51,641 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 [] [2025-01-24 02:14:22,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 [] [2025-01-24 02:14:28,454 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 [] [2025-01-24 02:14:34,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:14:49,385 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse9 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse7 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse17 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse18 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse12 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse19 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse16 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse0 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse11 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse8 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse15 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse14 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse26 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse27 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse24 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse29 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse25 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse28 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse20 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse23 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse1 (mod c_~a~0 4294967296)) (.cse21 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse22 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod c_~b~0 4294967296))) (and (or (< .cse0 .cse1) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse2 (+ .cse3 1)) (< .cse1 (+ .cse4 1)) (< .cse5 .cse2)) (or (< .cse2 (+ .cse6 1)) (< .cse1 (+ .cse7 1)) (< (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse2) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse1) (= (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296))) (or (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (< .cse2 (+ .cse8 1)) (< .cse9 .cse1) (< .cse10 .cse2) (< .cse1 (+ .cse11 1))) (or (< .cse2 (+ .cse10 1)) (< .cse12 .cse2) (< .cse13 .cse1) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse1 (+ .cse9 1))) (or (< .cse6 .cse2) (= (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (< .cse7 .cse1) (< .cse1 (+ .cse14 1)) (< .cse2 (+ .cse15 1))) (or (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (< .cse16 .cse1) (< .cse1 (+ .cse17 1)) (< .cse2 (+ .cse18 1)) (< .cse19 .cse2)) (or (< .cse17 .cse1) (< .cse18 .cse2) (= (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse2 (+ .cse12 1)) (< .cse1 (+ .cse13 1))) (or (< .cse20 .cse2) (< .cse2 (+ .cse19 1)) (= (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (< .cse21 .cse1) (< .cse1 (+ .cse16 1))) (or (< .cse1 (+ .cse0 1)) (< .cse2 (+ .cse5 1)) (< .cse11 .cse1) (= (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse8 .cse2)) (or (< .cse3 .cse2) (< .cse4 .cse1) (= (mod c_~x_1~0 4294967296) (mod c_~x_2~0 4294967296))) (or (< .cse2 (+ .cse22 1)) (< .cse1 (+ .cse23 1)) (< .cse24 .cse1) (< .cse25 .cse2) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296))) (or (< .cse2 (+ .cse26 1)) (< .cse1 (+ .cse27 1)) (= (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296) (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (< .cse15 .cse2) (< .cse14 .cse1)) (or (< .cse26 .cse2) (< .cse27 .cse1) (< .cse2 (+ .cse28 1)) (= (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296) (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (< .cse1 (+ .cse29 1))) (or (< .cse1 (+ .cse24 1)) (< .cse29 .cse1) (< .cse2 (+ .cse25 1)) (< .cse28 .cse2) (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (= (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296) (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (< .cse2 (+ .cse20 1)) (< .cse23 .cse1) (< .cse1 (+ .cse21 1)) (< .cse22 .cse2)))) is different from false [2025-01-24 02:14:51,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse18 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse17 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse8 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse6 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse21 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse22 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse14 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse15 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse16 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse19 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse1 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse24 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse25 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse12 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse9 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse26 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse23 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse4 (mod c_~a~0 4294967296)) (.cse27 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse20 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse0 (mod c_~b~0 4294967296))) (and (or (< .cse0 (+ .cse1 1)) (< .cse2 .cse0) (< .cse3 .cse4) (= (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse4 (+ .cse5 1))) (or (= (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse0 (+ .cse6 1)) (< .cse7 .cse4) (< .cse4 (+ .cse8 1)) (< .cse9 .cse0)) (or (< .cse0 (+ .cse10 1)) (< .cse11 .cse4) (= (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296) (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (< .cse12 .cse0) (< .cse4 (+ .cse13 1))) (or (< .cse4 (+ .cse14 1)) (< .cse10 .cse0) (< .cse13 .cse4) (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (< .cse0 (+ .cse15 1))) (or (< .cse16 .cse4) (< .cse0 (+ .cse17 1)) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse4 (+ .cse18 1)) (< .cse19 .cse0)) (or (= (mod c_~x_2~0 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse18 .cse4) (< .cse0 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (< .cse17 .cse0)) (or (< .cse0 (+ .cse20 1)) (= (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296) (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (< .cse21 .cse4) (< .cse22 .cse0) (< .cse4 (+ .cse23 1))) (or (< .cse8 .cse4) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (< .cse6 .cse0) (< .cse0 (+ .cse2 1)) (< .cse4 (+ .cse3 1))) (or (< .cse0 (+ .cse24 1)) (< (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse0) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296) .cse4) (= (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (< .cse4 (+ .cse25 1))) (or (< .cse4 (+ .cse21 1)) (< .cse0 (+ .cse22 1)) (< .cse14 .cse4) (< .cse15 .cse0) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (< .cse4 (+ .cse16 1)) (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (< .cse0 (+ .cse19 1)) (< .cse5 .cse4) (< .cse1 .cse0)) (or (< .cse24 .cse0) (< .cse4 (+ .cse11 1)) (= (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296) (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (< .cse25 .cse4) (< .cse0 (+ .cse12 1))) (or (< .cse26 .cse0) (< .cse27 .cse4) (< .cse0 (+ .cse9 1)) (< .cse4 (+ .cse7 1)) (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296))) (or (< .cse0 (+ .cse26 1)) (= (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (< .cse23 .cse4) (< .cse4 (+ .cse27 1)) (< .cse20 .cse0)))) is different from false [2025-01-24 02:14:53,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse15 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse16 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse17 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse14 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse0 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse9 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse6 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse13 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse12 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse24 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse25 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse22 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse27 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse23 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse26 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse18 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse21 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse1 (mod c_~a~0 4294967296)) (.cse19 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse20 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod c_~b~0 4294967296))) (and (or (< .cse0 .cse1) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse2 (+ .cse3 1)) (< .cse1 (+ .cse4 1)) (< .cse5 .cse2)) (or (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (< .cse2 (+ .cse6 1)) (< .cse7 .cse1) (< .cse8 .cse2) (< .cse1 (+ .cse9 1))) (or (< .cse2 (+ .cse8 1)) (< .cse10 .cse2) (< .cse11 .cse1) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse1 (+ .cse7 1))) (or (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296) .cse2) (= (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296) .cse1) (< .cse1 (+ .cse12 1)) (< .cse2 (+ .cse13 1))) (or (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (< .cse14 .cse1) (< .cse1 (+ .cse15 1)) (< .cse2 (+ .cse16 1)) (< .cse17 .cse2)) (or (< .cse15 .cse1) (< .cse16 .cse2) (= (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse2 (+ .cse10 1)) (< .cse1 (+ .cse11 1))) (or (< .cse18 .cse2) (< .cse2 (+ .cse17 1)) (= (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (< .cse19 .cse1) (< .cse1 (+ .cse14 1))) (or (< .cse1 (+ .cse0 1)) (< .cse2 (+ .cse5 1)) (< .cse9 .cse1) (= (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse6 .cse2)) (or (< .cse3 .cse2) (< .cse4 .cse1) (= (mod c_~x_1~0 4294967296) (mod c_~x_2~0 4294967296))) (or (< .cse2 (+ .cse20 1)) (< .cse1 (+ .cse21 1)) (< .cse22 .cse1) (< .cse23 .cse2) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296))) (or (< .cse2 (+ .cse24 1)) (< .cse1 (+ .cse25 1)) (= (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296) (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (< .cse13 .cse2) (< .cse12 .cse1)) (or (< .cse24 .cse2) (< .cse25 .cse1) (< .cse2 (+ .cse26 1)) (= (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296) (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (< .cse1 (+ .cse27 1))) (or (< .cse1 (+ .cse22 1)) (< .cse27 .cse1) (< .cse2 (+ .cse23 1)) (< .cse26 .cse2) (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (= (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296) (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (< .cse2 (+ .cse18 1)) (< .cse21 .cse1) (< .cse1 (+ .cse19 1)) (< .cse20 .cse2)))) is different from false [2025-01-24 02:14:55,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse18 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse17 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse8 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse6 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse21 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse22 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse14 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse15 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse16 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse19 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse1 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse12 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse9 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse24 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse23 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse4 (mod c_~a~0 4294967296)) (.cse25 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse20 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse0 (mod c_~b~0 4294967296))) (and (or (< .cse0 (+ .cse1 1)) (< .cse2 .cse0) (< .cse3 .cse4) (= (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse4 (+ .cse5 1))) (or (= (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse0 (+ .cse6 1)) (< .cse7 .cse4) (< .cse4 (+ .cse8 1)) (< .cse9 .cse0)) (or (< .cse0 (+ .cse10 1)) (< .cse11 .cse4) (= (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296) (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (< .cse12 .cse0) (< .cse4 (+ .cse13 1))) (or (< .cse4 (+ .cse14 1)) (< .cse10 .cse0) (< .cse13 .cse4) (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (< .cse0 (+ .cse15 1))) (or (< .cse16 .cse4) (< .cse0 (+ .cse17 1)) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse4 (+ .cse18 1)) (< .cse19 .cse0)) (or (= (mod c_~x_2~0 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse18 .cse4) (< .cse0 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (< .cse17 .cse0)) (or (< .cse0 (+ .cse20 1)) (= (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296) (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (< .cse21 .cse4) (< .cse22 .cse0) (< .cse4 (+ .cse23 1))) (or (< .cse8 .cse4) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (< .cse6 .cse0) (< .cse0 (+ .cse2 1)) (< .cse4 (+ .cse3 1))) (or (< .cse4 (+ .cse21 1)) (< .cse0 (+ .cse22 1)) (< .cse14 .cse4) (< .cse15 .cse0) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (< .cse4 (+ .cse16 1)) (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (< .cse0 (+ .cse19 1)) (< .cse5 .cse4) (< .cse1 .cse0)) (or (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296) .cse0) (< .cse4 (+ .cse11 1)) (= (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296) (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296) .cse4) (< .cse0 (+ .cse12 1))) (or (< .cse24 .cse0) (< .cse25 .cse4) (< .cse0 (+ .cse9 1)) (< .cse4 (+ .cse7 1)) (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296))) (or (< .cse0 (+ .cse24 1)) (= (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (< .cse23 .cse4) (< .cse4 (+ .cse25 1)) (< .cse20 .cse0)))) is different from false [2025-01-24 02:14:57,433 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse13 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse15 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse12 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse0 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse9 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse6 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse22 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse23 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse20 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse25 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse21 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse24 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse16 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse19 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse1 (mod c_~a~0 4294967296)) (.cse17 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse18 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod c_~b~0 4294967296))) (and (or (< .cse0 .cse1) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse2 (+ .cse3 1)) (< .cse1 (+ .cse4 1)) (< .cse5 .cse2)) (or (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (< .cse2 (+ .cse6 1)) (< .cse7 .cse1) (< .cse8 .cse2) (< .cse1 (+ .cse9 1))) (or (< .cse2 (+ .cse8 1)) (< .cse10 .cse2) (< .cse11 .cse1) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse1 (+ .cse7 1))) (or (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (< .cse12 .cse1) (< .cse1 (+ .cse13 1)) (< .cse2 (+ .cse14 1)) (< .cse15 .cse2)) (or (< .cse13 .cse1) (< .cse14 .cse2) (= (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse2 (+ .cse10 1)) (< .cse1 (+ .cse11 1))) (or (< .cse16 .cse2) (< .cse2 (+ .cse15 1)) (= (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (< .cse17 .cse1) (< .cse1 (+ .cse12 1))) (or (< .cse1 (+ .cse0 1)) (< .cse2 (+ .cse5 1)) (< .cse9 .cse1) (= (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse6 .cse2)) (or (< .cse3 .cse2) (< .cse4 .cse1) (= (mod c_~x_1~0 4294967296) (mod c_~x_2~0 4294967296))) (or (< .cse2 (+ .cse18 1)) (< .cse1 (+ .cse19 1)) (< .cse20 .cse1) (< .cse21 .cse2) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296))) (or (< .cse2 (+ .cse22 1)) (< .cse1 (+ .cse23 1)) (= (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296) (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296) .cse2) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296) .cse1)) (or (< .cse22 .cse2) (< .cse23 .cse1) (< .cse2 (+ .cse24 1)) (= (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296) (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (< .cse1 (+ .cse25 1))) (or (< .cse1 (+ .cse20 1)) (< .cse25 .cse1) (< .cse2 (+ .cse21 1)) (< .cse24 .cse2) (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (= (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296) (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (< .cse2 (+ .cse16 1)) (< .cse19 .cse1) (< .cse1 (+ .cse17 1)) (< .cse18 .cse2)))) is different from false [2025-01-24 02:14:59,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse16 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse15 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse8 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse6 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse19 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse20 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse12 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse13 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse14 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse17 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse1 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse9 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse22 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse21 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse4 (mod c_~a~0 4294967296)) (.cse23 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse18 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse0 (mod c_~b~0 4294967296))) (and (or (< .cse0 (+ .cse1 1)) (< .cse2 .cse0) (< .cse3 .cse4) (= (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse4 (+ .cse5 1))) (or (= (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse0 (+ .cse6 1)) (< .cse7 .cse4) (< .cse4 (+ .cse8 1)) (< .cse9 .cse0)) (or (< .cse0 (+ .cse10 1)) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296) .cse4) (= (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296) (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296) .cse0) (< .cse4 (+ .cse11 1))) (or (< .cse4 (+ .cse12 1)) (< .cse10 .cse0) (< .cse11 .cse4) (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (< .cse0 (+ .cse13 1))) (or (< .cse14 .cse4) (< .cse0 (+ .cse15 1)) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse4 (+ .cse16 1)) (< .cse17 .cse0)) (or (= (mod c_~x_2~0 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse16 .cse4) (< .cse0 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (< .cse15 .cse0)) (or (< .cse0 (+ .cse18 1)) (= (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296) (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (< .cse19 .cse4) (< .cse20 .cse0) (< .cse4 (+ .cse21 1))) (or (< .cse8 .cse4) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (< .cse6 .cse0) (< .cse0 (+ .cse2 1)) (< .cse4 (+ .cse3 1))) (or (< .cse4 (+ .cse19 1)) (< .cse0 (+ .cse20 1)) (< .cse12 .cse4) (< .cse13 .cse0) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (< .cse4 (+ .cse14 1)) (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (< .cse0 (+ .cse17 1)) (< .cse5 .cse4) (< .cse1 .cse0)) (or (< .cse22 .cse0) (< .cse23 .cse4) (< .cse0 (+ .cse9 1)) (< .cse4 (+ .cse7 1)) (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296))) (or (< .cse0 (+ .cse22 1)) (= (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (< .cse21 .cse4) (< .cse4 (+ .cse23 1)) (< .cse18 .cse0)))) is different from false [2025-01-24 02:15:01,456 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse13 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse15 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse12 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse0 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse9 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse6 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse20 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse23 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse21 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse22 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse16 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse19 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse1 (mod c_~a~0 4294967296)) (.cse17 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse18 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod c_~b~0 4294967296))) (and (or (< .cse0 .cse1) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse2 (+ .cse3 1)) (< .cse1 (+ .cse4 1)) (< .cse5 .cse2)) (or (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (< .cse2 (+ .cse6 1)) (< .cse7 .cse1) (< .cse8 .cse2) (< .cse1 (+ .cse9 1))) (or (< .cse2 (+ .cse8 1)) (< .cse10 .cse2) (< .cse11 .cse1) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse1 (+ .cse7 1))) (or (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (< .cse12 .cse1) (< .cse1 (+ .cse13 1)) (< .cse2 (+ .cse14 1)) (< .cse15 .cse2)) (or (< .cse13 .cse1) (< .cse14 .cse2) (= (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse2 (+ .cse10 1)) (< .cse1 (+ .cse11 1))) (or (< .cse16 .cse2) (< .cse2 (+ .cse15 1)) (= (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (< .cse17 .cse1) (< .cse1 (+ .cse12 1))) (or (< .cse1 (+ .cse0 1)) (< .cse2 (+ .cse5 1)) (< .cse9 .cse1) (= (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse6 .cse2)) (or (< .cse3 .cse2) (< .cse4 .cse1) (= (mod c_~x_1~0 4294967296) (mod c_~x_2~0 4294967296))) (or (< .cse2 (+ .cse18 1)) (< .cse1 (+ .cse19 1)) (< .cse20 .cse1) (< .cse21 .cse2) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296))) (or (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296) .cse2) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296) .cse1) (< .cse2 (+ .cse22 1)) (= (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296) (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (< .cse1 (+ .cse23 1))) (or (< .cse1 (+ .cse20 1)) (< .cse23 .cse1) (< .cse2 (+ .cse21 1)) (< .cse22 .cse2) (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (= (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296) (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (< .cse2 (+ .cse16 1)) (< .cse19 .cse1) (< .cse1 (+ .cse17 1)) (< .cse18 .cse2)))) is different from false [2025-01-24 02:15:03,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse13 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse8 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse6 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse17 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse18 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse10 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse11 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse12 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse15 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse1 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse9 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse20 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse19 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse4 (mod c_~a~0 4294967296)) (.cse21 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse16 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse0 (mod c_~b~0 4294967296))) (and (or (< .cse0 (+ .cse1 1)) (< .cse2 .cse0) (< .cse3 .cse4) (= (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse4 (+ .cse5 1))) (or (= (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse0 (+ .cse6 1)) (< .cse7 .cse4) (< .cse4 (+ .cse8 1)) (< .cse9 .cse0)) (or (< .cse4 (+ .cse10 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296) .cse0) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296) .cse4) (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (< .cse0 (+ .cse11 1))) (or (< .cse12 .cse4) (< .cse0 (+ .cse13 1)) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse4 (+ .cse14 1)) (< .cse15 .cse0)) (or (= (mod c_~x_2~0 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse14 .cse4) (< .cse0 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (< .cse13 .cse0)) (or (< .cse0 (+ .cse16 1)) (= (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296) (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (< .cse17 .cse4) (< .cse18 .cse0) (< .cse4 (+ .cse19 1))) (or (< .cse8 .cse4) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (< .cse6 .cse0) (< .cse0 (+ .cse2 1)) (< .cse4 (+ .cse3 1))) (or (< .cse4 (+ .cse17 1)) (< .cse0 (+ .cse18 1)) (< .cse10 .cse4) (< .cse11 .cse0) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (< .cse4 (+ .cse12 1)) (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (< .cse0 (+ .cse15 1)) (< .cse5 .cse4) (< .cse1 .cse0)) (or (< .cse20 .cse0) (< .cse21 .cse4) (< .cse0 (+ .cse9 1)) (< .cse4 (+ .cse7 1)) (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296))) (or (< .cse0 (+ .cse20 1)) (= (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (< .cse19 .cse4) (< .cse4 (+ .cse21 1)) (< .cse16 .cse0)))) is different from false [2025-01-24 02:15:05,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse13 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse15 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse12 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse0 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse9 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse6 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse20 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse21 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse16 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse19 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse1 (mod c_~a~0 4294967296)) (.cse17 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse18 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod c_~b~0 4294967296))) (and (or (< .cse0 .cse1) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse2 (+ .cse3 1)) (< .cse1 (+ .cse4 1)) (< .cse5 .cse2)) (or (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (< .cse2 (+ .cse6 1)) (< .cse7 .cse1) (< .cse8 .cse2) (< .cse1 (+ .cse9 1))) (or (< .cse2 (+ .cse8 1)) (< .cse10 .cse2) (< .cse11 .cse1) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse1 (+ .cse7 1))) (or (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (< .cse12 .cse1) (< .cse1 (+ .cse13 1)) (< .cse2 (+ .cse14 1)) (< .cse15 .cse2)) (or (< .cse13 .cse1) (< .cse14 .cse2) (= (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse2 (+ .cse10 1)) (< .cse1 (+ .cse11 1))) (or (< .cse16 .cse2) (< .cse2 (+ .cse15 1)) (= (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (< .cse17 .cse1) (< .cse1 (+ .cse12 1))) (or (< .cse1 (+ .cse0 1)) (< .cse2 (+ .cse5 1)) (< .cse9 .cse1) (= (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse6 .cse2)) (or (< .cse3 .cse2) (< .cse4 .cse1) (= (mod c_~x_1~0 4294967296) (mod c_~x_2~0 4294967296))) (or (< .cse2 (+ .cse18 1)) (< .cse1 (+ .cse19 1)) (< .cse20 .cse1) (< .cse21 .cse2) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296))) (or (< .cse1 (+ .cse20 1)) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296) .cse1) (< .cse2 (+ .cse21 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296) .cse2) (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (= (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296) (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (< .cse2 (+ .cse16 1)) (< .cse19 .cse1) (< .cse1 (+ .cse17 1)) (< .cse18 .cse2)))) is different from false [2025-01-24 02:15:07,489 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse11 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse8 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse6 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse15 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse16 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse10 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse13 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse1 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse9 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse18 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse17 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse4 (mod c_~a~0 4294967296)) (.cse19 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse14 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse0 (mod c_~b~0 4294967296))) (and (or (< .cse0 (+ .cse1 1)) (< .cse2 .cse0) (< .cse3 .cse4) (= (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse4 (+ .cse5 1))) (or (= (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse0 (+ .cse6 1)) (< .cse7 .cse4) (< .cse4 (+ .cse8 1)) (< .cse9 .cse0)) (or (< .cse10 .cse4) (< .cse0 (+ .cse11 1)) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse4 (+ .cse12 1)) (< .cse13 .cse0)) (or (= (mod c_~x_2~0 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse12 .cse4) (< .cse0 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (< .cse11 .cse0)) (or (< .cse0 (+ .cse14 1)) (= (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296) (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (< .cse15 .cse4) (< .cse16 .cse0) (< .cse4 (+ .cse17 1))) (or (< .cse8 .cse4) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (< .cse6 .cse0) (< .cse0 (+ .cse2 1)) (< .cse4 (+ .cse3 1))) (or (< .cse4 (+ .cse15 1)) (< .cse0 (+ .cse16 1)) (< (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse4) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296) .cse0) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (< .cse4 (+ .cse10 1)) (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (< .cse0 (+ .cse13 1)) (< .cse5 .cse4) (< .cse1 .cse0)) (or (< .cse18 .cse0) (< .cse19 .cse4) (< .cse0 (+ .cse9 1)) (< .cse4 (+ .cse7 1)) (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296))) (or (< .cse0 (+ .cse18 1)) (= (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (< .cse17 .cse4) (< .cse4 (+ .cse19 1)) (< .cse14 .cse0)))) is different from false [2025-01-24 02:15:09,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse13 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse15 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse12 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse0 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse9 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse6 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse16 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse19 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse1 (mod c_~a~0 4294967296)) (.cse17 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse18 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod c_~b~0 4294967296))) (and (or (< .cse0 .cse1) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse2 (+ .cse3 1)) (< .cse1 (+ .cse4 1)) (< .cse5 .cse2)) (or (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (< .cse2 (+ .cse6 1)) (< .cse7 .cse1) (< .cse8 .cse2) (< .cse1 (+ .cse9 1))) (or (< .cse2 (+ .cse8 1)) (< .cse10 .cse2) (< .cse11 .cse1) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse1 (+ .cse7 1))) (or (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (< .cse12 .cse1) (< .cse1 (+ .cse13 1)) (< .cse2 (+ .cse14 1)) (< .cse15 .cse2)) (or (< .cse13 .cse1) (< .cse14 .cse2) (= (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse2 (+ .cse10 1)) (< .cse1 (+ .cse11 1))) (or (< .cse16 .cse2) (< .cse2 (+ .cse15 1)) (= (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (< .cse17 .cse1) (< .cse1 (+ .cse12 1))) (or (< .cse1 (+ .cse0 1)) (< .cse2 (+ .cse5 1)) (< .cse9 .cse1) (= (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse6 .cse2)) (or (< .cse3 .cse2) (< .cse4 .cse1) (= (mod c_~x_1~0 4294967296) (mod c_~x_2~0 4294967296))) (or (< .cse2 (+ .cse18 1)) (< .cse1 (+ .cse19 1)) (< (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse1) (< (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse2) (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296))) (or (= (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296) (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (< .cse2 (+ .cse16 1)) (< .cse19 .cse1) (< .cse1 (+ .cse17 1)) (< .cse18 .cse2)))) is different from false [2025-01-24 02:15:11,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse11 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse8 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse6 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse10 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse13 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse1 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse9 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse16 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse15 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse4 (mod c_~a~0 4294967296)) (.cse17 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse14 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse0 (mod c_~b~0 4294967296))) (and (or (< .cse0 (+ .cse1 1)) (< .cse2 .cse0) (< .cse3 .cse4) (= (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296) (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (< .cse4 (+ .cse5 1))) (or (= (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (< .cse0 (+ .cse6 1)) (< .cse7 .cse4) (< .cse4 (+ .cse8 1)) (< .cse9 .cse0)) (or (< .cse10 .cse4) (< .cse0 (+ .cse11 1)) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (< .cse4 (+ .cse12 1)) (< .cse13 .cse0)) (or (= (mod c_~x_2~0 4294967296) (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse12 .cse4) (< .cse0 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (< .cse11 .cse0)) (or (< .cse0 (+ .cse14 1)) (= (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296) (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296) .cse4) (< (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse0) (< .cse4 (+ .cse15 1))) (or (< .cse8 .cse4) (= (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296) (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (< .cse6 .cse0) (< .cse0 (+ .cse2 1)) (< .cse4 (+ .cse3 1))) (or (< .cse4 (+ .cse10 1)) (= (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296) (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (< .cse0 (+ .cse13 1)) (< .cse5 .cse4) (< .cse1 .cse0)) (or (< .cse16 .cse0) (< .cse17 .cse4) (< .cse0 (+ .cse9 1)) (< .cse4 (+ .cse7 1)) (= (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296) (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296))) (or (< .cse0 (+ .cse16 1)) (= (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296) (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (< .cse15 .cse4) (< .cse4 (+ .cse17 1)) (< .cse14 .cse0)))) is different from false [2025-01-24 02:17:22,602 WARN L286 SmtUtils]: Spent 53.45s on a formula simplification that was a NOOP. DAG size: 168 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:17:24,617 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 [] [2025-01-24 02:17:26,770 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 [] [2025-01-24 02:17:28,848 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 [] [2025-01-24 02:17:30,852 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 [] [2025-01-24 02:17:34,601 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 [] [2025-01-24 02:17:36,605 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 [] [2025-01-24 02:17:38,610 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 [] [2025-01-24 02:17:40,616 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 [] [2025-01-24 02:17:43,298 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 [] [2025-01-24 02:17:45,302 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 [] [2025-01-24 02:17:47,305 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 [] [2025-01-24 02:17:49,312 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 [] [2025-01-24 02:17:51,317 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 [] [2025-01-24 02:17:53,329 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 [] [2025-01-24 02:17:55,336 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 [] [2025-01-24 02:17:57,340 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 [] [2025-01-24 02:17:59,352 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 [] [2025-01-24 02:18:00,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:19:48,308 WARN L286 SmtUtils]: Spent 17.66s on a formula simplification that was a NOOP. DAG size: 156 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:19:50,312 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 [] [2025-01-24 02:19:51,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:19:53,811 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 [] [2025-01-24 02:19:55,814 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 [] [2025-01-24 02:19:57,829 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 [] [2025-01-24 02:19:59,832 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 [] [2025-01-24 02:20:01,834 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 [] [2025-01-24 02:20:03,837 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 [] [2025-01-24 02:20:05,839 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 [] [2025-01-24 02:20:07,842 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 [] [2025-01-24 02:20:10,291 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 [] [2025-01-24 02:20:12,294 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 [] [2025-01-24 02:20:14,300 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 [] [2025-01-24 02:20:16,302 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 [] [2025-01-24 02:20:18,305 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 [] [2025-01-24 02:20:19,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15