/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 DFS --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/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 12:44:31,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 12:44:32,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 12:44:32,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 12:44:32,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 12:44:32,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 12:44:32,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 12:44:32,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 12:44:32,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 12:44:32,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 12:44:32,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 12:44:32,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 12:44:32,084 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 12:44:32,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 12:44:32,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 12:44:32,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 12:44:32,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 12:44:32,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 12:44:32,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 12:44:32,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 12:44:32,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 12:44:32,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 12:44:32,086 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 12:44:32,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 12:44:32,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 12:44:32,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 12:44:32,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 12:44:32,087 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 12:44:32,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 12:44:32,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 12:44:32,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 12:44:32,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 12:44:32,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 12:44:32,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 12:44:32,089 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 12:44:32,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 12:44:32,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 12:44:32,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 12:44:32,089 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 12:44:32,089 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 -> DFS 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-06 12:44:32,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 12:44:32,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 12:44:32,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 12:44:32,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 12:44:32,366 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 12:44:32,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-06 12:44:33,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 12:44:33,376 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 12:44:33,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-06 12:44:33,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/84f9ddb5d/83e88913470e487d8595da35211a7c19/FLAG4cf9df80c [2024-05-06 12:44:33,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/84f9ddb5d/83e88913470e487d8595da35211a7c19 [2024-05-06 12:44:33,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 12:44:33,403 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 12:44:33,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 12:44:33,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 12:44:33,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 12:44:33,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67824948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33, skipping insertion in model container [2024-05-06 12:44:33,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,427 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 12:44:33,574 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/test-hard1.wvr.c[3373,3386] [2024-05-06 12:44:33,584 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 12:44:33,591 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 12:44:33,608 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/test-hard1.wvr.c[3373,3386] [2024-05-06 12:44:33,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 12:44:33,614 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 12:44:33,615 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 12:44:33,620 INFO L206 MainTranslator]: Completed translation [2024-05-06 12:44:33,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33 WrapperNode [2024-05-06 12:44:33,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 12:44:33,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 12:44:33,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 12:44:33,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 12:44:33,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,665 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-05-06 12:44:33,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 12:44:33,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 12:44:33,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 12:44:33,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 12:44:33,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 12:44:33,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 12:44:33,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 12:44:33,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 12:44:33,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (1/1) ... [2024-05-06 12:44:33,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 12:44:33,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 12:44:33,724 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-06 12:44:33,754 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-06 12:44:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 12:44:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-06 12:44:33,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-06 12:44:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-06 12:44:33,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-06 12:44:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-06 12:44:33,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-06 12:44:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-06 12:44:33,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-06 12:44:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 12:44:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 12:44:33,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 12:44:33,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 12:44:33,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 12:44:33,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 12:44:33,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 12:44:33,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 12:44:33,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 12:44:33,769 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 12:44:33,871 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 12:44:33,873 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 12:44:34,147 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 12:44:34,257 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 12:44:34,257 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-06 12:44:34,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:44:34 BoogieIcfgContainer [2024-05-06 12:44:34,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 12:44:34,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 12:44:34,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 12:44:34,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 12:44:34,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 12:44:33" (1/3) ... [2024-05-06 12:44:34,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b1fe6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:44:34, skipping insertion in model container [2024-05-06 12:44:34,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:44:33" (2/3) ... [2024-05-06 12:44:34,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b1fe6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:44:34, skipping insertion in model container [2024-05-06 12:44:34,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:44:34" (3/3) ... [2024-05-06 12:44:34,268 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-05-06 12:44:34,274 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 12:44:34,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 12:44:34,281 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 12:44:34,281 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 12:44:34,332 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-06 12:44:34,367 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 12:44:34,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 12:44:34,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 12:44:34,370 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-06 12:44:34,379 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-06 12:44:34,399 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 12:44:34,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 12:44:34,414 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 12:44:34,420 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;@de95c84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 12:44:34,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-06 12:44:34,814 INFO L85 PathProgramCache]: Analyzing trace with hash -886431304, now seen corresponding path program 1 times [2024-05-06 12:44:34,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-06 12:44:35,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:35,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-06 12:44:35,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 12:44:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 12:44:35,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1640247067, now seen corresponding path program 1 times [2024-05-06 12:44:35,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:35,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:35,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:44:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash -757807902, now seen corresponding path program 1 times [2024-05-06 12:44:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:35,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash -237198403, now seen corresponding path program 2 times [2024-05-06 12:44:38,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:38,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:38,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:44:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:38,477 INFO L85 PathProgramCache]: Analyzing trace with hash -561840913, now seen corresponding path program 3 times [2024-05-06 12:44:38,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:38,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:38,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:44:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -237198741, now seen corresponding path program 4 times [2024-05-06 12:44:39,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:39,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:44:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1506728230, now seen corresponding path program 5 times [2024-05-06 12:44:39,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:39,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:39,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:44:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1891058506, now seen corresponding path program 6 times [2024-05-06 12:44:40,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:40,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:40,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:44:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1506728072, now seen corresponding path program 7 times [2024-05-06 12:44:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:40,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:44:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:44:40,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1772036896, now seen corresponding path program 1 times [2024-05-06 12:44:40,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:40,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:41,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1466858196, now seen corresponding path program 2 times [2024-05-06 12:44:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:42,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1772036558, now seen corresponding path program 3 times [2024-05-06 12:44:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash -506553769, now seen corresponding path program 4 times [2024-05-06 12:44:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:46,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:46,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:47,382 INFO L85 PathProgramCache]: Analyzing trace with hash 537848877, now seen corresponding path program 5 times [2024-05-06 12:44:47,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:47,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:48,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:49,460 INFO L85 PathProgramCache]: Analyzing trace with hash -506553611, now seen corresponding path program 6 times [2024-05-06 12:44:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:49,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:50,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:50,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:50,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1972067691, now seen corresponding path program 1 times [2024-05-06 12:44:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1449088385, now seen corresponding path program 2 times [2024-05-06 12:44:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:53,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1972067353, now seen corresponding path program 3 times [2024-05-06 12:44:54,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:55,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 537820140, now seen corresponding path program 4 times [2024-05-06 12:44:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:55,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:44:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1506671624, now seen corresponding path program 5 times [2024-05-06 12:44:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:58,217 INFO L85 PathProgramCache]: Analyzing trace with hash 537820298, now seen corresponding path program 6 times [2024-05-06 12:44:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:44:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:44:59,230 INFO L85 PathProgramCache]: Analyzing trace with hash 650305278, now seen corresponding path program 1 times [2024-05-06 12:44:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:44:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:44:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:00,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:01,843 INFO L85 PathProgramCache]: Analyzing trace with hash -533211762, now seen corresponding path program 2 times [2024-05-06 12:45:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:01,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:02,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:02,674 INFO L85 PathProgramCache]: Analyzing trace with hash 650304940, now seen corresponding path program 3 times [2024-05-06 12:45:02,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:02,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:03,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:03,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1506698439, now seen corresponding path program 4 times [2024-05-06 12:45:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:04,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1891059467, now seen corresponding path program 5 times [2024-05-06 12:45:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1506698281, now seen corresponding path program 6 times [2024-05-06 12:45:05,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:05,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 12:45:06,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1246107416, now seen corresponding path program 8 times [2024-05-06 12:45:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:06,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:06,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,015 INFO L85 PathProgramCache]: Analyzing trace with hash 513992292, now seen corresponding path program 9 times [2024-05-06 12:45:07,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1246107754, now seen corresponding path program 10 times [2024-05-06 12:45:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1891035535, now seen corresponding path program 11 times [2024-05-06 12:45:07,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:07,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2017208843, now seen corresponding path program 12 times [2024-05-06 12:45:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:07,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1891035693, now seen corresponding path program 13 times [2024-05-06 12:45:07,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:07,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2102655400, now seen corresponding path program 14 times [2024-05-06 12:45:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:07,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:08,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:08,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:08,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1027221779, now seen corresponding path program 15 times [2024-05-06 12:45:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:08,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1906526487, now seen corresponding path program 16 times [2024-05-06 12:45:09,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:09,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1027221441, now seen corresponding path program 17 times [2024-05-06 12:45:10,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:10,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:10,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1490250412, now seen corresponding path program 18 times [2024-05-06 12:45:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:10,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:10,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1891590048, now seen corresponding path program 19 times [2024-05-06 12:45:10,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:10,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:10,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1490250254, now seen corresponding path program 20 times [2024-05-06 12:45:10,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:10,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1161582346, now seen corresponding path program 1 times [2024-05-06 12:45:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:12,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash -176017754, now seen corresponding path program 2 times [2024-05-06 12:45:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:13,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1161582684, now seen corresponding path program 3 times [2024-05-06 12:45:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:16,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:16,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1881745327, now seen corresponding path program 4 times [2024-05-06 12:45:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:17,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:19,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1047677187, now seen corresponding path program 5 times [2024-05-06 12:45:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:20,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1881745169, now seen corresponding path program 6 times [2024-05-06 12:45:21,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:21,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash -115926331, now seen corresponding path program 1 times [2024-05-06 12:45:21,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:22,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:23,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1797375735, now seen corresponding path program 2 times [2024-05-06 12:45:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash -115926669, now seen corresponding path program 3 times [2024-05-06 12:45:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:27,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:27,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:27,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1047679202, now seen corresponding path program 4 times [2024-05-06 12:45:27,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:30,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1490224558, now seen corresponding path program 5 times [2024-05-06 12:45:30,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:31,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1047679360, now seen corresponding path program 6 times [2024-05-06 12:45:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:31,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:31,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1914725460, now seen corresponding path program 1 times [2024-05-06 12:45:31,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:31,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:32,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1877897336, now seen corresponding path program 2 times [2024-05-06 12:45:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:34,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1914725122, now seen corresponding path program 3 times [2024-05-06 12:45:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:37,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:38,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1490220621, now seen corresponding path program 4 times [2024-05-06 12:45:38,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:38,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:41,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1891591009, now seen corresponding path program 5 times [2024-05-06 12:45:41,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 12:45:42,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1490220463, now seen corresponding path program 6 times [2024-05-06 12:45:42,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:42,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:42,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1054357338, now seen corresponding path program 21 times [2024-05-06 12:45:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:42,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:42,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2017190705, now seen corresponding path program 22 times [2024-05-06 12:45:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:42,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 12:45:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 12:45:42,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 12:45:42,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 12:45:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash 851921736, now seen corresponding path program 1 times [2024-05-06 12:45:42,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 12:45:42,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53191913] [2024-05-06 12:45:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:42,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-05-06 12:45:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 12:45:43,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53191913] [2024-05-06 12:45:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53191913] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 12:45:43,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 12:45:43,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 12:45:43,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829063336] [2024-05-06 12:45:43,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 12:45:43,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 12:45:43,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 12:45:43,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 12:45:43,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-06 12:45:43,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:45:43,102 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 12:45:43,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-06 12:45:43,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:45:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 12:45:44,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-05-06 12:45:44,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 12:45:44,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 12:45:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2029386885, now seen corresponding path program 2 times [2024-05-06 12:45:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 12:45:44,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066249041] [2024-05-06 12:45:44,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-05-06 12:45:44,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 12:45:44,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066249041] [2024-05-06 12:45:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066249041] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 12:45:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294259035] [2024-05-06 12:45:44,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 12:45:44,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 12:45:44,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 12:45:44,927 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-06 12:45:44,928 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-06 12:45:45,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-06 12:45:45,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 12:45:45,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-06 12:45:45,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 12:45:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-05-06 12:45:45,154 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 12:45:45,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294259035] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 12:45:45,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 12:45:45,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-05-06 12:45:45,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522970893] [2024-05-06 12:45:45,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 12:45:45,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-06 12:45:45,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 12:45:45,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 12:45:45,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-06 12:45:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:45:45,156 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 12:45:45,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-06 12:45:45,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 12:45:45,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:45:46,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 12:45:46,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:45:46,098 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-06 12:45:46,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2024-05-06 12:45:46,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 12:45:46,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 12:45:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash -10387549, now seen corresponding path program 3 times [2024-05-06 12:45:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 12:45:46,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146185821] [2024-05-06 12:45:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-05-06 12:45:46,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 12:45:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146185821] [2024-05-06 12:45:46,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146185821] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 12:45:46,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495714092] [2024-05-06 12:45:46,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-06 12:45:46,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 12:45:46,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 12:45:46,639 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-06 12:45:46,656 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-06 12:45:46,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-05-06 12:45:46,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 12:45:46,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-06 12:45:46,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 12:45:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-05-06 12:45:46,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 12:45:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 175 proven. 19 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-05-06 12:45:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495714092] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 12:45:47,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 12:45:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 18 [2024-05-06 12:45:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360056932] [2024-05-06 12:45:47,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 12:45:47,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-06 12:45:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 12:45:47,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-06 12:45:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-05-06 12:45:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:45:47,106 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 12:45:47,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.055555555555555) internal successors, (163), 18 states have internal predecessors, (163), 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-06 12:45:47,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 12:45:47,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:45:47,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:45:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 12:45:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:45:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-06 12:45:49,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-06 12:45:49,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 12:45:49,208 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 12:45:49,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 12:45:49,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1653603590, now seen corresponding path program 4 times [2024-05-06 12:45:49,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 12:45:49,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496202905] [2024-05-06 12:45:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:49,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 482 proven. 10 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-05-06 12:45:49,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 12:45:49,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496202905] [2024-05-06 12:45:49,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496202905] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 12:45:49,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463016250] [2024-05-06 12:45:49,639 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-06 12:45:49,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 12:45:49,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 12:45:49,641 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-06 12:45:49,642 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-06 12:45:49,811 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-06 12:45:49,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 12:45:49,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-06 12:45:49,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 12:45:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-05-06 12:45:49,881 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 12:45:49,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463016250] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 12:45:49,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 12:45:49,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-05-06 12:45:49,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616986536] [2024-05-06 12:45:49,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 12:45:49,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-06 12:45:49,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 12:45:49,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 12:45:49,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-06 12:45:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:45:49,883 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 12:45:49,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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-06 12:45:49,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 12:45:49,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:45:49,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-06 12:45:49,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:45:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 12:45:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:45:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-06 12:45:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:45:53,511 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-06 12:45:53,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 12:45:53,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 12:45:53,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 12:45:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1532162062, now seen corresponding path program 5 times [2024-05-06 12:45:53,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 12:45:53,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360887752] [2024-05-06 12:45:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:45:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 891 proven. 4 refuted. 0 times theorem prover too weak. 1359 trivial. 0 not checked. [2024-05-06 12:45:54,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 12:45:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360887752] [2024-05-06 12:45:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360887752] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 12:45:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070467592] [2024-05-06 12:45:54,351 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-06 12:45:54,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 12:45:54,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 12:45:54,352 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 12:45:54,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-06 12:45:54,629 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-05-06 12:45:54,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 12:45:54,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-06 12:45:54,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 12:45:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 900 proven. 127 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2024-05-06 12:45:54,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 12:45:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 891 proven. 4 refuted. 0 times theorem prover too weak. 1359 trivial. 0 not checked. [2024-05-06 12:45:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070467592] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 12:45:54,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 12:45:54,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-05-06 12:45:54,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834727055] [2024-05-06 12:45:54,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 12:45:54,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-06 12:45:54,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 12:45:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-06 12:45:54,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-05-06 12:45:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:45:54,806 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 12:45:54,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.928571428571429) internal successors, (167), 14 states have internal predecessors, (167), 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-06 12:45:54,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 12:45:54,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:45:54,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-06 12:45:54,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:45:54,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:45:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 12:45:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:45:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-06 12:45:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:45:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-06 12:45:55,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-06 12:45:56,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2024-05-06 12:45:56,115 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 12:45:56,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 12:45:56,115 INFO L85 PathProgramCache]: Analyzing trace with hash 427571246, now seen corresponding path program 6 times [2024-05-06 12:45:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 12:45:56,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017534259] [2024-05-06 12:45:56,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 12:45:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 12:45:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 12:46:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 166 proven. 1687 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-05-06 12:46:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 12:46:10,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017534259] [2024-05-06 12:46:10,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017534259] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 12:46:10,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117722508] [2024-05-06 12:46:10,618 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-06 12:46:10,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 12:46:10,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 12:46:10,620 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 12:46:10,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-06 12:46:11,053 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2024-05-06 12:46:11,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 12:46:11,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 146 conjunts are in the unsatisfiable core [2024-05-06 12:46:11,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 12:54:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 228 proven. 1621 refuted. 5 times theorem prover too weak. 16 trivial. 0 not checked. [2024-05-06 12:54:43,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 12:54:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 255 proven. 1611 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 12:54:58,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117722508] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 12:54:58,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 12:54:58,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 102, 116] total 322 [2024-05-06 12:54:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578396239] [2024-05-06 12:54:58,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 12:54:58,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 322 states [2024-05-06 12:54:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 12:54:58,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 322 interpolants. [2024-05-06 12:54:58,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20527, Invalid=82726, Unknown=109, NotChecked=0, Total=103362 [2024-05-06 12:54:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:54:58,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 12:54:58,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 322 states, 322 states have (on average 2.450310559006211) internal successors, (789), 322 states have internal predecessors, (789), 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-06 12:54:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 12:54:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:54:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-06 12:54:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 12:54:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-06 12:54:58,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 12:55:03,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:06,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:15,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:21,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:23,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:25,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:26,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:32,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:34,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:40,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:44,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:47,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:49,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:52,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:55:55,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:00,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:01,966 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 [] [2024-05-06 12:56:09,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:11,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:15,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:17,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:20,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:23,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:26,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 [] [2024-05-06 12:56:29,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:32,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 [] [2024-05-06 12:56:34,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:37,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:39,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:41,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:48,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:56:52,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:06,872 WARN L293 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 202 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 12:57:08,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:15,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:17,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:20,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:22,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:25,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:28,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:31,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:34,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:38,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 [] [2024-05-06 12:57:40,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:47,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:49,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:54,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:56,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:57:58,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 [] [2024-05-06 12:58:03,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:58:09,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 [] [2024-05-06 12:58:14,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:58:20,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:58:28,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:58:35,003 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 [] Received shutdown request... [2024-05-06 12:58:36,682 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-06 12:58:36,682 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-06 12:58:36,682 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-06 12:58:37,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 12:58:37,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-05-06 12:58:37,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2024-05-06 12:58:37,564 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 376 known predicates. [2024-05-06 12:58:37,566 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-06 12:58:37,566 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-06 12:58:37,566 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-06 12:58:37,566 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-06 12:58:37,566 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-06 12:58:37,569 INFO L448 BasicCegarLoop]: Path program histogram: [22, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2024-05-06 12:58:37,571 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 12:58:37,571 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 12:58:37,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 12:58:37 BasicIcfg [2024-05-06 12:58:37,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 12:58:37,573 INFO L158 Benchmark]: Toolchain (without parser) took 844170.27ms. Allocated memory was 323.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 251.3MB in the beginning and 653.7MB in the end (delta: -402.4MB). Peak memory consumption was 857.5MB. Max. memory is 8.0GB. [2024-05-06 12:58:37,573 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 323.0MB. Free memory is still 293.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 12:58:37,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.96ms. Allocated memory is still 323.0MB. Free memory was 251.1MB in the beginning and 239.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-06 12:58:37,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.98ms. Allocated memory is still 323.0MB. Free memory was 239.1MB in the beginning and 237.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 12:58:37,574 INFO L158 Benchmark]: Boogie Preprocessor took 20.04ms. Allocated memory is still 323.0MB. Free memory was 237.2MB in the beginning and 235.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 12:58:37,574 INFO L158 Benchmark]: RCFGBuilder took 571.88ms. Allocated memory is still 323.0MB. Free memory was 235.6MB in the beginning and 284.4MB in the end (delta: -48.8MB). Peak memory consumption was 23.5MB. Max. memory is 8.0GB. [2024-05-06 12:58:37,574 INFO L158 Benchmark]: TraceAbstraction took 843312.12ms. Allocated memory was 323.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 283.3MB in the beginning and 653.7MB in the end (delta: -370.3MB). Peak memory consumption was 889.5MB. Max. memory is 8.0GB. [2024-05-06 12:58:37,575 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.09ms. Allocated memory is still 323.0MB. Free memory is still 293.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.96ms. Allocated memory is still 323.0MB. Free memory was 251.1MB in the beginning and 239.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.98ms. Allocated memory is still 323.0MB. Free memory was 239.1MB in the beginning and 237.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.04ms. Allocated memory is still 323.0MB. Free memory was 237.2MB in the beginning and 235.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 571.88ms. Allocated memory is still 323.0MB. Free memory was 235.6MB in the beginning and 284.4MB in the end (delta: -48.8MB). Peak memory consumption was 23.5MB. Max. memory is 8.0GB. * TraceAbstraction took 843312.12ms. Allocated memory was 323.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 283.3MB in the beginning and 653.7MB in the end (delta: -370.3MB). Peak memory consumption was 889.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 388665, independent: 367615, independent conditional: 339923, independent unconditional: 27692, dependent: 19866, dependent conditional: 19455, dependent unconditional: 411, unknown: 1184, unknown conditional: 1130, unknown unconditional: 54] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 375512, independent: 367615, independent conditional: 339923, independent unconditional: 27692, dependent: 6713, dependent conditional: 6302, dependent unconditional: 411, unknown: 1184, unknown conditional: 1130, unknown unconditional: 54] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 375512, independent: 367615, independent conditional: 339923, independent unconditional: 27692, dependent: 6713, dependent conditional: 6302, dependent unconditional: 411, unknown: 1184, unknown conditional: 1130, unknown unconditional: 54] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 375512, independent: 367615, independent conditional: 339923, independent unconditional: 27692, dependent: 6713, dependent conditional: 6302, dependent unconditional: 411, unknown: 1184, unknown conditional: 1130, unknown unconditional: 54] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 392336, independent: 367615, independent conditional: 143642, independent unconditional: 223973, dependent: 21668, dependent conditional: 14002, dependent unconditional: 7666, unknown: 3053, unknown conditional: 1893, unknown unconditional: 1160] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 392336, independent: 367615, independent conditional: 118309, independent unconditional: 249306, dependent: 21668, dependent conditional: 7633, dependent unconditional: 14035, unknown: 3053, unknown conditional: 1292, unknown unconditional: 1761] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 392336, independent: 367615, independent conditional: 118309, independent unconditional: 249306, dependent: 21668, dependent conditional: 7633, dependent unconditional: 14035, unknown: 3053, unknown conditional: 1292, unknown unconditional: 1761] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1050, independent: 984, independent conditional: 0, independent unconditional: 984, dependent: 60, dependent conditional: 50, dependent unconditional: 10, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1050, independent: 984, independent conditional: 0, independent unconditional: 984, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 50, dependent unconditional: 10, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 50, dependent unconditional: 10, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6448, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 670, dependent conditional: 586, dependent unconditional: 85, unknown: 5778, unknown conditional: 3866, unknown unconditional: 1912] , Protected Queries: 0 ], Cache Queries: [ total: 392336, independent: 366631, independent conditional: 118309, independent unconditional: 248322, dependent: 21608, dependent conditional: 7583, dependent unconditional: 14025, unknown: 4097, unknown conditional: 1342, unknown unconditional: 2755] , Statistics on independence cache: Total cache size (in pairs): 1044, Positive cache size: 984, Positive conditional cache size: 0, Positive unconditional cache size: 984, Negative cache size: 60, Negative conditional cache size: 50, Negative unconditional cache size: 10, Unknown cache size: 6, Unknown conditional cache size: 4, Unknown unconditional cache size: 2, Eliminated conditions: 32303, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 392336, independent: 367615, independent conditional: 143642, independent unconditional: 223973, dependent: 21668, dependent conditional: 14002, dependent unconditional: 7666, unknown: 3053, unknown conditional: 1893, unknown unconditional: 1160] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 392336, independent: 367615, independent conditional: 118309, independent unconditional: 249306, dependent: 21668, dependent conditional: 7633, dependent unconditional: 14035, unknown: 3053, unknown conditional: 1292, unknown unconditional: 1761] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 392336, independent: 367615, independent conditional: 118309, independent unconditional: 249306, dependent: 21668, dependent conditional: 7633, dependent unconditional: 14035, unknown: 3053, unknown conditional: 1292, unknown unconditional: 1761] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1050, independent: 984, independent conditional: 0, independent unconditional: 984, dependent: 60, dependent conditional: 50, dependent unconditional: 10, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1050, independent: 984, independent conditional: 0, independent unconditional: 984, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 50, dependent unconditional: 10, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 50, dependent unconditional: 10, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6448, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 670, dependent conditional: 586, dependent unconditional: 85, unknown: 5778, unknown conditional: 3866, unknown unconditional: 1912] , Protected Queries: 0 ], Cache Queries: [ total: 392336, independent: 366631, independent conditional: 118309, independent unconditional: 248322, dependent: 21608, dependent conditional: 7583, dependent unconditional: 14025, unknown: 4097, unknown conditional: 1342, unknown unconditional: 2755] , Statistics on independence cache: Total cache size (in pairs): 1044, Positive cache size: 984, Positive conditional cache size: 0, Positive unconditional cache size: 984, Negative cache size: 60, Negative conditional cache size: 50, Negative unconditional cache size: 10, Unknown cache size: 6, Unknown conditional cache size: 4, Unknown unconditional cache size: 2, Eliminated conditions: 32303 ], Independence queries for same thread: 13153 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 376 known predicates. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 376 known predicates. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 376 known predicates. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 376 known predicates. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 376 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 843.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 22, EmptinessCheckTime: 296.4s, 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: 150, 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, 1.3s SatisfiabilityAnalysisTime, 543.6s InterpolantComputationTime, 2619 NumberOfCodeBlocks, 2462 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 3421 ConstructedInterpolants, 0 QuantifiedInterpolants, 25508 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1961 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 10520/15620 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: 68.7s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 60, ConditionalCommutativityTraceChecks: 60, ConditionalCommutativityImperfectProofs: 35 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown