/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 IA --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-04 00:17:29,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-04 00:17:29,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-04 00:17:29,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-04 00:17:29,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-04 00:17:29,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-04 00:17:29,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-04 00:17:29,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-04 00:17:29,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-04 00:17:29,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-04 00:17:29,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-04 00:17:29,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-04 00:17:29,161 INFO L153 SettingsManager]: * Use SBE=true [2024-04-04 00:17:29,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-04 00:17:29,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-04 00:17:29,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-04 00:17:29,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-04 00:17:29,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-04 00:17:29,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-04 00:17:29,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-04 00:17:29,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-04 00:17:29,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-04 00:17:29,164 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-04 00:17:29,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-04 00:17:29,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-04 00:17:29,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-04 00:17:29,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-04 00:17:29,165 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-04 00:17:29,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-04 00:17:29,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 00:17:29,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-04 00:17:29,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-04 00:17:29,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-04 00:17:29,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-04 00:17:29,167 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-04 00:17:29,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-04 00:17:29,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-04 00:17:29,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-04 00:17:29,167 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-04 00:17:29,167 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-04-04 00:17:29,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-04 00:17:29,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-04 00:17:29,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-04 00:17:29,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-04 00:17:29,415 INFO L274 PluginConnector]: CDTParser initialized [2024-04-04 00:17:29,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-04-04 00:17:30,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-04 00:17:30,653 INFO L384 CDTParser]: Found 1 translation units. [2024-04-04 00:17:30,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-04-04 00:17:30,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6575054d6/705dfa69010c4c8fb9aa4e571d2cb06d/FLAG426603601 [2024-04-04 00:17:30,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6575054d6/705dfa69010c4c8fb9aa4e571d2cb06d [2024-04-04 00:17:30,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-04 00:17:30,675 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-04 00:17:30,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-04 00:17:30,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-04 00:17:30,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-04 00:17:30,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58af8b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30, skipping insertion in model container [2024-04-04 00:17:30,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,702 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-04 00:17:30,858 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/popl20-mult-4.wvr.c[2612,2625] [2024-04-04 00:17:30,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 00:17:30,868 INFO L202 MainTranslator]: Completed pre-run [2024-04-04 00:17:30,891 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/popl20-mult-4.wvr.c[2612,2625] [2024-04-04 00:17:30,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 00:17:30,897 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-04 00:17:30,898 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-04 00:17:30,903 INFO L206 MainTranslator]: Completed translation [2024-04-04 00:17:30,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30 WrapperNode [2024-04-04 00:17:30,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-04 00:17:30,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-04 00:17:30,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-04 00:17:30,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-04 00:17:30,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,941 INFO L138 Inliner]: procedures = 23, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2024-04-04 00:17:30,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-04 00:17:30,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-04 00:17:30,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-04 00:17:30,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-04 00:17:30,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-04 00:17:30,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-04 00:17:30,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-04 00:17:30,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-04 00:17:30,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (1/1) ... [2024-04-04 00:17:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 00:17:30,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:17:31,005 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-04-04 00:17:31,031 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-04-04 00:17:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-04 00:17:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-04 00:17:31,063 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-04 00:17:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-04 00:17:31,064 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-04 00:17:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-04 00:17:31,064 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-04 00:17:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-04 00:17:31,064 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-04 00:17:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-04 00:17:31,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-04 00:17:31,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-04 00:17:31,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-04 00:17:31,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-04 00:17:31,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-04 00:17:31,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-04 00:17:31,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-04 00:17:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-04 00:17:31,067 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-04 00:17:31,136 INFO L241 CfgBuilder]: Building ICFG [2024-04-04 00:17:31,138 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-04 00:17:31,339 INFO L282 CfgBuilder]: Performing block encoding [2024-04-04 00:17:31,367 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-04 00:17:31,367 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-04-04 00:17:31,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 12:17:31 BoogieIcfgContainer [2024-04-04 00:17:31,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-04 00:17:31,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-04 00:17:31,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-04 00:17:31,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-04 00:17:31,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 12:17:30" (1/3) ... [2024-04-04 00:17:31,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18934ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 12:17:31, skipping insertion in model container [2024-04-04 00:17:31,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:17:30" (2/3) ... [2024-04-04 00:17:31,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18934ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 12:17:31, skipping insertion in model container [2024-04-04 00:17:31,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 12:17:31" (3/3) ... [2024-04-04 00:17:31,375 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-04-04 00:17:31,381 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-04 00:17:31,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-04 00:17:31,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-04 00:17:31,389 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-04 00:17:31,457 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-04 00:17:31,494 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 00:17:31,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 00:17:31,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:17:31,497 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-04-04 00:17:31,502 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-04-04 00:17:31,525 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 00:17:31,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:17:31,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 00:17:31,547 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;@7a6949b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 00:17:31,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-04 00:17:32,977 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-04-04 00:17:32,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:17:32,982 INFO L85 PathProgramCache]: Analyzing trace with hash 825825901, now seen corresponding path program 1 times [2024-04-04 00:17:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:17:32,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151997350] [2024-04-04 00:17:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-04-04 00:17:33,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:17:33,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151997350] [2024-04-04 00:17:33,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151997350] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 00:17:33,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 00:17:33,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 00:17:33,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691898521] [2024-04-04 00:17:33,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 00:17:33,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 00:17:33,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:17:33,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 00:17:33,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 00:17:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:17:33,935 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:17:33,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 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-04-04 00:17:33,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:17:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:17:34,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-04 00:17:34,692 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-04-04 00:17:34,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:17:34,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1856459753, now seen corresponding path program 1 times [2024-04-04 00:17:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:17:34,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848700346] [2024-04-04 00:17:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:34,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 173 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-04-04 00:17:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:17:35,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848700346] [2024-04-04 00:17:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848700346] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:17:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124912308] [2024-04-04 00:17:35,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:35,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:17:35,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:17:35,859 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-04-04 00:17:35,895 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-04-04 00:17:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:36,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 38 conjunts are in the unsatisfiable core [2024-04-04 00:17:36,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:17:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-04-04 00:17:36,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:17:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 142 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-04-04 00:17:37,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124912308] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:17:37,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:17:37,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 51 [2024-04-04 00:17:37,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581268009] [2024-04-04 00:17:37,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:17:37,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-04-04 00:17:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:17:38,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1155650188, now seen corresponding path program 1 times [2024-04-04 00:17:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:38,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1851303999, now seen corresponding path program 2 times [2024-04-04 00:17:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:38,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:38,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1555849470, now seen corresponding path program 3 times [2024-04-04 00:17:38,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:39,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:39,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1555849470, now seen corresponding path program 4 times [2024-04-04 00:17:39,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:39,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:39,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:39,924 INFO L85 PathProgramCache]: Analyzing trace with hash 986693666, now seen corresponding path program 5 times [2024-04-04 00:17:39,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:39,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:40,061 INFO L85 PathProgramCache]: Analyzing trace with hash -540021526, now seen corresponding path program 1 times [2024-04-04 00:17:40,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:40,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:40,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 439202260, now seen corresponding path program 2 times [2024-04-04 00:17:40,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:40,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:40,862 INFO L85 PathProgramCache]: Analyzing trace with hash 439202260, now seen corresponding path program 3 times [2024-04-04 00:17:40,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:41,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:41,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash 730368557, now seen corresponding path program 4 times [2024-04-04 00:17:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:41,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash 657273161, now seen corresponding path program 5 times [2024-04-04 00:17:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:41,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:41,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1099368118, now seen corresponding path program 6 times [2024-04-04 00:17:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:42,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:42,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:42,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1099368118, now seen corresponding path program 7 times [2024-04-04 00:17:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:42,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:43,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash 279327084, now seen corresponding path program 8 times [2024-04-04 00:17:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-04 00:17:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-04 00:17:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash -258722764, now seen corresponding path program 9 times [2024-04-04 00:17:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 569529268, now seen corresponding path program 10 times [2024-04-04 00:17:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:44,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:45,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:17:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash 475538487, now seen corresponding path program 11 times [2024-04-04 00:17:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:45,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:45,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1856791574, now seen corresponding path program 12 times [2024-04-04 00:17:45,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:45,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1725964313, now seen corresponding path program 13 times [2024-04-04 00:17:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:45,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:45,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1965286520, now seen corresponding path program 14 times [2024-04-04 00:17:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:45,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash 794340347, now seen corresponding path program 15 times [2024-04-04 00:17:45,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:45,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:45,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:46,091 INFO L85 PathProgramCache]: Analyzing trace with hash 794340347, now seen corresponding path program 16 times [2024-04-04 00:17:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:46,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1145252659, now seen corresponding path program 17 times [2024-04-04 00:17:46,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:46,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:46,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1145252659, now seen corresponding path program 18 times [2024-04-04 00:17:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:46,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:46,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1145252659, now seen corresponding path program 19 times [2024-04-04 00:17:46,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:46,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:46,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:17:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:17:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1143093698, now seen corresponding path program 20 times [2024-04-04 00:17:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:46,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:47,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1143093698, now seen corresponding path program 21 times [2024-04-04 00:17:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:47,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:47,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1076165896, now seen corresponding path program 22 times [2024-04-04 00:17:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:48,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash 998595968, now seen corresponding path program 23 times [2024-04-04 00:17:48,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:48,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:48,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash 891704314, now seen corresponding path program 24 times [2024-04-04 00:17:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1873030338, now seen corresponding path program 25 times [2024-04-04 00:17:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1105615244, now seen corresponding path program 26 times [2024-04-04 00:17:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1105615244, now seen corresponding path program 27 times [2024-04-04 00:17:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:50,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:50,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1238854576, now seen corresponding path program 28 times [2024-04-04 00:17:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:50,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:51,106 INFO L85 PathProgramCache]: Analyzing trace with hash -250213426, now seen corresponding path program 29 times [2024-04-04 00:17:51,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:51,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:51,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:51,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash -250213426, now seen corresponding path program 30 times [2024-04-04 00:17:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:52,054 INFO L85 PathProgramCache]: Analyzing trace with hash -250213426, now seen corresponding path program 31 times [2024-04-04 00:17:52,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:52,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash 833318771, now seen corresponding path program 32 times [2024-04-04 00:17:52,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:52,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:52,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash 63078477, now seen corresponding path program 33 times [2024-04-04 00:17:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:53,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1955433141, now seen corresponding path program 34 times [2024-04-04 00:17:53,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash 488885583, now seen corresponding path program 35 times [2024-04-04 00:17:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:53,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:53,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2024415753, now seen corresponding path program 36 times [2024-04-04 00:17:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:17:54,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:17:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:17:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-04 00:17:54,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-04-04 00:17:54,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3583, Unknown=0, NotChecked=0, Total=3782 [2024-04-04 00:17:54,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:17:54,658 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:17:54,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 8.425925925925926) internal successors, (455), 54 states have internal predecessors, (455), 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-04-04 00:17:54,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:17:54,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:18:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:18:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2024-04-04 00:18:41,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-04 00:18:42,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable58,SelfDestructingSolverStorable15,SelfDestructingSolverStorable59,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable20,SelfDestructingSolverStorable64,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable65,SelfDestructingSolverStorable22,SelfDestructingSolverStorable66,SelfDestructingSolverStorable23,SelfDestructingSolverStorable67,SelfDestructingSolverStorable24,SelfDestructingSolverStorable68,SelfDestructingSolverStorable25,SelfDestructingSolverStorable69,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-04 00:18:42,075 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-04-04 00:18:42,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:18:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash -634493578, now seen corresponding path program 2 times [2024-04-04 00:18:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:18:42,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001003919] [2024-04-04 00:18:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:42,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 147 proven. 858 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-04-04 00:18:43,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:18:43,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001003919] [2024-04-04 00:18:43,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001003919] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:18:43,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99230063] [2024-04-04 00:18:43,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-04 00:18:43,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:18:43,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:18:43,113 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-04-04 00:18:43,125 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-04-04 00:18:43,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-04 00:18:43,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 00:18:43,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 62 conjunts are in the unsatisfiable core [2024-04-04 00:18:43,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:18:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 147 proven. 1009 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-04-04 00:18:44,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:18:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 147 proven. 1009 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-04-04 00:18:46,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99230063] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:18:46,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:18:46,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 33, 33] total 73 [2024-04-04 00:18:46,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222350709] [2024-04-04 00:18:46,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:18:46,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-04-04 00:18:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:18:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash -387435888, now seen corresponding path program 37 times [2024-04-04 00:18:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:18:46,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:18:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:18:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash -566630909, now seen corresponding path program 38 times [2024-04-04 00:18:46,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:46,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-04-04 00:18:47,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-04-04 00:18:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash -127125018, now seen corresponding path program 39 times [2024-04-04 00:18:47,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-04-04 00:18:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-04-04 00:18:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash -127125018, now seen corresponding path program 40 times [2024-04-04 00:18:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-04-04 00:18:48,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:48,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-04-04 00:18:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1989336200, now seen corresponding path program 1 times [2024-04-04 00:18:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:49,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2024-04-04 00:18:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2024-04-04 00:18:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash -73955618, now seen corresponding path program 2 times [2024-04-04 00:18:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:49,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-04-04 00:18:50,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-04-04 00:18:50,597 INFO L85 PathProgramCache]: Analyzing trace with hash -465104815, now seen corresponding path program 3 times [2024-04-04 00:18:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-04-04 00:18:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:50,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-04-04 00:18:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1658685762, now seen corresponding path program 4 times [2024-04-04 00:18:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2024-04-04 00:18:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:18:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:18:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:18:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2024-04-04 00:18:52,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-04-04 00:18:52,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=5459, Unknown=0, NotChecked=0, Total=5852 [2024-04-04 00:18:52,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:18:52,148 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:18:52,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 7.191780821917808) internal successors, (525), 73 states have internal predecessors, (525), 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-04-04 00:18:52,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:18:52,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 231 states. [2024-04-04 00:18:52,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:19:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:19:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2024-04-04 00:19:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-04-04 00:19:16,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-04-04 00:19:16,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,SelfDestructingSolverStorable70,SelfDestructingSolverStorable81,SelfDestructingSolverStorable71,SelfDestructingSolverStorable82,SelfDestructingSolverStorable72,SelfDestructingSolverStorable83,SelfDestructingSolverStorable73,SelfDestructingSolverStorable84,SelfDestructingSolverStorable74,SelfDestructingSolverStorable85,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79 [2024-04-04 00:19:16,458 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-04-04 00:19:16,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:19:16,458 INFO L85 PathProgramCache]: Analyzing trace with hash 593870283, now seen corresponding path program 3 times [2024-04-04 00:19:16,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:19:16,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091361118] [2024-04-04 00:19:16,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:19:16,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:19:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:19:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 183 proven. 1365 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2024-04-04 00:19:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:19:17,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091361118] [2024-04-04 00:19:17,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091361118] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:19:17,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624444487] [2024-04-04 00:19:17,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-04 00:19:17,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:19:17,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:19:17,639 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-04-04 00:19:17,640 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-04-04 00:21:08,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-04-04 00:21:08,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 00:21:08,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 89 conjunts are in the unsatisfiable core [2024-04-04 00:21:08,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:21:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 378 proven. 1492 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-04-04 00:21:11,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:21:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 96 proven. 1780 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-04 00:21:20,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624444487] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:21:20,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:21:20,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 47, 49] total 116 [2024-04-04 00:21:20,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912594191] [2024-04-04 00:21:20,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:21:20,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2024-04-04 00:21:20,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:21:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1434048614, now seen corresponding path program 41 times [2024-04-04 00:21:21,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:21,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:21:21,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-04 00:21:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-04 00:21:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1470282624, now seen corresponding path program 42 times [2024-04-04 00:21:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:23,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2024-04-04 00:21:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:23,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2024-04-04 00:21:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1638267831, now seen corresponding path program 43 times [2024-04-04 00:21:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2024-04-04 00:21:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2024-04-04 00:21:25,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1638267831, now seen corresponding path program 44 times [2024-04-04 00:21:25,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2024-04-04 00:21:26,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:26,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2024-04-04 00:21:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash -207467771, now seen corresponding path program 5 times [2024-04-04 00:21:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:26,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-04-04 00:21:27,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:27,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-04-04 00:21:27,908 INFO L85 PathProgramCache]: Analyzing trace with hash 995349723, now seen corresponding path program 6 times [2024-04-04 00:21:27,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:27,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2024-04-04 00:21:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2024-04-04 00:21:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 787282036, now seen corresponding path program 7 times [2024-04-04 00:21:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-04-04 00:21:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-04-04 00:21:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1369910395, now seen corresponding path program 8 times [2024-04-04 00:21:30,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:30,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-04-04 00:21:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:21:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:21:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:21:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 3 proven. 156 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-04-04 00:21:31,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2024-04-04 00:21:31,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=13419, Unknown=0, NotChecked=0, Total=14280 [2024-04-04 00:21:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:21:31,417 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:21:31,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 116 states have (on average 6.672413793103448) internal successors, (774), 116 states have internal predecessors, (774), 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-04-04 00:21:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:21:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 231 states. [2024-04-04 00:21:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-04-04 00:21:31,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:25:05,489 WARN L293 SmtUtils]: Spent 2.78m on a formula simplification that was a NOOP. DAG size: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:25:07,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:25:10,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:25:11,848 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-04-04 00:25:12,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:25:14,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-04-04 00:25:16,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-04-04 00:25:18,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-04-04 00:25:21,532 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-04-04 00:25:22,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:26:31,387 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 182 DAG size of output: 97 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:30:55,872 WARN L293 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 172 DAG size of output: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-04-04 00:31:39,300 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-04-04 00:31:39,300 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-04-04 00:31:39,300 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-04 00:31:39,950 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-04-04 00:31:40,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable86,SelfDestructingSolverStorable97,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87,SelfDestructingSolverStorable98,SelfDestructingSolverStorable88,SelfDestructingSolverStorable99,SelfDestructingSolverStorable89,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101 [2024-04-04 00:31:40,141 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 198 known predicates. [2024-04-04 00:31:40,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-04-04 00:31:40,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-04-04 00:31:40,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-04-04 00:31:40,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-04-04 00:31:40,143 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-04-04 00:31:40,147 INFO L445 BasicCegarLoop]: Path program histogram: [44, 8, 5, 3, 1] [2024-04-04 00:31:40,149 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-04 00:31:40,149 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-04 00:31:40,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.04 12:31:40 BasicIcfg [2024-04-04 00:31:40,151 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-04 00:31:40,151 INFO L158 Benchmark]: Toolchain (without parser) took 849476.14ms. Allocated memory was 257.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 186.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 439.3MB. Max. memory is 8.0GB. [2024-04-04 00:31:40,151 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory was 98.8MB in the beginning and 98.6MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2024-04-04 00:31:40,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.75ms. Allocated memory is still 257.9MB. Free memory was 186.2MB in the beginning and 174.8MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-04 00:31:40,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.07ms. Allocated memory is still 257.9MB. Free memory was 174.6MB in the beginning and 172.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 00:31:40,152 INFO L158 Benchmark]: Boogie Preprocessor took 21.48ms. Allocated memory is still 257.9MB. Free memory was 172.7MB in the beginning and 171.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-04 00:31:40,152 INFO L158 Benchmark]: RCFGBuilder took 405.06ms. Allocated memory is still 257.9MB. Free memory was 171.3MB in the beginning and 152.2MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-04-04 00:31:40,152 INFO L158 Benchmark]: TraceAbstraction took 848780.05ms. Allocated memory was 257.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 150.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 403.6MB. Max. memory is 8.0GB. [2024-04-04 00:31:40,153 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory was 98.8MB in the beginning and 98.6MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.75ms. Allocated memory is still 257.9MB. Free memory was 186.2MB in the beginning and 174.8MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.07ms. Allocated memory is still 257.9MB. Free memory was 174.6MB in the beginning and 172.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.48ms. Allocated memory is still 257.9MB. Free memory was 172.7MB in the beginning and 171.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 405.06ms. Allocated memory is still 257.9MB. Free memory was 171.3MB in the beginning and 152.2MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 848780.05ms. Allocated memory was 257.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 150.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 403.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1460863, independent: 1358325, independent conditional: 1358322, independent unconditional: 3, dependent: 102538, dependent conditional: 102534, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1361530, independent: 1358325, independent conditional: 1358322, independent unconditional: 3, dependent: 3205, dependent conditional: 3205, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1361530, independent: 1358325, independent conditional: 1358322, independent unconditional: 3, dependent: 3205, dependent conditional: 3205, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1361530, independent: 1358325, independent conditional: 1358322, independent unconditional: 3, dependent: 3205, dependent conditional: 3205, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1372503, independent: 1358325, independent conditional: 14093, independent unconditional: 1344232, dependent: 14178, dependent conditional: 5072, dependent unconditional: 9106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1372503, independent: 1358325, independent conditional: 12813, independent unconditional: 1345512, dependent: 14178, dependent conditional: 1217, dependent unconditional: 12961, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1372503, independent: 1358325, independent conditional: 12813, independent unconditional: 1345512, dependent: 14178, dependent conditional: 1217, dependent unconditional: 12961, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1972, independent: 1917, independent conditional: 226, independent unconditional: 1691, dependent: 55, dependent conditional: 47, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1972, independent: 1804, independent conditional: 0, independent unconditional: 1804, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 168, independent: 113, independent conditional: 109, independent unconditional: 4, dependent: 55, dependent conditional: 47, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 168, independent: 113, independent conditional: 109, independent unconditional: 4, dependent: 55, dependent conditional: 47, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 490, independent: 320, independent conditional: 306, independent unconditional: 14, dependent: 170, dependent conditional: 122, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1372503, independent: 1356408, independent conditional: 12587, independent unconditional: 1343821, dependent: 14123, dependent conditional: 1170, dependent unconditional: 12953, unknown: 1972, unknown conditional: 273, unknown unconditional: 1699] , Statistics on independence cache: Total cache size (in pairs): 1972, Positive cache size: 1917, Positive conditional cache size: 226, Positive unconditional cache size: 1691, Negative cache size: 55, Negative conditional cache size: 47, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5135, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1372503, independent: 1358325, independent conditional: 14093, independent unconditional: 1344232, dependent: 14178, dependent conditional: 5072, dependent unconditional: 9106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1372503, independent: 1358325, independent conditional: 12813, independent unconditional: 1345512, dependent: 14178, dependent conditional: 1217, dependent unconditional: 12961, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1372503, independent: 1358325, independent conditional: 12813, independent unconditional: 1345512, dependent: 14178, dependent conditional: 1217, dependent unconditional: 12961, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1972, independent: 1917, independent conditional: 226, independent unconditional: 1691, dependent: 55, dependent conditional: 47, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1972, independent: 1804, independent conditional: 0, independent unconditional: 1804, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 168, independent: 113, independent conditional: 109, independent unconditional: 4, dependent: 55, dependent conditional: 47, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 168, independent: 113, independent conditional: 109, independent unconditional: 4, dependent: 55, dependent conditional: 47, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 490, independent: 320, independent conditional: 306, independent unconditional: 14, dependent: 170, dependent conditional: 122, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1372503, independent: 1356408, independent conditional: 12587, independent unconditional: 1343821, dependent: 14123, dependent conditional: 1170, dependent unconditional: 12953, unknown: 1972, unknown conditional: 273, unknown unconditional: 1699] , Statistics on independence cache: Total cache size (in pairs): 1972, Positive cache size: 1917, Positive conditional cache size: 226, Positive unconditional cache size: 1691, Negative cache size: 55, Negative conditional cache size: 47, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5135 ], Independence queries for same thread: 99333 - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 198 known predicates. - TimeoutResultAtElement [Line: 92]: 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 198 known predicates. - TimeoutResultAtElement [Line: 94]: 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 198 known predicates. - TimeoutResultAtElement [Line: 91]: 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 198 known predicates. - TimeoutResultAtElement [Line: 93]: 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 198 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 848.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 44, EmptinessCheckTime: 682.0s, 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: 411, 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, 111.1s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 1972 NumberOfCodeBlocks, 1941 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2842 ConstructedInterpolants, 0 QuantifiedInterpolants, 25179 SizeOfPredicates, 91 NumberOfNonLiveVariables, 1713 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 2851/10915 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown