/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 00:13:01,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 00:13:01,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 00:13:01,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 00:13:01,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 00:13:01,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 00:13:01,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 00:13:01,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 00:13:01,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 00:13:01,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 00:13:01,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 00:13:01,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 00:13:01,748 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 00:13:01,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 00:13:01,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 00:13:01,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 00:13:01,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 00:13:01,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 00:13:01,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 00:13:01,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 00:13:01,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 00:13:01,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 00:13:01,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 00:13:01,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 00:13:01,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 00:13:01,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 00:13:01,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 00:13:01,753 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 00:13:01,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 00:13:01,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 00:13:01,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 00:13:01,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 00:13:01,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 00:13:01,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 00:13:01,754 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 00:13:01,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 00:13:01,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 00:13:01,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 00:13:01,755 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 00:13:01,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-08 00:13:02,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 00:13:02,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 00:13:02,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 00:13:02,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 00:13:02,071 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 00:13:02,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-05-08 00:13:03,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 00:13:03,483 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 00:13:03,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-05-08 00:13:03,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2cedc26a1/ee100bf38ee346a7bf7e158c7b58922a/FLAG687686459 [2024-05-08 00:13:03,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2cedc26a1/ee100bf38ee346a7bf7e158c7b58922a [2024-05-08 00:13:03,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 00:13:03,507 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 00:13:03,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 00:13:03,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 00:13:03,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 00:13:03,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1241b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03, skipping insertion in model container [2024-05-08 00:13:03,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,547 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 00:13:03,684 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-05-08 00:13:03,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 00:13:03,699 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 00:13:03,718 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-05-08 00:13:03,721 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 00:13:03,734 INFO L206 MainTranslator]: Completed translation [2024-05-08 00:13:03,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03 WrapperNode [2024-05-08 00:13:03,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 00:13:03,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 00:13:03,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 00:13:03,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 00:13:03,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,771 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 147 [2024-05-08 00:13:03,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 00:13:03,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 00:13:03,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 00:13:03,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 00:13:03,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 00:13:03,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 00:13:03,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 00:13:03,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 00:13:03,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (1/1) ... [2024-05-08 00:13:03,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 00:13:03,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:13:03,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-08 00:13:03,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-08 00:13:03,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 00:13:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-08 00:13:03,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-08 00:13:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-08 00:13:03,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-08 00:13:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 00:13:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 00:13:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 00:13:03,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-08 00:13:03,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 00:13:03,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 00:13:03,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-08 00:13:03,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 00:13:03,875 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-08 00:13:03,957 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 00:13:03,959 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 00:13:04,230 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 00:13:04,242 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 00:13:04,242 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-08 00:13:04,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 12:13:04 BoogieIcfgContainer [2024-05-08 00:13:04,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 00:13:04,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 00:13:04,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 00:13:04,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 00:13:04,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 12:13:03" (1/3) ... [2024-05-08 00:13:04,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8186cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 12:13:04, skipping insertion in model container [2024-05-08 00:13:04,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:13:03" (2/3) ... [2024-05-08 00:13:04,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8186cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 12:13:04, skipping insertion in model container [2024-05-08 00:13:04,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 12:13:04" (3/3) ... [2024-05-08 00:13:04,251 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-05-08 00:13:04,258 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 00:13:04,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 00:13:04,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-08 00:13:04,266 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 00:13:04,346 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-08 00:13:04,437 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 00:13:04,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 00:13:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:13:04,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 00:13:04,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-08 00:13:04,470 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 00:13:04,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:13:04,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 00:13:04,490 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7bd4f7af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 00:13:04,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-08 00:13:04,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:13:04,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:13:04,741 INFO L85 PathProgramCache]: Analyzing trace with hash -283829721, now seen corresponding path program 1 times [2024-05-08 00:13:04,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:13:04,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475250693] [2024-05-08 00:13:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:13:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:13:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:13:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 00:13:05,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:13:05,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475250693] [2024-05-08 00:13:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475250693] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 00:13:05,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 00:13:05,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-08 00:13:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258169298] [2024-05-08 00:13:05,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 00:13:05,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-08 00:13:05,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:13:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-08 00:13:05,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-08 00:13:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:05,057 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:13:05,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 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-05-08 00:13:05,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:05,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-08 00:13:05,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:13:05,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:13:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1111227298, now seen corresponding path program 1 times [2024-05-08 00:13:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:13:05,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285919644] [2024-05-08 00:13:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:13:05,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:13:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:13:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:13:05,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:13:05,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285919644] [2024-05-08 00:13:05,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285919644] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 00:13:05,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 00:13:05,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-08 00:13:05,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728032107] [2024-05-08 00:13:05,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 00:13:05,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-08 00:13:05,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:13:05,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-08 00:13:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-08 00:13:05,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:05,685 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:13:05,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-05-08 00:13:05,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:05,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:05,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:05,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-08 00:13:05,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-08 00:13:05,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:13:05,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:13:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1883827620, now seen corresponding path program 1 times [2024-05-08 00:13:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:13:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150415651] [2024-05-08 00:13:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:13:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:13:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:13:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-05-08 00:13:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:13:06,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150415651] [2024-05-08 00:13:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150415651] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 00:13:06,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 00:13:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-08 00:13:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712878417] [2024-05-08 00:13:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 00:13:06,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-08 00:13:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:13:06,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-08 00:13:06,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-05-08 00:13:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:06,332 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:13:06,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 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-05-08 00:13:06,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:06,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-08 00:13:06,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-08 00:13:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 00:13:06,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-08 00:13:06,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:13:06,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:13:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash 945705873, now seen corresponding path program 1 times [2024-05-08 00:13:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:13:06,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538132356] [2024-05-08 00:13:06,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:13:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:13:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:13:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 00:13:08,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:13:08,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538132356] [2024-05-08 00:13:08,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538132356] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:13:08,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250016113] [2024-05-08 00:13:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:13:08,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:13:08,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:13:08,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 00:13:08,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-08 00:13:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:13:08,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 52 conjunts are in the unsatisfiable core [2024-05-08 00:13:08,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:13:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:13:11,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 00:13:12,502 INFO L349 Elim1Store]: treesize reduction 5, result has 91.8 percent of original size [2024-05-08 00:13:12,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 75 [2024-05-08 00:13:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:13:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250016113] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 00:13:13,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 00:13:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29, 25] total 66 [2024-05-08 00:13:13,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484987601] [2024-05-08 00:13:13,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 00:13:13,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-05-08 00:13:13,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:13:13,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-05-08 00:13:13,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3957, Unknown=0, NotChecked=0, Total=4290 [2024-05-08 00:13:13,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:13,874 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:13:13,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 7.181818181818182) internal successors, (474), 66 states have internal predecessors, (474), 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-05-08 00:13:13,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:13,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-08 00:13:13,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 00:13:13,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:13:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-08 00:13:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 00:13:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-08 00:13:23,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-08 00:13:23,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:13:23,617 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:13:23,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:13:23,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1422003260, now seen corresponding path program 2 times [2024-05-08 00:13:23,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:13:23,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779828185] [2024-05-08 00:13:23,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:13:23,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:13:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:13:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 00:13:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:13:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779828185] [2024-05-08 00:13:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779828185] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:13:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988622638] [2024-05-08 00:13:24,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 00:13:24,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:13:24,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:13:24,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 00:13:24,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-08 00:13:24,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 00:13:24,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 00:13:24,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 30 conjunts are in the unsatisfiable core [2024-05-08 00:13:24,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:13:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 00:13:25,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 00:14:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 00:14:06,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988622638] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 00:14:06,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 00:14:06,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2024-05-08 00:14:06,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181438832] [2024-05-08 00:14:06,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 00:14:06,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-05-08 00:14:06,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:14:06,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-05-08 00:14:06,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1337, Unknown=17, NotChecked=0, Total=1482 [2024-05-08 00:14:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:14:06,341 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:14:06,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.102564102564102) internal successors, (394), 39 states have internal predecessors, (394), 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-05-08 00:14:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:14:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-08 00:14:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 00:14:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-08 00:14:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:14:47,441 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-05-08 00:14:49,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:14:51,103 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-05-08 00:14:53,132 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-05-08 00:14:55,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:14:57,145 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-05-08 00:14:59,153 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-05-08 00:15:01,165 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-05-08 00:15:03,220 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-05-08 00:15:05,235 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1))) (let ((.cse1 (* 3 c_~n~0))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))) (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse2))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))))) is different from false [2024-05-08 00:15:51,521 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-05-08 00:15:53,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:15:55,222 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-05-08 00:15:57,242 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-05-08 00:15:59,253 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-05-08 00:16:01,265 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-05-08 00:16:03,269 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-05-08 00:16:05,558 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-05-08 00:16:07,919 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-05-08 00:16:09,925 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-05-08 00:16:11,939 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-05-08 00:16:13,957 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-05-08 00:16:16,265 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-05-08 00:16:18,269 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-05-08 00:16:20,274 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-05-08 00:16:22,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:16:24,285 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-05-08 00:16:26,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:16:28,252 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-05-08 00:16:30,258 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-05-08 00:16:32,267 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-05-08 00:16:34,288 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-05-08 00:16:36,296 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-05-08 00:16:38,309 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-05-08 00:16:40,392 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-05-08 00:16:42,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:16:44,181 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-05-08 00:16:46,513 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-05-08 00:16:48,876 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-05-08 00:16:50,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:16:52,885 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-05-08 00:16:54,991 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-05-08 00:16:57,028 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-05-08 00:16:59,126 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-05-08 00:17:01,667 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-05-08 00:17:03,682 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-05-08 00:17:05,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:17:07,101 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-05-08 00:17:09,108 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-05-08 00:17:11,115 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-05-08 00:17:13,151 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-05-08 00:17:15,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:17:17,313 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-05-08 00:17:19,325 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-05-08 00:17:21,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:17:23,295 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-05-08 00:17:25,542 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-05-08 00:17:27,689 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-05-08 00:17:29,739 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-05-08 00:17:32,182 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-05-08 00:17:34,199 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-05-08 00:17:35,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:17:37,547 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-05-08 00:17:40,498 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-05-08 00:17:44,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:17:46,550 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-05-08 00:17:48,614 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-05-08 00:17:50,624 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-05-08 00:17:52,639 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-05-08 00:17:54,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:17:57,108 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-05-08 00:17:59,186 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-05-08 00:18:01,197 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-05-08 00:18:03,203 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-05-08 00:18:05,211 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-05-08 00:18:07,356 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-05-08 00:18:09,362 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-05-08 00:18:11,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-05-08 00:18:13,383 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-05-08 00:18:15,452 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-05-08 00:18:17,507 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-05-08 00:18:19,571 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-05-08 00:18:21,577 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-05-08 00:18:23,594 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-05-08 00:18:42,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 3 c_~n~0))) (let ((.cse2 (* (div .cse4 4294967296) 4294967296)) (.cse3 (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296)) (.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296))) (and (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1))) (<= (+ .cse2 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse3 .cse4)) (< (+ .cse2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse4 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (forall ((v_z_1 Int)) (or (let ((.cse5 (* 8589934593 v_z_1))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse3 .cse5))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ 2 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (let ((.cse6 (* 8589934593 v_z_1))) (< (+ (* (div .cse6 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse6))) (< 4294967295 v_z_1)))))) is different from false [2024-05-08 00:18:44,767 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296))) (and (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1))) (let ((.cse1 (* 3 c_~n~0))) (<= (+ (* (div .cse1 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse2 .cse1))) (forall ((v_z_1 Int)) (or (let ((.cse3 (* 8589934593 v_z_1))) (< (+ (* (div .cse3 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse2 .cse3))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))))) is different from false [2024-05-08 00:18:47,199 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296)) (.cse5 (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296)) (.cse3 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post8#1| 1) 4294967296) 1)))) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse2))) (< 4294967295 v_z_1) (< v_z_1 .cse3))) (let ((.cse4 (* 3 c_~n~0))) (<= (+ (* (div .cse4 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse5 .cse4))) (forall ((v_z_1 Int)) (or (let ((.cse6 (* 8589934593 v_z_1))) (< (+ (* (div .cse6 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse5 .cse6))) (< 4294967295 v_z_1) (< v_z_1 .cse3))))) is different from false [2024-05-08 00:19:23,236 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-05-08 00:19:25,249 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-05-08 00:19:28,661 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-05-08 00:19:30,673 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-05-08 00:19:32,699 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-05-08 00:19:34,705 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-05-08 00:19:36,711 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-05-08 00:19:38,719 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-05-08 00:19:40,729 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-05-08 00:19:42,737 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-05-08 00:19:44,779 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-05-08 00:19:46,791 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-05-08 00:19:48,821 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-05-08 00:19:50,832 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-05-08 00:19:52,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:19:54,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:19:56,950 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-05-08 00:19:58,964 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296)) (.cse1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ (* (div .cse2 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse3 .cse2))) (forall ((v_z_1 Int)) (or (let ((.cse4 (* 8589934593 v_z_1))) (< (+ (* (div .cse4 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse3 .cse4))) (< 4294967295 v_z_1) (< v_z_1 .cse1))))) is different from false [2024-05-08 00:20:01,300 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-05-08 00:20:03,316 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-05-08 00:20:05,588 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-05-08 00:20:07,598 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-05-08 00:20:09,606 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-05-08 00:20:11,612 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-05-08 00:20:13,962 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-05-08 00:20:15,979 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-05-08 00:20:18,040 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-05-08 00:20:20,201 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-05-08 00:20:31,404 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296))) (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1))) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse2))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ 2 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (let ((.cse3 (* 8589934593 v_z_1))) (< (+ (* (div .cse3 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse3))) (< 4294967295 v_z_1))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|))) is different from false [2024-05-08 00:20:33,513 WARN L854 $PredicateComparison]: unable to prove that (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1))) (forall ((v_z_1 Int)) (or (let ((.cse1 (* 8589934593 v_z_1))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse1))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) is different from false [2024-05-08 00:20:35,678 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296)) (.cse3 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post8#1| 1) 4294967296) 1)))) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse2))) (< 4294967295 v_z_1) (< v_z_1 .cse3))) (forall ((v_z_1 Int)) (or (let ((.cse4 (* 8589934593 v_z_1))) (< (+ (* (div .cse4 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse4))) (< 4294967295 v_z_1) (< v_z_1 .cse3))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|))) is different from false [2024-05-08 00:20:44,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-05-08 00:20:46,458 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-05-08 00:20:48,478 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-05-08 00:20:50,537 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-05-08 00:20:52,560 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-05-08 00:20:55,569 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-05-08 00:20:57,592 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse2))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|))) is different from false [2024-05-08 00:20:59,701 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-05-08 00:21:01,785 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-05-08 00:21:03,792 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-05-08 00:21:06,012 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-05-08 00:21:08,021 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-05-08 00:21:10,058 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-05-08 00:21:12,064 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-05-08 00:21:14,068 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-05-08 00:21:16,074 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-05-08 00:21:18,080 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-05-08 00:21:20,101 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-05-08 00:21:22,107 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-05-08 00:21:24,379 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-05-08 00:21:26,388 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-05-08 00:21:28,502 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-05-08 00:21:31,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:21:33,856 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-05-08 00:21:36,007 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-05-08 00:21:38,267 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-05-08 00:21:41,799 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (= 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 4294967296) .cse2))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (forall ((v_z_1 Int)) (or (let ((.cse3 (* 8589934593 v_z_1))) (< (+ (* (div .cse3 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse3))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|))) is different from false [2024-05-08 00:21:43,806 WARN L854 $PredicateComparison]: unable to prove that (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) (= 3 |c_thread1Thread1of1ForFork0_~i~0#1|)) is different from false [2024-05-08 00:22:20,121 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-05-08 00:22:22,952 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-05-08 00:22:24,965 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-05-08 00:22:27,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:22:29,362 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-05-08 00:22:31,370 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-05-08 00:22:33,406 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-05-08 00:22:34,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:22:36,637 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-05-08 00:22:38,668 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-05-08 00:22:40,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:22:42,230 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-05-08 00:22:44,269 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-05-08 00:22:46,328 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-05-08 00:22:48,347 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-05-08 00:22:50,355 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-05-08 00:22:52,359 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-05-08 00:22:54,364 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-05-08 00:22:57,349 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-05-08 00:23:00,410 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-05-08 00:23:02,416 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-05-08 00:23:04,429 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-05-08 00:23:06,447 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-05-08 00:23:08,456 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-05-08 00:23:10,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-05-08 00:23:12,588 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-05-08 00:23:14,599 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-05-08 00:23:16,698 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-05-08 00:23:18,707 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-05-08 00:23:21,272 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-05-08 00:23:23,279 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-05-08 00:23:25,287 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-05-08 00:23:27,366 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-05-08 00:23:29,396 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-05-08 00:23:31,404 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-05-08 00:23:33,416 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-05-08 00:23:36,153 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-05-08 00:23:38,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:23:40,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:23:42,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:23:44,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:23:46,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:23:48,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:23:51,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:23:53,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 00:23:55,134 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 3 c_~n~0))) (let ((.cse2 (* (div .cse4 4294967296) 4294967296)) (.cse3 (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296)) (.cse1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (<= (+ .cse2 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse3 .cse4)) (< (+ .cse2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse4 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (forall ((v_z_1 Int)) (or (let ((.cse5 (* 8589934593 v_z_1))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse3 .cse5))) (< 4294967295 v_z_1) (< v_z_1 .cse1)))))) is different from false [2024-05-08 00:23:57,412 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 3 c_~n~0))) (let ((.cse3 (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296)) (.cse1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)) (.cse2 (* (div .cse4 4294967296) 4294967296))) (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (<= (+ .cse2 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse3 .cse4)) (forall ((v_z_1 Int)) (or (let ((.cse5 (* 8589934593 v_z_1))) (< (+ (* (div .cse5 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 4294967296) .cse5))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (< (+ .cse2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse4 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (forall ((v_z_1 Int)) (or (let ((.cse6 (* 8589934593 v_z_1))) (< (+ (* (div .cse6 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse3 .cse6))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (<= (+ .cse2 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (+ .cse4 (* (div (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 4294967296)))))) is different from false [2024-05-08 00:23:59,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* 3 c_~n~0))) (let ((.cse1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)) (.cse2 (* (div .cse3 4294967296) 4294967296))) (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (< (+ .cse2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse3 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (forall ((v_z_1 Int)) (or (let ((.cse4 (* 8589934593 v_z_1))) (< (+ (* (div .cse4 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse4))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (<= (+ .cse2 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (+ .cse3 (* (div (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 4294967296)))))) is different from false [2024-05-08 00:24:01,440 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-05-08 00:24:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:24:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-08 00:24:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 00:24:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-08 00:24:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-08 00:24:01,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-08 00:24:02,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:24:02,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 00:24:02,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:24:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2098206545, now seen corresponding path program 3 times [2024-05-08 00:24:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:24:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10839878] [2024-05-08 00:24:02,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:24:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:24:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:24:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 5 proven. 505 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 00:24:03,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:24:03,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10839878] [2024-05-08 00:24:03,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10839878] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:24:03,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796927265] [2024-05-08 00:24:03,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 00:24:03,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:24:03,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:24:03,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 00:24:03,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-08 00:24:04,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-08 00:24:04,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 00:24:04,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 196 conjunts are in the unsatisfiable core [2024-05-08 00:24:04,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:24:05,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-08 00:24:06,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-08 00:24:06,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-08 00:24:19,355 INFO L349 Elim1Store]: treesize reduction 16, result has 80.2 percent of original size [2024-05-08 00:24:19,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 165 treesize of output 109 [2024-05-08 00:24:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 22 proven. 464 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-08 00:24:19,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 00:27:07,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 00:27:07,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 5048 treesize of output 2780 [2024-05-08 00:27:15,981 WARN L293 SmtUtils]: Spent 7.99s on a formula simplification that was a NOOP. DAG size: 807 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-05-08 00:27:15,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 00:27:15,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 38 new quantified variables, introduced 190 case distinctions, treesize of input 6152 treesize of output 6440 Received shutdown request... [2024-05-08 00:27:19,946 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/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-05-08 00:27:19,946 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 00:27:19,952 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/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-05-08 00:27:19,952 WARN L235 SmtUtils]: Removed 164 from assertion stack [2024-05-08 00:27:19,955 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-08 00:27:19,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-08 00:27:20,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:27:20,156 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 362 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 807 for 1971ms.. [2024-05-08 00:27:20,157 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-08 00:27:20,157 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-08 00:27:20,160 INFO L448 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-05-08 00:27:20,162 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-08 00:27:20,163 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 00:27:20,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 12:27:20 BasicIcfg [2024-05-08 00:27:20,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 00:27:20,165 INFO L158 Benchmark]: Toolchain (without parser) took 856658.17ms. Allocated memory was 259.0MB in the beginning and 463.5MB in the end (delta: 204.5MB). Free memory was 186.7MB in the beginning and 322.8MB in the end (delta: -136.1MB). Peak memory consumption was 262.5MB. Max. memory is 8.0GB. [2024-05-08 00:27:20,165 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 259.0MB. Free memory was 224.8MB in the beginning and 224.6MB in the end (delta: 223.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 00:27:20,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.94ms. Allocated memory is still 259.0MB. Free memory was 186.4MB in the beginning and 174.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-08 00:27:20,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.45ms. Allocated memory is still 259.0MB. Free memory was 174.9MB in the beginning and 172.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 00:27:20,166 INFO L158 Benchmark]: Boogie Preprocessor took 27.23ms. Allocated memory is still 259.0MB. Free memory was 172.8MB in the beginning and 171.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-08 00:27:20,166 INFO L158 Benchmark]: RCFGBuilder took 436.52ms. Allocated memory is still 259.0MB. Free memory was 171.3MB in the beginning and 153.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-05-08 00:27:20,166 INFO L158 Benchmark]: TraceAbstraction took 855918.63ms. Allocated memory was 259.0MB in the beginning and 463.5MB in the end (delta: 204.5MB). Free memory was 152.1MB in the beginning and 322.8MB in the end (delta: -170.8MB). Peak memory consumption was 227.9MB. Max. memory is 8.0GB. [2024-05-08 00:27:20,167 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.12ms. Allocated memory is still 259.0MB. Free memory was 224.8MB in the beginning and 224.6MB in the end (delta: 223.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.94ms. Allocated memory is still 259.0MB. Free memory was 186.4MB in the beginning and 174.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.45ms. Allocated memory is still 259.0MB. Free memory was 174.9MB in the beginning and 172.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.23ms. Allocated memory is still 259.0MB. Free memory was 172.8MB in the beginning and 171.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 436.52ms. Allocated memory is still 259.0MB. Free memory was 171.3MB in the beginning and 153.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 855918.63ms. Allocated memory was 259.0MB in the beginning and 463.5MB in the end (delta: 204.5MB). Free memory was 152.1MB in the beginning and 322.8MB in the end (delta: -170.8MB). Peak memory consumption was 227.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11688, independent: 10435, independent conditional: 7951, independent unconditional: 2484, dependent: 1253, dependent conditional: 1253, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10435, independent: 10435, independent conditional: 7951, independent unconditional: 2484, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10435, independent: 10435, independent conditional: 7951, independent unconditional: 2484, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10435, independent: 10435, independent conditional: 7951, independent unconditional: 2484, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10435, independent: 10435, independent conditional: 2325, independent unconditional: 8110, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10435, independent: 10435, independent conditional: 1821, independent unconditional: 8614, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10435, independent: 10435, independent conditional: 1821, independent unconditional: 8614, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1505, independent: 1505, independent conditional: 10, independent unconditional: 1495, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1505, independent: 1505, independent conditional: 0, independent unconditional: 1505, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10435, independent: 8930, independent conditional: 1811, independent unconditional: 7119, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1505, unknown conditional: 10, unknown unconditional: 1495] , Statistics on independence cache: Total cache size (in pairs): 1505, Positive cache size: 1505, Positive conditional cache size: 10, Positive unconditional cache size: 1495, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 504, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10435, independent: 10435, independent conditional: 2325, independent unconditional: 8110, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10435, independent: 10435, independent conditional: 1821, independent unconditional: 8614, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10435, independent: 10435, independent conditional: 1821, independent unconditional: 8614, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1505, independent: 1505, independent conditional: 10, independent unconditional: 1495, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1505, independent: 1505, independent conditional: 0, independent unconditional: 1505, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10435, independent: 8930, independent conditional: 1811, independent unconditional: 7119, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1505, unknown conditional: 10, unknown unconditional: 1495] , Statistics on independence cache: Total cache size (in pairs): 1505, Positive cache size: 1505, Positive conditional cache size: 10, Positive unconditional cache size: 1495, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 504 ], Independence queries for same thread: 1253 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 362 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 807 for 1971ms.. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 362 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 807 for 1971ms.. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 362 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 807 for 1971ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 235 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 855.7s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 605.7s, 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: 186, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 50.4s InterpolantComputationTime, 1160 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1541 ConstructedInterpolants, 105 QuantifiedInterpolants, 17221 SizeOfPredicates, 47 NumberOfNonLiveVariables, 722 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 49/342 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, ConditionalCommutativityCheckTime: 0.5s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown