/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 SLEEP_SET --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 22:51:51,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 22:51:51,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 22:51:51,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 22:51:51,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 22:51:51,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 22:51:51,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 22:51:51,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 22:51:51,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 22:51:51,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 22:51:51,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 22:51:51,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 22:51:51,463 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 22:51:51,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 22:51:51,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 22:51:51,465 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 22:51:51,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 22:51:51,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 22:51:51,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 22:51:51,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 22:51:51,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 22:51:51,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 22:51:51,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 22:51:51,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 22:51:51,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 22:51:51,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 22:51:51,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 22:51:51,467 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 22:51:51,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 22:51:51,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 22:51:51,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 22:51:51,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 22:51:51,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 22:51:51,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 22:51:51,469 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 22:51:51,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 22:51:51,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 22:51:51,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 22:51:51,470 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 22:51:51,470 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 -> SLEEP_SET 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 22:51:51,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 22:51:51,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 22:51:51,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 22:51:51,658 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 22:51:51,668 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 22:51:51,668 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 22:51:52,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 22:51:52,908 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 22:51:52,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-06 22:51:52,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/84e58e5e3/6d61885d06e44edfa4177c7a0d7fe4ba/FLAG6bbb2bef7 [2024-05-06 22:51:52,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/84e58e5e3/6d61885d06e44edfa4177c7a0d7fe4ba [2024-05-06 22:51:52,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 22:51:52,926 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 22:51:52,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 22:51:52,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 22:51:52,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 22:51:52,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 10:51:52" (1/1) ... [2024-05-06 22:51:52,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e587e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:52, skipping insertion in model container [2024-05-06 22:51:52,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 10:51:52" (1/1) ... [2024-05-06 22:51:52,951 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 22:51:53,101 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 22:51:53,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 22:51:53,116 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 22:51:53,150 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 22:51:53,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 22:51:53,157 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 22:51:53,157 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 22:51:53,163 INFO L206 MainTranslator]: Completed translation [2024-05-06 22:51:53,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53 WrapperNode [2024-05-06 22:51:53,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 22:51:53,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 22:51:53,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 22:51:53,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 22:51:53,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,205 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-05-06 22:51:53,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 22:51:53,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 22:51:53,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 22:51:53,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 22:51:53,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 22:51:53,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 22:51:53,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 22:51:53,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 22:51:53,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (1/1) ... [2024-05-06 22:51:53,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 22:51:53,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:51:53,248 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 22:51:53,269 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 22:51:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 22:51:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-06 22:51:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-06 22:51:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-06 22:51:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-06 22:51:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-06 22:51:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-06 22:51:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-06 22:51:53,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-06 22:51:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 22:51:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 22:51:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 22:51:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 22:51:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 22:51:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 22:51:53,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 22:51:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 22:51:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 22:51:53,315 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 22:51:53,380 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 22:51:53,382 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 22:51:53,589 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 22:51:53,643 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 22:51:53,643 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-06 22:51:53,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 10:51:53 BoogieIcfgContainer [2024-05-06 22:51:53,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 22:51:53,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 22:51:53,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 22:51:53,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 22:51:53,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 10:51:52" (1/3) ... [2024-05-06 22:51:53,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cd9860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 10:51:53, skipping insertion in model container [2024-05-06 22:51:53,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:51:53" (2/3) ... [2024-05-06 22:51:53,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cd9860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 10:51:53, skipping insertion in model container [2024-05-06 22:51:53,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 10:51:53" (3/3) ... [2024-05-06 22:51:53,651 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-05-06 22:51:53,657 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 22:51:53,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 22:51:53,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 22:51:53,665 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 22:51:53,714 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-06 22:51:53,746 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 22:51:53,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 22:51:53,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:51:53,749 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 22:51:53,754 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 22:51:53,777 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 22:51:53,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:51:53,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 22:51:53,794 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;@72a3c16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 22:51:53,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-06 22:51:54,259 INFO L85 PathProgramCache]: Analyzing trace with hash -886431304, now seen corresponding path program 1 times [2024-05-06 22:51:54,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:51:54,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:51:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:51:54,588 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 22:51:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:51:54,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:51:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:51:54,682 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 22:51:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 22:51:54,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 22:51:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1640247067, now seen corresponding path program 1 times [2024-05-06 22:51:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:51:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:51:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:51:54,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:51:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:51:55,223 INFO L85 PathProgramCache]: Analyzing trace with hash -757807902, now seen corresponding path program 1 times [2024-05-06 22:51:55,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:51:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:51:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:51:56,323 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 22:51:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:51:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:51:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:51:57,795 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 22:51:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash -237198403, now seen corresponding path program 2 times [2024-05-06 22:51:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:51:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:51:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:51:58,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:51:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:51:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash -561840913, now seen corresponding path program 3 times [2024-05-06 22:51:58,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:51:58,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:51:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:51:58,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:51:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:51:59,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1506728230, now seen corresponding path program 4 times [2024-05-06 22:51:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:51:59,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:51:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:51:59,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:51:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:51:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1891058506, now seen corresponding path program 5 times [2024-05-06 22:51:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:51:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:51:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:51:59,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:51:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:00,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1772036896, now seen corresponding path program 1 times [2024-05-06 22:52:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:00,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:01,801 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 22:52:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:01,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:02,990 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 22:52:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1466858196, now seen corresponding path program 2 times [2024-05-06 22:52:03,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:03,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:04,078 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 22:52:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:05,231 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 22:52:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash -506553769, now seen corresponding path program 3 times [2024-05-06 22:52:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:05,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:06,109 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 22:52:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:07,223 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 22:52:07,364 INFO L85 PathProgramCache]: Analyzing trace with hash 537848877, now seen corresponding path program 4 times [2024-05-06 22:52:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:07,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:07,753 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 22:52:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:09,042 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 22:52:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1972067691, now seen corresponding path program 1 times [2024-05-06 22:52:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:10,339 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 22:52:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:11,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 22:52:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1449088385, now seen corresponding path program 2 times [2024-05-06 22:52:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:11,946 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 22:52:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:12,390 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 22:52:12,471 INFO L85 PathProgramCache]: Analyzing trace with hash 537820140, now seen corresponding path program 3 times [2024-05-06 22:52:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:12,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:12,946 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 22:52:12,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:12,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:13,731 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 22:52:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1506671624, now seen corresponding path program 4 times [2024-05-06 22:52:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:14,767 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 22:52:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:16,313 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 22:52:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash 650305278, now seen corresponding path program 1 times [2024-05-06 22:52:16,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:16,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:17,376 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 22:52:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:17,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:17,851 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 22:52:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash -533211762, now seen corresponding path program 2 times [2024-05-06 22:52:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:18,333 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 22:52:18,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:18,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:18,731 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 22:52:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1506698439, now seen corresponding path program 3 times [2024-05-06 22:52:18,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:18,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:19,338 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 22:52:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:19,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:19,827 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 22:52:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1891059467, now seen corresponding path program 4 times [2024-05-06 22:52:19,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:20,309 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 22:52:20,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:20,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:20,770 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 22:52:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1246107416, now seen corresponding path program 6 times [2024-05-06 22:52:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:20,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:20,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash 513992292, now seen corresponding path program 7 times [2024-05-06 22:52:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:21,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:21,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1891035535, now seen corresponding path program 8 times [2024-05-06 22:52:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:21,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2017208843, now seen corresponding path program 9 times [2024-05-06 22:52:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:21,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:21,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2102655400, now seen corresponding path program 10 times [2024-05-06 22:52:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:22,192 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 22:52:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:22,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:22,592 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 22:52:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1496459147, now seen corresponding path program 11 times [2024-05-06 22:52:22,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:22,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:22,797 INFO L85 PathProgramCache]: Analyzing trace with hash 766213304, now seen corresponding path program 12 times [2024-05-06 22:52:22,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:22,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:22,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1027221779, now seen corresponding path program 13 times [2024-05-06 22:52:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:23,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1906526487, now seen corresponding path program 14 times [2024-05-06 22:52:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:23,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:23,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:23,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1490250412, now seen corresponding path program 15 times [2024-05-06 22:52:23,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:23,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:23,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1891590048, now seen corresponding path program 16 times [2024-05-06 22:52:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:24,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:24,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1161582346, now seen corresponding path program 1 times [2024-05-06 22:52:24,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:24,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:26,203 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 22:52:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:26,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:27,366 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 22:52:27,473 INFO L85 PathProgramCache]: Analyzing trace with hash -176017754, now seen corresponding path program 2 times [2024-05-06 22:52:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:27,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:28,749 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 22:52:28,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:28,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:30,351 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 22:52:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1881745327, now seen corresponding path program 3 times [2024-05-06 22:52:30,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:31,092 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 22:52:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:32,040 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 22:52:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1047677187, now seen corresponding path program 4 times [2024-05-06 22:52:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:32,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:33,001 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 22:52:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:34,777 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 22:52:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash -115926331, now seen corresponding path program 1 times [2024-05-06 22:52:34,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:34,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:52:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:36,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:37,172 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 22:52:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1797375735, now seen corresponding path program 2 times [2024-05-06 22:52:37,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:37,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:37,814 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 22:52:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:37,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:38,304 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 22:52:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1047679202, now seen corresponding path program 3 times [2024-05-06 22:52:38,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:38,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:39,842 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 22:52:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:40,431 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 22:52:40,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1490224558, now seen corresponding path program 4 times [2024-05-06 22:52:40,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:40,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:41,544 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 22:52:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:42,417 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 22:52:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1914725460, now seen corresponding path program 1 times [2024-05-06 22:52:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:42,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:43,796 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 22:52:43,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:43,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:44,638 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 22:52:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1877897336, now seen corresponding path program 2 times [2024-05-06 22:52:44,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:44,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:45,588 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 22:52:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:46,716 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 22:52:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1490220621, now seen corresponding path program 3 times [2024-05-06 22:52:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:47,227 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 22:52:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:48,272 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 22:52:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1891591009, now seen corresponding path program 4 times [2024-05-06 22:52:48,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:48,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:49,346 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 22:52:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:49,721 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 22:52:49,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1674660158, now seen corresponding path program 17 times [2024-05-06 22:52:49,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:49,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:49,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1054357338, now seen corresponding path program 18 times [2024-05-06 22:52:49,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:50,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1891597829, now seen corresponding path program 19 times [2024-05-06 22:52:50,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:50,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:50,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2017190705, now seen corresponding path program 20 times [2024-05-06 22:52:50,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:50,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:50,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1271642514, now seen corresponding path program 21 times [2024-05-06 22:52:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:50,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1890967219, now seen corresponding path program 22 times [2024-05-06 22:52:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:50,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:52:51,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:51,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:52:52,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1013758434, now seen corresponding path program 23 times [2024-05-06 22:52:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:52,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:52,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1332134805, now seen corresponding path program 24 times [2024-05-06 22:52:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:53,473 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 22:52:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:53,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:54,255 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 22:52:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash -735708753, now seen corresponding path program 25 times [2024-05-06 22:52:54,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:54,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:52:57,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:57,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:52:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:52:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash 343907001, now seen corresponding path program 26 times [2024-05-06 22:52:58,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:58,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:58,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash 448343848, now seen corresponding path program 27 times [2024-05-06 22:52:58,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:58,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:58,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1209477454, now seen corresponding path program 28 times [2024-05-06 22:52:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:58,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1509557972, now seen corresponding path program 29 times [2024-05-06 22:52:58,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:58,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:58,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash -832390474, now seen corresponding path program 30 times [2024-05-06 22:52:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:58,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:52:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:52:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash -533930189, now seen corresponding path program 1 times [2024-05-06 22:52:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:52:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:52:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:53:00,633 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 22:53:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:53:01,684 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 22:53:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash -207484270, now seen corresponding path program 1 times [2024-05-06 22:53:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:01,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:53:03,051 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 22:53:03,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:03,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:53:04,075 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 22:53:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1101994567, now seen corresponding path program 31 times [2024-05-06 22:53:04,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:53:04,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:53:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:53:04,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1685215135, now seen corresponding path program 32 times [2024-05-06 22:53:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:04,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:53:04,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:53:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:53:04,479 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 22:53:04,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:53:04,481 INFO L85 PathProgramCache]: Analyzing trace with hash 851921736, now seen corresponding path program 1 times [2024-05-06 22:53:04,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:53:04,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225896188] [2024-05-06 22:53:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:04,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:53:04,717 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 22:53:04,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:53:04,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225896188] [2024-05-06 22:53:04,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225896188] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 22:53:04,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 22:53:04,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 22:53:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159570571] [2024-05-06 22:53:04,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 22:53:04,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 22:53:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 22:53:04,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 22:53:04,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-06 22:53:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:53:04,725 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 22:53:04,726 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 22:53:04,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:53:05,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:05,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-05-06 22:53:05,320 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 22:53:05,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:53:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2029386885, now seen corresponding path program 2 times [2024-05-06 22:53:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:53:05,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626238783] [2024-05-06 22:53:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:53:05,679 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 22:53:05,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:53:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626238783] [2024-05-06 22:53:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626238783] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 22:53:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465530190] [2024-05-06 22:53:05,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 22:53:05,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 22:53:05,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:53:05,729 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 22:53:05,732 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 22:53:05,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-06 22:53:05,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 22:53:05,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-06 22:53:05,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 22:53:06,008 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 22:53:06,008 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 22:53:06,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465530190] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 22:53:06,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 22:53:06,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-05-06 22:53:06,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539977502] [2024-05-06 22:53:06,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 22:53:06,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-06 22:53:06,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 22:53:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 22:53:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-06 22:53:06,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:53:06,011 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 22:53:06,011 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 22:53:06,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:06,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:53:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:53:06,688 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 22:53:06,872 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,SelfDestructingSolverStorable93 [2024-05-06 22:53:06,873 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 22:53:06,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:53:06,873 INFO L85 PathProgramCache]: Analyzing trace with hash -10387549, now seen corresponding path program 3 times [2024-05-06 22:53:06,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:53:06,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974625343] [2024-05-06 22:53:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:06,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:53:07,189 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 22:53:07,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:53:07,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974625343] [2024-05-06 22:53:07,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974625343] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 22:53:07,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700735313] [2024-05-06 22:53:07,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-06 22:53:07,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 22:53:07,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:53:07,191 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 22:53:07,243 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 22:53:07,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-05-06 22:53:07,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 22:53:07,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-06 22:53:07,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 22:53:07,512 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 22:53:07,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 22:53:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-05-06 22:53:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700735313] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 22:53:07,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 22:53:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 16 [2024-05-06 22:53:07,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639538861] [2024-05-06 22:53:07,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 22:53:07,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-06 22:53:07,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 22:53:07,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-06 22:53:07,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-05-06 22:53:07,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:53:07,665 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 22:53:07,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 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 22:53:07,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:07,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:53:07,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:53:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:53:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-05-06 22:53:12,609 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 22:53:12,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 22:53:12,808 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 22:53:12,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:53:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1945893496, now seen corresponding path program 4 times [2024-05-06 22:53:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:53:12,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952345899] [2024-05-06 22:53:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:53:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-05-06 22:53:13,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:53:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952345899] [2024-05-06 22:53:13,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952345899] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 22:53:13,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 22:53:13,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 22:53:13,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387839728] [2024-05-06 22:53:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 22:53:13,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 22:53:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 22:53:13,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 22:53:13,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-06 22:53:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:53:13,110 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 22:53:13,111 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 22:53:13,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:13,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:53:13,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-05-06 22:53:13,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:53:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:53:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-05-06 22:53:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:14,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-05-06 22:53:14,192 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 22:53:14,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:53:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1792432792, now seen corresponding path program 5 times [2024-05-06 22:53:14,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:53:14,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382633023] [2024-05-06 22:53:14,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:14,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:53:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1951 backedges. 834 proven. 10 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2024-05-06 22:53:14,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:53:14,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382633023] [2024-05-06 22:53:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382633023] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 22:53:14,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486461756] [2024-05-06 22:53:14,813 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-06 22:53:14,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 22:53:14,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:53:14,815 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 22:53:14,817 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 22:53:15,087 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-05-06 22:53:15,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 22:53:15,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-06 22:53:15,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 22:53:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1951 backedges. 805 proven. 4 refuted. 0 times theorem prover too weak. 1142 trivial. 0 not checked. [2024-05-06 22:53:15,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 22:53:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1951 backedges. 811 proven. 19 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2024-05-06 22:53:15,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486461756] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 22:53:15,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 22:53:15,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2024-05-06 22:53:15,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891272920] [2024-05-06 22:53:15,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 22:53:15,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-06 22:53:15,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 22:53:15,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-06 22:53:15,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-05-06 22:53:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:53:15,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 22:53:15,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 14 states have internal predecessors, (171), 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 22:53:15,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:15,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:53:15,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-05-06 22:53:15,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:15,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:53:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:53:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-05-06 22:53:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 22:53:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-06 22:53:16,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-06 22:53:16,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 22:53:16,916 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 22:53:16,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:53:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash -782557858, now seen corresponding path program 6 times [2024-05-06 22:53:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:53:16,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366491843] [2024-05-06 22:53:16,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:53:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:53:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:53:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2007 backedges. 672 proven. 1232 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-05-06 22:53:29,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:53:29,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366491843] [2024-05-06 22:53:29,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366491843] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 22:53:29,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283846020] [2024-05-06 22:53:29,524 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-06 22:53:29,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 22:53:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:53:29,525 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 22:53:29,534 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 22:53:30,047 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2024-05-06 22:53:30,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 22:53:30,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 144 conjunts are in the unsatisfiable core [2024-05-06 22:53:30,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 22:55:20,341 WARN L293 SmtUtils]: Spent 11.07s on a formula simplification. DAG size of input: 77 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 22:59:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2007 backedges. 206 proven. 1747 refuted. 24 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-06 22:59:50,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 23:00:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2007 backedges. 274 proven. 1733 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 23:00:00,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283846020] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 23:00:00,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 23:00:00,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 86, 114] total 252 [2024-05-06 23:00:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71780226] [2024-05-06 23:00:00,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 23:00:00,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 252 states [2024-05-06 23:00:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 23:00:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 252 interpolants. [2024-05-06 23:00:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14982, Invalid=48185, Unknown=85, NotChecked=0, Total=63252 [2024-05-06 23:00:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:00:00,063 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 23:00:00,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 252 states, 252 states have (on average 2.9801587301587302) internal successors, (751), 252 states have internal predecessors, (751), 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 23:00:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 23:00:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 23:00:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-05-06 23:00:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 23:00:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-06 23:00:00,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 23:00:15,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:00:23,959 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 23:00:28,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:00:30,135 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 23:00:38,696 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 23:00:40,733 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 23:00:42,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:00:43,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:00:51,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:00:55,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:01:04,028 WARN L293 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 127 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 23:01:06,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:01:10,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:01:12,567 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 23:01:14,579 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 23:01:19,120 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 23:01:26,553 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 23:01:28,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:01:30,504 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 23:01:33,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 23:01:41,566 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 23:01:45,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:01:49,350 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 23:01:51,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:01:53,412 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 23:01:59,373 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 23:02:05,551 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 23:02:07,570 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 23:02:17,527 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 23:02:20,134 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 23:02:22,150 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 23:02:24,743 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 23:02:33,490 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 23:02:35,968 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 23:02:43,886 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 203 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 23:03:08,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:03:23,762 WARN L293 SmtUtils]: Spent 8.80s on a formula simplification. DAG size of input: 106 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 23:03:26,961 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 23:03:47,406 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 103 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 23:03:54,198 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 23:04:02,101 WARN L293 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 207 DAG size of output: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 23:04:12,575 WARN L293 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 129 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 23:04:14,612 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 23:04:41,308 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 23:04:44,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:04:59,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:05:09,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:05:30,338 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 23:05:45,791 WARN L293 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 304 DAG size of output: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 23:05:50,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 23:05:53,004 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 23:05:55,031 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 23:05:57,061 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 [] Received shutdown request... [2024-05-06 23:05:58,521 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 23:05:58,521 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 23:05:58,525 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-06 23:05:59,116 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 23:05:59,141 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 23:05:59,335 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,SelfDestructingSolverStorable97 [2024-05-06 23:05:59,335 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 334 known predicates. [2024-05-06 23:05:59,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-06 23:05:59,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-06 23:05:59,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-06 23:05:59,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-06 23:05:59,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-06 23:05:59,340 INFO L448 BasicCegarLoop]: Path program histogram: [32, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-05-06 23:05:59,342 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 23:05:59,342 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 23:05:59,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:05:59 BasicIcfg [2024-05-06 23:05:59,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 23:05:59,344 INFO L158 Benchmark]: Toolchain (without parser) took 846418.10ms. Allocated memory was 339.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 264.1MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 116.7MB. Max. memory is 8.0GB. [2024-05-06 23:05:59,344 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory was 300.0MB in the beginning and 299.9MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 23:05:59,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.05ms. Allocated memory is still 339.7MB. Free memory was 263.6MB in the beginning and 251.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-06 23:05:59,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.71ms. Allocated memory is still 339.7MB. Free memory was 251.1MB in the beginning and 249.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 23:05:59,344 INFO L158 Benchmark]: Boogie Preprocessor took 16.88ms. Allocated memory is still 339.7MB. Free memory was 249.6MB in the beginning and 247.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 23:05:59,344 INFO L158 Benchmark]: RCFGBuilder took 421.68ms. Allocated memory is still 339.7MB. Free memory was 247.9MB in the beginning and 224.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-05-06 23:05:59,345 INFO L158 Benchmark]: TraceAbstraction took 845697.09ms. Allocated memory was 339.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 223.8MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 75.8MB. Max. memory is 8.0GB. [2024-05-06 23:05:59,345 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.11ms. Allocated memory is still 339.7MB. Free memory was 300.0MB in the beginning and 299.9MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.05ms. Allocated memory is still 339.7MB. Free memory was 263.6MB in the beginning and 251.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.71ms. Allocated memory is still 339.7MB. Free memory was 251.1MB in the beginning and 249.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.88ms. Allocated memory is still 339.7MB. Free memory was 249.6MB in the beginning and 247.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 421.68ms. Allocated memory is still 339.7MB. Free memory was 247.9MB in the beginning and 224.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 845697.09ms. Allocated memory was 339.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 223.8MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 75.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 368162, independent: 348339, independent conditional: 320647, independent unconditional: 27692, dependent: 19433, dependent conditional: 18968, dependent unconditional: 465, unknown: 390, unknown conditional: 390, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 355712, independent: 348339, independent conditional: 320647, independent unconditional: 27692, dependent: 6983, dependent conditional: 6518, dependent unconditional: 465, unknown: 390, unknown conditional: 390, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 355712, independent: 348339, independent conditional: 320647, independent unconditional: 27692, dependent: 6983, dependent conditional: 6518, dependent unconditional: 465, unknown: 390, unknown conditional: 390, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 355712, independent: 348339, independent conditional: 320647, independent unconditional: 27692, dependent: 6983, dependent conditional: 6518, dependent unconditional: 465, unknown: 390, unknown conditional: 390, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 371490, independent: 348339, independent conditional: 134765, independent unconditional: 213574, dependent: 22176, dependent conditional: 14380, dependent unconditional: 7796, unknown: 975, unknown conditional: 469, unknown unconditional: 506] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 371490, independent: 348339, independent conditional: 111019, independent unconditional: 237320, dependent: 22176, dependent conditional: 8358, dependent unconditional: 13818, unknown: 975, unknown conditional: 137, unknown unconditional: 838] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 371490, independent: 348339, independent conditional: 111019, independent unconditional: 237320, dependent: 22176, dependent conditional: 8358, dependent unconditional: 13818, unknown: 975, unknown conditional: 137, unknown unconditional: 838] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1059, independent: 980, independent conditional: 0, independent unconditional: 980, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1059, independent: 980, independent conditional: 0, independent unconditional: 980, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5001, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 966, dependent conditional: 418, dependent unconditional: 548, unknown: 4035, unknown conditional: 3030, unknown unconditional: 1005] , Protected Queries: 0 ], Cache Queries: [ total: 371490, independent: 347359, independent conditional: 111019, independent unconditional: 236340, dependent: 22101, dependent conditional: 8294, dependent unconditional: 13807, unknown: 2030, unknown conditional: 201, unknown unconditional: 1829] , Statistics on independence cache: Total cache size (in pairs): 1055, Positive cache size: 980, Positive conditional cache size: 0, Positive unconditional cache size: 980, Negative cache size: 75, Negative conditional cache size: 64, Negative unconditional cache size: 11, Unknown cache size: 4, Unknown conditional cache size: 3, Unknown unconditional cache size: 1, Eliminated conditions: 30100, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 371490, independent: 348339, independent conditional: 134765, independent unconditional: 213574, dependent: 22176, dependent conditional: 14380, dependent unconditional: 7796, unknown: 975, unknown conditional: 469, unknown unconditional: 506] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 371490, independent: 348339, independent conditional: 111019, independent unconditional: 237320, dependent: 22176, dependent conditional: 8358, dependent unconditional: 13818, unknown: 975, unknown conditional: 137, unknown unconditional: 838] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 371490, independent: 348339, independent conditional: 111019, independent unconditional: 237320, dependent: 22176, dependent conditional: 8358, dependent unconditional: 13818, unknown: 975, unknown conditional: 137, unknown unconditional: 838] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1059, independent: 980, independent conditional: 0, independent unconditional: 980, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1059, independent: 980, independent conditional: 0, independent unconditional: 980, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 75, dependent conditional: 64, dependent unconditional: 11, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5001, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 966, dependent conditional: 418, dependent unconditional: 548, unknown: 4035, unknown conditional: 3030, unknown unconditional: 1005] , Protected Queries: 0 ], Cache Queries: [ total: 371490, independent: 347359, independent conditional: 111019, independent unconditional: 236340, dependent: 22101, dependent conditional: 8294, dependent unconditional: 13807, unknown: 2030, unknown conditional: 201, unknown unconditional: 1829] , Statistics on independence cache: Total cache size (in pairs): 1055, Positive cache size: 980, Positive conditional cache size: 0, Positive unconditional cache size: 980, Negative cache size: 75, Negative conditional cache size: 64, Negative unconditional cache size: 11, Unknown cache size: 4, Unknown conditional cache size: 3, Unknown unconditional cache size: 1, Eliminated conditions: 30100 ], Independence queries for same thread: 12450 - 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 334 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 334 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 334 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 334 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 334 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: 845.6s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 32, EmptinessCheckTime: 438.5s, 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: 195, 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.0s SatisfiabilityAnalysisTime, 404.5s InterpolantComputationTime, 2328 NumberOfCodeBlocks, 2171 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 3119 ConstructedInterpolants, 0 QuantifiedInterpolants, 24971 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1491 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 9167/13974 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: 69.7s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 60, ConditionalCommutativityTraceChecks: 60, ConditionalCommutativityImperfectProofs: 31 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown