/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-aee53f6 [2024-11-15 23:16:32,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-15 23:16:32,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-15 23:16:32,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-15 23:16:32,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-15 23:16:32,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-15 23:16:32,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-15 23:16:32,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-15 23:16:32,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-15 23:16:32,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-15 23:16:32,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-15 23:16:32,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-15 23:16:32,375 INFO L153 SettingsManager]: * Use SBE=true [2024-11-15 23:16:32,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-15 23:16:32,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-15 23:16:32,375 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-15 23:16:32,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-15 23:16:32,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-15 23:16:32,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-15 23:16:32,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-15 23:16:32,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-15 23:16:32,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-15 23:16:32,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-15 23:16:32,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-15 23:16:32,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-15 23:16:32,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-15 23:16:32,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-15 23:16:32,377 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-15 23:16:32,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-15 23:16:32,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 23:16:32,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-15 23:16:32,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-15 23:16:32,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-15 23:16:32,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-15 23:16:32,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-15 23:16:32,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-15 23:16:32,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-15 23:16:32,379 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-15 23:16:32,379 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-15 23:16:32,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-15 23:16:32,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-15 23:16:32,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-15 23:16:32,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-15 23:16:32,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-15 23:16:32,651 INFO L274 PluginConnector]: CDTParser initialized [2024-11-15 23:16:32,652 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 [2024-11-15 23:16:33,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-15 23:16:34,175 INFO L384 CDTParser]: Found 1 translation units. [2024-11-15 23:16:34,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-11-15 23:16:34,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/b9011e1a5/c4fa57de5b714ac6a4d81660cc4b3706/FLAGc906af809 [2024-11-15 23:16:34,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/b9011e1a5/c4fa57de5b714ac6a4d81660cc4b3706 [2024-11-15 23:16:34,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-15 23:16:34,502 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-15 23:16:34,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-15 23:16:34,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-15 23:16:34,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-15 23:16:34,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ddfb5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34, skipping insertion in model container [2024-11-15 23:16:34,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-15 23:16:34,661 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] [2024-11-15 23:16:34,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 23:16:34,673 INFO L200 MainTranslator]: Completed pre-run [2024-11-15 23:16:34,684 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] [2024-11-15 23:16:34,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 23:16:34,693 INFO L204 MainTranslator]: Completed translation [2024-11-15 23:16:34,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34 WrapperNode [2024-11-15 23:16:34,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-15 23:16:34,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-15 23:16:34,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-15 23:16:34,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-15 23:16:34,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,715 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-11-15 23:16:34,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-15 23:16:34,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-15 23:16:34,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-15 23:16:34,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-15 23:16:34,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-15 23:16:34,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-15 23:16:34,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-15 23:16:34,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-15 23:16:34,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (1/1) ... [2024-11-15 23:16:34,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 23:16:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 23:16:34,773 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) [2024-11-15 23:16:34,776 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 [2024-11-15 23:16:34,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-15 23:16:34,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-15 23:16:34,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-15 23:16:34,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-15 23:16:34,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-15 23:16:34,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-15 23:16:34,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-15 23:16:34,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-15 23:16:34,795 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-15 23:16:34,858 INFO L238 CfgBuilder]: Building ICFG [2024-11-15 23:16:34,860 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-15 23:16:34,979 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-15 23:16:34,979 INFO L287 CfgBuilder]: Performing block encoding [2024-11-15 23:16:34,986 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-15 23:16:34,987 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-15 23:16:34,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:16:34 BoogieIcfgContainer [2024-11-15 23:16:34,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-15 23:16:34,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-15 23:16:34,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-15 23:16:34,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-15 23:16:34,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:16:34" (1/3) ... [2024-11-15 23:16:34,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d2b33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:16:34, skipping insertion in model container [2024-11-15 23:16:34,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:16:34" (2/3) ... [2024-11-15 23:16:34,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d2b33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:16:34, skipping insertion in model container [2024-11-15 23:16:34,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:16:34" (3/3) ... [2024-11-15 23:16:34,996 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2024-11-15 23:16:35,008 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-15 23:16:35,010 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 70 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-15 23:16:35,010 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-15 23:16:35,070 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-15 23:16:35,114 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 23:16:35,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-15 23:16:35,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 23:16:35,117 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) [2024-11-15 23:16:35,118 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 [2024-11-15 23:16:35,177 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 23:16:35,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 23:16:35,195 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;@773f7527, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 23:16:35,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-15 23:16:35,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 23:16:35,401 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 23:16:35,402 INFO L132 ounterexampleChecker]: Examining path program with hash -1477555108, occurence #1 [2024-11-15 23:16:35,402 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 23:16:35,402 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 23:16:35,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 23:16:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1808911534, now seen corresponding path program 1 times [2024-11-15 23:16:35,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 23:16:35,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421446780] [2024-11-15 23:16:35,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 23:16:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 23:16:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 23:16:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 23:16:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 23:16:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421446780] [2024-11-15 23:16:35,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421446780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 23:16:35,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 23:16:35,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-15 23:16:35,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672330628] [2024-11-15 23:16:35,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 23:16:35,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-15 23:16:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 23:16:35,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-15 23:16:35,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-15 23:16:35,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:16:35,658 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 23:16:35,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 23:16:35,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:16:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:16:35,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-15 23:16:35,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 23:16:35,689 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 23:16:35,690 INFO L132 ounterexampleChecker]: Examining path program with hash 241256336, occurence #1 [2024-11-15 23:16:35,690 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 23:16:35,690 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 23:16:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 23:16:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1188606341, now seen corresponding path program 1 times [2024-11-15 23:16:35,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 23:16:35,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461657968] [2024-11-15 23:16:35,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 23:16:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 23:16:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 23:16:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 23:16:36,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 23:16:36,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461657968] [2024-11-15 23:16:36,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461657968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 23:16:36,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 23:16:36,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-15 23:16:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403267097] [2024-11-15 23:16:36,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 23:16:36,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-15 23:16:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 23:16:36,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-15 23:16:36,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-15 23:16:36,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:16:36,410 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 23:16:36,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 23:16:36,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:16:36,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:16:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:16:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-15 23:16:36,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-15 23:16:36,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 23:16:36,522 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 23:16:36,522 INFO L132 ounterexampleChecker]: Examining path program with hash 1599916279, occurence #1 [2024-11-15 23:16:36,522 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 23:16:36,522 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 23:16:36,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 23:16:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash -742018735, now seen corresponding path program 1 times [2024-11-15 23:16:36,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 23:16:36,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53926115] [2024-11-15 23:16:36,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 23:16:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 23:16:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 23:16:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 23:16:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 23:16:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53926115] [2024-11-15 23:16:39,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53926115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-15 23:16:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726619810] [2024-11-15 23:16:39,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 23:16:39,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-15 23:16:39,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 23:16:39,516 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) [2024-11-15 23:16:39,517 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 [2024-11-15 23:16:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 23:16:39,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-15 23:16:39,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-15 23:16:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 23:16:40,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-15 23:17:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 23:17:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726619810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-15 23:17:11,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-15 23:17:11,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 51 [2024-11-15 23:17:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204112289] [2024-11-15 23:17:11,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-15 23:17:11,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-15 23:17:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 23:17:11,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-15 23:17:11,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2233, Unknown=11, NotChecked=0, Total=2550 [2024-11-15 23:17:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:17:11,520 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 23:17:11,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.823529411764706) internal successors, (144), 51 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 23:17:11,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:17:11,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-15 23:17:11,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:17:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:17:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-15 23:17:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-11-15 23:17:23,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-15 23:17:23,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-15 23:17:23,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 23:17:23,666 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 23:17:23,666 INFO L132 ounterexampleChecker]: Examining path program with hash 1599916279, occurence #2 [2024-11-15 23:17:23,666 INFO L137 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-15 23:17:23,666 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-11-15 23:17:23,667 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,667 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2024-11-15 23:17:23,667 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,667 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-15 23:17:23,668 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,668 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-11-15 23:17:23,668 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,668 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2024-11-15 23:17:23,668 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,668 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2024-11-15 23:17:23,668 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,668 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-11-15 23:17:23,668 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,668 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2024-11-15 23:17:23,668 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,668 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2024-11-15 23:17:23,668 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,669 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2024-11-15 23:17:23,669 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,669 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2024-11-15 23:17:23,678 WARN L177 ounterexampleChecker]: Statements were already independent. [2024-11-15 23:17:23,678 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2024-11-15 23:17:23,678 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,678 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2024-11-15 23:17:23,678 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,678 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2024-11-15 23:17:23,678 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,678 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2024-11-15 23:17:23,678 WARN L177 ounterexampleChecker]: Statements were already independent. [2024-11-15 23:17:23,678 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 79 [2024-11-15 23:17:23,679 WARN L177 ounterexampleChecker]: Statements were already independent. [2024-11-15 23:17:23,679 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 81 [2024-11-15 23:17:23,679 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,679 INFO L158 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 84 [2024-11-15 23:17:23,679 INFO L194 ounterexampleChecker]: No commutativity condition found. [2024-11-15 23:17:23,679 WARN L199 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-15 23:17:23,679 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 23:17:23,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 23:17:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash -480672791, now seen corresponding path program 2 times [2024-11-15 23:17:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 23:17:23,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811531962] [2024-11-15 23:17:23,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 23:17:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 23:17:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 23:17:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 23:17:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 23:17:26,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811531962] [2024-11-15 23:17:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811531962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-15 23:17:26,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790884167] [2024-11-15 23:17:26,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-15 23:17:26,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-15 23:17:26,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 23:17:26,119 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) [2024-11-15 23:17:26,121 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 [2024-11-15 23:17:26,245 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-15 23:17:26,245 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-15 23:17:26,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-15 23:17:26,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-15 23:17:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 23:17:31,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-15 23:18:23,588 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse7 (+ .cse3 4294967296)) (.cse4 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse2 (+ v_z_23 .cse5)) (.cse1 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse0 .cse1) (< v_z_23 0) (< 4294967295 .cse2) (= .cse3 .cse2) (< .cse1 .cse4)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse8 (+ v_z_23 .cse5)) (.cse6 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse0 .cse6) (= .cse7 .cse8) (< v_z_23 0) (= .cse3 .cse8) (< .cse6 .cse4) (< 4294967295 v_z_23)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse9 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse10 (+ v_z_23 .cse5))) (or (< .cse0 .cse9) (= .cse7 .cse10) (< .cse9 .cse4) (< 4294967295 v_z_23) (< .cse10 4294967296))))))) is different from false [2024-11-15 23:18:26,248 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse0 (+ .cse2 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse1 (+ v_z_23 .cse3))) (or (= .cse0 .cse1) (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (= .cse2 .cse1) (< 4294967295 v_z_23)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse4 (+ v_z_23 .cse3))) (or (= .cse0 .cse4) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (< .cse4 4294967296)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse5 (+ v_z_23 .cse3))) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 .cse5) (= .cse2 .cse5))))))) is different from false [2024-11-15 23:18:29,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_y_23 Int) (v_z_23 Int)) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (= (mod (+ c_~x_1~0 12) 4294967296) v_z_23))) is different from false [2024-11-15 23:18:41,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_y_23 Int) (v_z_23 Int)) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (= v_z_23 12))) is different from false [2024-11-15 23:18:43,129 WARN L873 $PredicateComparison]: unable to prove that (forall ((v_y_23 Int) (v_z_23 Int)) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (= v_z_23 12))) is different from true [2024-11-15 23:19:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 23:19:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790884167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-15 23:19:33,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-15 23:19:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 34] total 86 [2024-11-15 23:19:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103302055] [2024-11-15 23:19:33,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-15 23:19:33,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-11-15 23:19:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 23:19:33,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-11-15 23:19:33,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=6217, Unknown=19, NotChecked=652, Total=7310 [2024-11-15 23:19:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:19:33,361 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 23:19:33,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 2.383720930232558) internal successors, (205), 86 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 23:19:33,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:19:33,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-15 23:19:33,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2024-11-15 23:19:33,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 23:19:35,420 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_y_23 Int) (v_z_23 Int)) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (= (mod (+ c_~x_1~0 12) 4294967296) v_z_23))) (= c_~x_1~0 0)) is different from false [2024-11-15 23:19:37,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse0 (+ .cse2 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse1 (+ v_z_23 .cse3))) (or (= .cse0 .cse1) (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (= .cse2 .cse1) (< 4294967295 v_z_23)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse4 (+ v_z_23 .cse3))) (or (= .cse0 .cse4) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 v_z_23) (< .cse4 4294967296)))) (= c_~x_1~0 0) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse5 (+ v_z_23 .cse3))) (or (< v_z_23 0) (not (= (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)) 4)) (< 4294967295 .cse5) (= .cse2 .cse5))))))) is different from false [2024-11-15 23:19:39,579 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse7 (+ .cse3 4294967296)) (.cse4 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse2 (+ v_z_23 .cse5)) (.cse1 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse0 .cse1) (< v_z_23 0) (< 4294967295 .cse2) (= .cse3 .cse2) (< .cse1 .cse4)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse8 (+ v_z_23 .cse5)) (.cse6 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse0 .cse6) (= .cse7 .cse8) (< v_z_23 0) (= .cse3 .cse8) (< .cse6 .cse4) (< 4294967295 v_z_23)))) (= c_~x_1~0 0) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse9 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse10 (+ v_z_23 .cse5))) (or (< .cse0 .cse9) (= .cse7 .cse10) (< .cse9 .cse4) (< 4294967295 v_z_23) (< .cse10 4294967296))))))) is different from false [2024-11-15 23:19:41,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse1 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse6 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse7 (mod c_~x_2~0 4294967296)) (.cse2 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1))) (and (forall ((v_z_25 Int)) (or (< .cse0 v_z_25) (< v_z_25 .cse1) (< v_z_25 .cse2) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse4 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse5 (+ v_z_23 .cse7))) (or (< .cse3 .cse4) (< v_z_23 0) (< 4294967295 .cse5) (< .cse4 .cse6) (= (mod (+ (* v_z_25 4) c_~x_1~0) 4294967296) .cse5)))))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (forall ((v_z_25 Int)) (or (< .cse0 v_z_25) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse8 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse9 (+ v_z_23 .cse7))) (or (< .cse3 .cse8) (< .cse8 .cse6) (< 4294967295 v_z_23) (< .cse9 4294967296) (= (+ (mod (+ (* v_z_25 4) c_~x_1~0) 4294967296) 4294967296) .cse9)))) (< v_z_25 .cse1) (< v_z_25 .cse2))) (forall ((v_z_25 Int)) (or (< .cse0 v_z_25) (< v_z_25 .cse1) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse10 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse11 (mod (+ (* v_z_25 4) c_~x_1~0) 4294967296)) (.cse12 (+ v_z_23 .cse7))) (or (< .cse3 .cse10) (< v_z_23 0) (< .cse10 .cse6) (< 4294967295 v_z_23) (= .cse11 .cse12) (= (+ .cse11 4294967296) .cse12)))) (< v_z_25 .cse2))) (= c_~x_1~0 0))) is different from false [2024-11-15 23:20:16,433 WARN L286 SmtUtils]: Spent 18.10s on a formula simplification. DAG size of input: 61 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-15 23:20:18,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:20,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:22,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:24,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:26,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:28,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:30,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:32,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:37,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:39,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:41,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:20:43,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:08,168 WARN L286 SmtUtils]: Spent 18.08s on a formula simplification. DAG size of input: 78 DAG size of output: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-15 23:21:10,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:12,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:14,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:16,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:18,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:20,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:24,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:26,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:49,452 WARN L286 SmtUtils]: Spent 18.18s on a formula simplification. DAG size of input: 78 DAG size of output: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-15 23:21:51,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:53,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:21:55,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:23:45,052 WARN L286 SmtUtils]: Spent 18.19s on a formula simplification. DAG size of input: 57 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-15 23:23:47,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:23:49,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:23:51,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:23:53,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:24:15,765 WARN L286 SmtUtils]: Spent 18.20s on a formula simplification. DAG size of input: 79 DAG size of output: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-15 23:24:18,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:24:20,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:24:22,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:24:46,978 WARN L286 SmtUtils]: Spent 18.21s on a formula simplification. DAG size of input: 58 DAG size of output: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-15 23:24:49,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:24:51,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:24:53,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:24:56,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_2~0 4294967296))) (and (= c_~x_1~0 c_~a~0) (= c_~x_2~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1) (or (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) (mod c_~b~0 4294967296)) (= (mod c_~x_1~0 4294967296) .cse0)) (let ((.cse11 (mod c_~a~0 4294967296))) (or (let ((.cse7 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296))) (let ((.cse5 (+ .cse7 4294967296)) (.cse1 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse3 (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse2 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse4 (+ v_z_23 .cse0))) (or (< .cse1 .cse2) (< .cse2 .cse3) (< 4294967295 v_z_23) (< .cse4 4294967296) (= .cse5 .cse4)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse6 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse8 (+ v_z_23 .cse0))) (or (< v_z_23 0) (< .cse1 .cse6) (= .cse7 .cse8) (< .cse6 .cse3) (< 4294967295 v_z_23) (= .cse5 .cse8)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse10 (+ v_z_23 .cse0)) (.cse9 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse1 .cse9) (= .cse7 .cse10) (< 4294967295 .cse10) (< .cse9 .cse3))))))) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse11) (< .cse11 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)))))) is different from false [2024-11-15 23:24:58,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:00,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:35,515 WARN L286 SmtUtils]: Spent 28.49s on a formula simplification. DAG size of input: 117 DAG size of output: 79 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-15 23:25:37,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:39,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:41,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:43,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:45,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:47,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:49,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:51,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:53,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:56,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:25:58,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:26:00,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:26:02,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:26:04,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:26:06,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:26:49,280 WARN L286 SmtUtils]: Spent 28.24s on a formula simplification. DAG size of input: 65 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-15 23:26:51,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:26:53,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-15 23:27:31,188 WARN L286 SmtUtils]: Spent 30.47s on a formula simplification. DAG size of input: 117 DAG size of output: 77 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-15 23:28:49,155 WARN L286 SmtUtils]: Spent 56.90s on a formula simplification. DAG size of input: 147 DAG size of output: 116 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-15 23:30:04,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-15 23:30:35,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse55 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (let ((.cse33 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse48 (+ .cse55 1)) (.cse29 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse21 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse14 (mod c_~x_1~0 4294967296)) (.cse56 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse22 (mod c_~b~0 4294967296)) (.cse11 (mod c_~x_2~0 4294967296)) (.cse37 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (.cse46 (* 2 c_~a~0)) (.cse54 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse9 (mod c_~a~0 4294967296)) (.cse57 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (let ((.cse0 (< .cse9 (+ .cse57 1))) (.cse2 (< .cse54 .cse9)) (.cse4 (mod (+ c_~x_1~0 .cse46) 4294967296)) (.cse15 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse18 (= .cse11 .cse37)) (.cse19 (< .cse22 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse20 (< .cse56 .cse22)) (.cse16 (= .cse14 .cse11)) (.cse17 (< .cse57 .cse9)) (.cse6 (< .cse22 (+ .cse56 1))) (.cse7 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse8 (< .cse55 .cse22)) (.cse35 (< .cse9 (+ .cse21 1))) (.cse27 (+ .cse29 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse1 (< .cse22 .cse48)) (.cse34 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse9)) (.cse5 (< .cse33 .cse22)) (.cse36 (< .cse9 (+ .cse54 1)))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or .cse0 .cse6 .cse2 (= .cse7 .cse4) .cse8) (<= 1 .cse9) (let ((.cse10 (* 12884901888 (div c_~b~0 4294967296))) (.cse12 (* 3 c_thread1Thread1of1ForFork0_~i~0)) (.cse13 (* 3 c_~b~0))) (or (< (+ 4294967283 .cse10 .cse11 .cse12) .cse13) (and (<= .cse14 .cse11) (or (< (+ .cse10 .cse11 .cse12) (+ .cse14 (* .cse15 12884901888) .cse13 1)) .cse16)))) (<= 0 .cse15) (= c_thread2Thread1of1ForFork1_~i~1 1) (or .cse17 .cse18 .cse19 .cse20) (or .cse18 (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post2| 1) 4294967296) .cse9) .cse19 .cse20) (or (< .cse21 .cse9) .cse16 (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 1) 4294967296) .cse22)) (or (let ((.cse23 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse25 (+ .cse33 1))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse24 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse26 (+ v_z_23 .cse11))) (or (< .cse23 .cse24) (< .cse24 .cse25) (< 4294967295 v_z_23) (< .cse26 4294967296) (= .cse27 .cse26)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse30 (+ v_z_23 .cse11)) (.cse28 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse23 .cse28) (< v_z_23 0) (= .cse29 .cse30) (< 4294967295 .cse30) (< .cse28 .cse25)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse31 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse32 (+ v_z_23 .cse11))) (or (< .cse23 .cse31) (< v_z_23 0) (= .cse29 .cse32) (< .cse31 .cse25) (< 4294967295 v_z_23) (= .cse27 .cse32)))))) .cse34 .cse35 .cse36) (or .cse17 .cse6 (= .cse7 .cse37) .cse35 .cse8) (= 2 c_thread1Thread1of1ForFork0_~i~0) (= |c_thread1Thread1of1ForFork0_#t~post1| 1) (or (let ((.cse39 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 3) 4294967296) 1)) (.cse41 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 4) 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse38 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse40 (+ v_z_23 .cse11))) (or (< .cse38 .cse39) (< 4294967295 v_z_23) (< .cse40 4294967296) (< .cse41 .cse38) (= .cse27 .cse40)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse43 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse42 (+ v_z_23 .cse11))) (or (< v_z_23 0) (= .cse29 .cse42) (< .cse43 .cse39) (< 4294967295 v_z_23) (< .cse41 .cse43) (= .cse27 .cse42)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse44 (+ v_z_23 .cse11)) (.cse45 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (= .cse29 .cse44) (< 4294967295 .cse44) (< .cse45 .cse39) (< .cse41 .cse45)))))) .cse34 .cse35 .cse36) (= c_~x_1~0 .cse46) (or (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse47 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse49 (+ v_z_23 .cse11))) (or (< .cse33 .cse47) (< .cse47 .cse48) (< 4294967295 v_z_23) (< .cse49 4294967296) (= .cse27 .cse49)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse50 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse51 (+ v_z_23 .cse11))) (or (< v_z_23 0) (< .cse33 .cse50) (= .cse29 .cse51) (< .cse50 .cse48) (< 4294967295 v_z_23) (= .cse27 .cse51)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse53 (+ v_z_23 .cse11)) (.cse52 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse33 .cse52) (= .cse29 .cse53) (< 4294967295 .cse53) (< .cse52 .cse48))))) .cse34 .cse36) (or (= .cse29 .cse3) .cse1 .cse34 .cse5 .cse36) (= c_~x_2~0 c_~b~0))))) is different from false [2024-11-15 23:30:38,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse46 (* 2 c_~a~0)) (.cse58 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (let ((.cse30 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse48 (+ .cse58 1)) (.cse26 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse54 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse7 (mod (+ c_~x_1~0 .cse46) 4294967296)) (.cse55 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse6 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse56 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse9 (mod c_~a~0 4294967296)) (.cse59 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse35 (mod c_~b~0 4294967296)) (.cse11 (mod c_~x_2~0 4294967296)) (.cse57 (mod (+ c_~x_1~0 c_~a~0) 4294967296))) (let ((.cse15 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse17 (= .cse11 .cse57)) (.cse18 (< .cse35 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse19 (< .cse59 .cse35)) (.cse5 (< .cse35 (+ .cse59 1))) (.cse8 (< .cse58 .cse35)) (.cse16 (< .cse56 .cse9)) (.cse34 (= .cse6 .cse57)) (.cse32 (< .cse9 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1))) (.cse45 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 3) 4294967296)) (.cse0 (< .cse9 (+ .cse56 1))) (.cse36 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 2) 4294967296)) (.cse2 (< .cse55 .cse9)) (.cse3 (= .cse54 .cse7)) (.cse24 (+ .cse26 4294967296)) (.cse1 (< .cse35 .cse48)) (.cse31 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse9)) (.cse4 (< .cse30 .cse35)) (.cse33 (< .cse9 (+ .cse55 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse2 (= .cse6 .cse7) .cse8) (<= 1 .cse9) (let ((.cse10 (* 12884901888 (div c_~b~0 4294967296))) (.cse12 (* 3 c_thread1Thread1of1ForFork0_~i~0)) (.cse13 (* 3 c_~b~0))) (or (< (+ 4294967283 .cse10 .cse11 .cse12) .cse13) (let ((.cse14 (mod c_~x_1~0 4294967296))) (and (<= .cse14 .cse11) (or (< (+ .cse10 .cse11 .cse12) (+ .cse14 (* .cse15 12884901888) .cse13 1)) (= .cse14 .cse11)))))) (<= 0 .cse15) (= c_thread2Thread1of1ForFork1_~i~1 1) (or .cse16 .cse17 .cse18 .cse19) (or .cse17 (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post2| 1) 4294967296) .cse9) .cse18 .cse19) (or (let ((.cse20 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse22 (+ .cse30 1))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse21 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse23 (+ v_z_23 .cse11))) (or (< .cse20 .cse21) (< .cse21 .cse22) (< 4294967295 v_z_23) (< .cse23 4294967296) (= .cse24 .cse23)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse27 (+ v_z_23 .cse11)) (.cse25 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< .cse20 .cse25) (< v_z_23 0) (= .cse26 .cse27) (< 4294967295 .cse27) (< .cse25 .cse22)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse28 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse29 (+ v_z_23 .cse11))) (or (< .cse20 .cse28) (< v_z_23 0) (= .cse26 .cse29) (< .cse28 .cse22) (< 4294967295 v_z_23) (= .cse24 .cse29)))))) .cse31 .cse32 .cse33) (or .cse16 .cse5 .cse34 .cse32 .cse8) (or .cse16 (< .cse35 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 1) 4294967296) 1)) .cse34 (< .cse36 .cse35) .cse32) (= 2 c_thread1Thread1of1ForFork0_~i~0) (or (let ((.cse38 (+ .cse45 1)) (.cse40 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 4) 4294967296))) (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse37 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse39 (+ v_z_23 .cse11))) (or (< .cse37 .cse38) (< 4294967295 v_z_23) (< .cse39 4294967296) (< .cse40 .cse37) (= .cse24 .cse39)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse42 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse41 (+ v_z_23 .cse11))) (or (< v_z_23 0) (= .cse26 .cse41) (< .cse42 .cse38) (< 4294967295 v_z_23) (< .cse40 .cse42) (= .cse24 .cse41)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse43 (+ v_z_23 .cse11)) (.cse44 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (= .cse26 .cse43) (< 4294967295 .cse43) (< .cse44 .cse38) (< .cse40 .cse44)))))) .cse31 .cse32 .cse33) (or (< .cse45 .cse35) .cse0 (< .cse35 (+ .cse36 1)) .cse2 .cse3) (= c_~x_1~0 .cse46) (or (and (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse47 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse49 (+ v_z_23 .cse11))) (or (< .cse30 .cse47) (< .cse47 .cse48) (< 4294967295 v_z_23) (< .cse49 4294967296) (= .cse24 .cse49)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse50 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23))) (.cse51 (+ v_z_23 .cse11))) (or (< v_z_23 0) (< .cse30 .cse50) (= .cse26 .cse51) (< .cse50 .cse48) (< 4294967295 v_z_23) (= .cse24 .cse51)))) (forall ((v_y_23 Int) (v_z_23 Int)) (let ((.cse53 (+ v_z_23 .cse11)) (.cse52 (+ (* v_y_23 4294967296) (* 2863311531 v_z_23)))) (or (< v_z_23 0) (< .cse30 .cse52) (= .cse26 .cse53) (< 4294967295 .cse53) (< .cse52 .cse48))))) .cse31 .cse33) (or (= .cse26 .cse54) .cse1 .cse31 .cse4 .cse33) (= c_~x_2~0 c_~b~0))))) is different from false Received shutdown request... [2024-11-15 23:31:03,472 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-15 23:31:03,473 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-15 23:31:03,479 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-15 23:31:03,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-15 23:31:03,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-15 23:31:03,840 WARN L596 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-5-3-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-13-4-1 context. [2024-11-15 23:31:03,842 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-15 23:31:03,842 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-15 23:31:03,842 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-15 23:31:03,845 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-15 23:31:03,848 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-15 23:31:03,848 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-15 23:31:03,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-15 23:31:03,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:31:03 BasicIcfg [2024-11-15 23:31:03,865 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-15 23:31:03,866 INFO L158 Benchmark]: Toolchain (without parser) took 869363.56ms. Allocated memory was 100.7MB in the beginning and 188.7MB in the end (delta: 88.1MB). Free memory was 73.6MB in the beginning and 113.5MB in the end (delta: -39.9MB). Peak memory consumption was 122.9MB. Max. memory is 8.0GB. [2024-11-15 23:31:03,866 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-15 23:31:03,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.32ms. Allocated memory is still 100.7MB. Free memory was 73.3MB in the beginning and 62.2MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-15 23:31:03,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.83ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 61.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-15 23:31:03,867 INFO L158 Benchmark]: Boogie Preprocessor took 21.42ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 60.3MB in the end (delta: 529.3kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-15 23:31:03,867 INFO L158 Benchmark]: RCFGBuilder took 248.56ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 49.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-11-15 23:31:03,867 INFO L158 Benchmark]: TraceAbstraction took 868875.91ms. Allocated memory was 100.7MB in the beginning and 188.7MB in the end (delta: 88.1MB). Free memory was 48.8MB in the beginning and 113.5MB in the end (delta: -64.7MB). Peak memory consumption was 97.7MB. Max. memory is 8.0GB. [2024-11-15 23:31:03,869 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.32ms. Allocated memory is still 100.7MB. Free memory was 73.3MB in the beginning and 62.2MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.83ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 61.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.42ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 60.3MB in the end (delta: 529.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 248.56ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 49.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 868875.91ms. Allocated memory was 100.7MB in the beginning and 188.7MB in the end (delta: 88.1MB). Free memory was 48.8MB in the beginning and 113.5MB in the end (delta: -64.7MB). Peak memory consumption was 97.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1415, independent: 1149, independent conditional: 553, independent unconditional: 596, dependent: 266, dependent conditional: 264, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1151, independent: 1149, independent conditional: 553, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1151, independent: 1149, independent conditional: 553, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1151, independent: 1149, independent conditional: 553, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1151, independent: 1149, independent conditional: 0, independent unconditional: 1149, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1151, independent: 1149, independent conditional: 0, independent unconditional: 1149, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 568, independent: 566, independent conditional: 0, independent unconditional: 566, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 568, independent: 564, independent conditional: 0, independent unconditional: 564, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 1151, independent: 583, independent conditional: 0, independent unconditional: 583, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 568, unknown conditional: 0, unknown unconditional: 568] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 566, Positive conditional cache size: 0, Positive unconditional cache size: 566, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 553, Maximal queried relation: 0, Independence queries for same thread: 264, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 67, Number of trivial persistent sets: 52, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 598, independent: 596, independent conditional: 0, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1415, independent: 1149, independent conditional: 553, independent unconditional: 596, dependent: 266, dependent conditional: 264, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1151, independent: 1149, independent conditional: 553, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1151, independent: 1149, independent conditional: 553, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1151, independent: 1149, independent conditional: 553, independent unconditional: 596, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1151, independent: 1149, independent conditional: 0, independent unconditional: 1149, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1151, independent: 1149, independent conditional: 0, independent unconditional: 1149, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 568, independent: 566, independent conditional: 0, independent unconditional: 566, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 568, independent: 564, independent conditional: 0, independent unconditional: 564, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 1151, independent: 583, independent conditional: 0, independent unconditional: 583, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 568, unknown conditional: 0, unknown unconditional: 568] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 566, Positive conditional cache size: 0, Positive unconditional cache size: 566, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 553, Maximal queried relation: 0, Independence queries for same thread: 264 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-5-3-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-13-4-1 context. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-5-3-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-13-4-1 context. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-5-3-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-13-4-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 94 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 868.7s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 702.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 165.0s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 577 ConstructedInterpolants, 46 QuantifiedInterpolants, 15779 SizeOfPredicates, 38 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/162 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 15, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown