/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONLY_ONE_CEGAR -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-08 02:19:53,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-08 02:19:53,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-08 02:19:53,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-08 02:19:53,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-08 02:19:53,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-08 02:19:53,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 02:19:53,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 02:19:53,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 02:19:53,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-08 02:19:53,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-08 02:19:53,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 02:19:53,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 02:19:53,682 INFO L153 SettingsManager]: * Use SBE=true [2023-09-08 02:19:53,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 02:19:53,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-08 02:19:53,683 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-08 02:19:53,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 02:19:53,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-08 02:19:53,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 02:19:53,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-08 02:19:53,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-08 02:19:53,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-08 02:19:53,686 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-08 02:19:53,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 02:19:53,686 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-08 02:19:53,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 02:19:53,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 02:19:53,687 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-08 02:19:53,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-08 02:19:53,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 02:19:53,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 02:19:53,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-08 02:19:53,688 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-08 02:19:53,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-08 02:19:53,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 02:19:53,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-08 02:19:53,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 02:19:53,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-08 02:19:53,689 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-08 02:19:53,689 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-08 02:19:53,690 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/UAutomizer-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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONLY_ONE_CEGAR [2023-09-08 02:19:53,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 02:19:53,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 02:19:53,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 02:19:53,926 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 02:19:53,926 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 02:19:53,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2023-09-08 02:19:55,078 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 02:19:55,276 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 02:19:55,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2023-09-08 02:19:55,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d3c2ddd/059945dfc6564339932722a827ff7603/FLAG21b57b384 [2023-09-08 02:19:55,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d3c2ddd/059945dfc6564339932722a827ff7603 [2023-09-08 02:19:55,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 02:19:55,307 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 02:19:55,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 02:19:55,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 02:19:55,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 02:19:55,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b75c895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55, skipping insertion in model container [2023-09-08 02:19:55,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,340 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-08 02:19:55,492 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2644,2657] [2023-09-08 02:19:55,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 02:19:55,506 INFO L202 MainTranslator]: Completed pre-run [2023-09-08 02:19:55,531 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2644,2657] [2023-09-08 02:19:55,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 02:19:55,545 INFO L206 MainTranslator]: Completed translation [2023-09-08 02:19:55,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55 WrapperNode [2023-09-08 02:19:55,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 02:19:55,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 02:19:55,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 02:19:55,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 02:19:55,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,592 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 168 [2023-09-08 02:19:55,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 02:19:55,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 02:19:55,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 02:19:55,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 02:19:55,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 02:19:55,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 02:19:55,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 02:19:55,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 02:19:55,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (1/1) ... [2023-09-08 02:19:55,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 02:19:55,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:19:55,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-08 02:19:55,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-08 02:19:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 02:19:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-08 02:19:55,686 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-08 02:19:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-08 02:19:55,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-08 02:19:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 02:19:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 02:19:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 02:19:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-08 02:19:55,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 02:19:55,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 02:19:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 02:19:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 02:19:55,691 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 02:19:55,766 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 02:19:55,768 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 02:19:55,985 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 02:19:55,993 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 02:19:55,993 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-08 02:19:55,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:19:55 BoogieIcfgContainer [2023-09-08 02:19:55,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 02:19:55,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-08 02:19:55,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-08 02:19:56,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-08 02:19:56,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:19:55" (1/3) ... [2023-09-08 02:19:56,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf6982f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:19:56, skipping insertion in model container [2023-09-08 02:19:56,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:19:55" (2/3) ... [2023-09-08 02:19:56,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf6982f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:19:56, skipping insertion in model container [2023-09-08 02:19:56,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:19:55" (3/3) ... [2023-09-08 02:19:56,002 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2023-09-08 02:19:56,009 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-08 02:19:56,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-08 02:19:56,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-08 02:19:56,018 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-08 02:19:56,133 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 02:19:56,176 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 02:19:56,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-08 02:19:56,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:19:56,177 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-08 02:19:56,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-08 02:19:56,211 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-08 02:19:56,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-08 02:19:56,224 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=LoopsAndPotentialCycles, 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;@571b19cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 02:19:56,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. Found a loop, use abstraction hammer [2023-09-08 02:19:56,976 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 02:19:56,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:19:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash -273867549, now seen corresponding path program 1 times [2023-09-08 02:19:56,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:19:56,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438811581] [2023-09-08 02:19:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:19:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:19:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:19:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:19:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:19:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438811581] [2023-09-08 02:19:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438811581] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:19:57,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:19:57,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-08 02:19:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445254778] [2023-09-08 02:19:57,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:19:57,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-08 02:19:57,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:19:57,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-08 02:19:57,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-08 02:19:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:19:57,262 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:19:57,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 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) [2023-09-08 02:19:57,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-08 02:19:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:19:57,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-08 02:19:57,742 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 02:19:57,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:19:57,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1285799325, now seen corresponding path program 1 times [2023-09-08 02:19:57,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:19:57,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231769753] [2023-09-08 02:19:57,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:19:57,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:19:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:19:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-08 02:19:58,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:19:58,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231769753] [2023-09-08 02:19:58,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231769753] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:19:58,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:19:58,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-08 02:19:58,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66225108] [2023-09-08 02:19:58,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:19:58,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-08 02:19:58,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:19:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-08 02:19:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-08 02:19:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:19:58,139 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:19:58,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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) [2023-09-08 02:19:58,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:19:58,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-08 02:19:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:19:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-08 02:19:58,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-08 02:19:58,525 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 02:19:58,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:19:58,527 INFO L85 PathProgramCache]: Analyzing trace with hash -157423955, now seen corresponding path program 1 times [2023-09-08 02:19:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:19:58,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410812178] [2023-09-08 02:19:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:19:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:19:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:19:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-08 02:19:58,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:19:58,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410812178] [2023-09-08 02:19:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410812178] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:19:58,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140250953] [2023-09-08 02:19:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:19:58,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:19:58,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:19:58,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 02:19:58,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-08 02:19:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:19:58,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-08 02:19:58,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:19:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-08 02:19:59,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:19:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-08 02:19:59,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140250953] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-08 02:19:59,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-08 02:19:59,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2023-09-08 02:19:59,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750033575] [2023-09-08 02:19:59,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:19:59,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 02:19:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:19:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 02:19:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-09-08 02:19:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:19:59,192 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:19:59,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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) [2023-09-08 02:19:59,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:19:59,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-08 02:19:59,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-08 02:19:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:19:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-08 02:19:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:19:59,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-08 02:19:59,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-09-08 02:19:59,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 02:19:59,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:19:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1220763063, now seen corresponding path program 1 times [2023-09-08 02:19:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:19:59,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112305884] [2023-09-08 02:19:59,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:19:59,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:19:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:20:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-08 02:20:00,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:20:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112305884] [2023-09-08 02:20:00,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112305884] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:20:00,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273039294] [2023-09-08 02:20:00,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:20:00,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:20:00,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:20:00,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 02:20:00,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-08 02:20:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:20:00,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 33 conjunts are in the unsatisfiable core [2023-09-08 02:20:00,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:20:01,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-08 02:20:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:20:01,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:20:02,027 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-09-08 02:20:02,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-09-08 02:20:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:20:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273039294] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:20:02,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:20:02,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 36 [2023-09-08 02:20:02,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484418376] [2023-09-08 02:20:02,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:20:02,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-09-08 02:20:02,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:20:02,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-09-08 02:20:02,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2023-09-08 02:20:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:20:02,853 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:20:02,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 12.027777777777779) internal successors, (433), 36 states have internal predecessors, (433), 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) [2023-09-08 02:20:02,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:20:02,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-08 02:20:02,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:20:02,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-08 02:20:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:20:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-08 02:20:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:20:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-08 02:20:05,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-08 02:20:05,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:20:05,884 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 02:20:05,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:20:05,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1781422501, now seen corresponding path program 2 times [2023-09-08 02:20:05,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:20:05,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706259135] [2023-09-08 02:20:05,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:20:05,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:20:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:20:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-09-08 02:20:10,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:20:10,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706259135] [2023-09-08 02:20:10,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706259135] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:20:10,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128860007] [2023-09-08 02:20:10,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 02:20:10,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:20:10,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:20:10,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 02:20:10,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-08 02:20:10,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 02:20:10,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 02:20:10,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 18 conjunts are in the unsatisfiable core [2023-09-08 02:20:10,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:20:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-09-08 02:20:13,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:20:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-09-08 02:20:19,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128860007] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:20:19,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:20:19,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2023-09-08 02:20:19,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227056649] [2023-09-08 02:20:19,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:20:19,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-09-08 02:20:19,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:20:19,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-09-08 02:20:19,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=580, Unknown=3, NotChecked=0, Total=756 [2023-09-08 02:20:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:20:19,814 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:20:19,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.785714285714286) internal successors, (246), 28 states have internal predecessors, (246), 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) [2023-09-08 02:20:19,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:20:19,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-08 02:20:19,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:20:19,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-08 02:20:19,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-08 02:20:23,520 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 [] [2023-09-08 02:20:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:20:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-08 02:20:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:20:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-08 02:20:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-09-08 02:20:26,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-08 02:20:27,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:20:27,120 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 02:20:27,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:20:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash -462758781, now seen corresponding path program 3 times [2023-09-08 02:20:27,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:20:27,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385851120] [2023-09-08 02:20:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:20:27,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:20:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:21:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:21:20,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:21:20,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385851120] [2023-09-08 02:21:20,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385851120] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:21:20,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693995133] [2023-09-08 02:21:20,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-08 02:21:20,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:21:20,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:21:20,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 02:21:20,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-08 02:21:21,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-09-08 02:21:21,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 02:21:21,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 83 conjunts are in the unsatisfiable core [2023-09-08 02:21:21,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:21:22,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-08 02:21:23,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-08 02:21:23,163 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-08 02:21:25,382 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:21:25,382 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 107 [2023-09-08 02:21:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:21:25,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:21:30,882 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:21:30,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 156 [2023-09-08 02:21:31,708 INFO L322 Elim1Store]: treesize reduction 5, result has 98.8 percent of original size [2023-09-08 02:21:31,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 614 treesize of output 937 [2023-09-08 02:21:32,473 INFO L322 Elim1Store]: treesize reduction 28, result has 93.4 percent of original size [2023-09-08 02:21:32,473 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 136 treesize of output 476 [2023-09-08 02:21:35,769 INFO L322 Elim1Store]: treesize reduction 8, result has 98.1 percent of original size [2023-09-08 02:21:35,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 81 treesize of output 502 [2023-09-08 02:22:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-09-08 02:22:34,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693995133] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:22:34,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:22:34,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 40, 31] total 122 [2023-09-08 02:22:34,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849442324] [2023-09-08 02:22:34,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:22:34,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2023-09-08 02:22:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:22:34,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2023-09-08 02:22:34,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=14026, Unknown=60, NotChecked=0, Total=14762 [2023-09-08 02:22:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:22:34,866 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:22:34,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 5.008196721311475) internal successors, (611), 122 states have internal predecessors, (611), 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) [2023-09-08 02:22:34,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:22:34,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-08 02:22:34,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:22:34,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-08 02:22:34,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-09-08 02:22:34,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-08 02:22:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:22:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-08 02:22:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:22:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-08 02:22:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-09-08 02:22:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-09-08 02:22:47,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-08 02:22:47,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:22:47,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 02:22:47,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:22:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1304724257, now seen corresponding path program 4 times [2023-09-08 02:22:47,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:22:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113702669] [2023-09-08 02:22:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:22:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:22:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:22:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-09-08 02:22:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:22:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113702669] [2023-09-08 02:22:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113702669] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:22:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652530949] [2023-09-08 02:22:48,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-08 02:22:48,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:22:48,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:22:48,473 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 02:22:48,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-08 02:22:48,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-08 02:22:48,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 02:22:48,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 68 conjunts are in the unsatisfiable core [2023-09-08 02:22:48,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:22:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:22:49,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:24:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 148 refuted. 39 times theorem prover too weak. 85 trivial. 0 not checked. [2023-09-08 02:24:29,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652530949] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:24:29,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:24:29,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 35, 25] total 58 [2023-09-08 02:24:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238543313] [2023-09-08 02:24:29,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:24:29,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-09-08 02:24:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:24:29,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-09-08 02:24:29,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3079, Unknown=40, NotChecked=0, Total=3306 [2023-09-08 02:24:29,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:24:29,356 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:24:29,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 6.775862068965517) internal successors, (393), 58 states have internal predecessors, (393), 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) [2023-09-08 02:24:29,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:24:29,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-08 02:24:29,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:24:29,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-08 02:24:29,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-09-08 02:24:29,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2023-09-08 02:24:29,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-08 02:24:36,014 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296))) (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (= 5 |c_thread1Thread1of1ForFork0_~i~0#1|) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (<= .cse2 0) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) (+ .cse4 (* .cse2 4294967296)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse5 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse5 4294967296) 4294967296)) .cse5)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse6 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse6 4294967296) 4294967296)) .cse6)))))) is different from false [2023-09-08 02:24:38,030 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse4 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse4 4294967296) 4294967296)) .cse4)))) (let ((.cse5 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse5 4294967296) 4294967296)) .cse5))) is different from false [2023-09-08 02:24:40,046 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2023-09-08 02:24:42,118 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2023-09-08 02:24:44,124 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2023-09-08 02:24:46,133 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse3 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2023-09-08 02:24:48,224 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)))) (let ((.cse3 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2023-09-08 02:24:50,232 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)))) (let ((.cse3 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2023-09-08 02:26:06,843 WARN L234 SmtUtils]: Spent 6.62s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 02:26:08,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:10,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:12,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:14,997 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (let ((.cse2 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse2 4294967296) 4294967296)) .cse2))) is different from false [2023-09-08 02:26:17,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:19,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:21,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:23,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:25,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:27,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:29,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:31,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:33,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:35,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:37,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:39,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:41,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:43,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:45,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:47,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:49,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:51,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:53,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:55,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:26:57,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:00,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:02,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:04,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:06,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:08,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:10,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:12,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:14,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:16,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:18,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:20,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:22,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:27:24,738 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2023-09-08 02:27:26,748 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (let ((.cse2 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse2 4294967296) 4294967296)) .cse2))) is different from false [2023-09-08 02:27:48,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:04,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:06,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:08,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:10,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:12,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:14,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:16,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:18,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:20,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:22,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:24,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:26,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:28,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:30,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:32,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:35,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:37,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:28:39,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:01,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:02,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:18,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:20,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:37,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:39,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:41,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:44,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:46,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:48,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:50,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:52,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:55,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:57,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:29:59,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:30:01,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:30:03,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:30:24,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:30:27,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:30:29,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:30:31,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:30:44,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:00,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:02,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:04,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:06,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:08,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:11,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:13,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:15,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:17,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:19,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:21,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:23,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:25,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:27,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:29,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:31,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:33,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:31:35,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:32:01,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:32:03,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:32:30,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:32:32,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:04,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:06,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:09,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:11,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:13,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:15,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:17,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:19,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:21,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:23,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:25,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:27,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:29,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:31,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:33,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:36,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:37,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:39,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:41,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:43,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:45,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:47,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:49,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:33:52,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-09-08 02:33:52,997 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2023-09-08 02:33:52,997 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 02:33:52,997 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 02:33:54,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-09-08 02:33:54,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-09-08 02:33:54,198 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-09-08 02:33:54,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-09-08 02:33:54,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-08 02:33:54,217 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-09-08 02:33:54,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-09-08 02:33:54,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-09-08 02:33:54,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-09-08 02:33:54,227 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-09-08 02:33:54,229 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-08 02:33:54,229 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-08 02:33:54,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:33:54 BasicIcfg [2023-09-08 02:33:54,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-08 02:33:54,232 INFO L158 Benchmark]: Toolchain (without parser) took 838925.17ms. Allocated memory was 263.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 217.3MB in the beginning and 1.1GB in the end (delta: -922.0MB). Peak memory consumption was 100.3MB. Max. memory is 7.0GB. [2023-09-08 02:33:54,232 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory was 120.8MB in the beginning and 120.7MB in the end (delta: 80.9kB). There was no memory consumed. Max. memory is 7.0GB. [2023-09-08 02:33:54,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.27ms. Allocated memory is still 263.2MB. Free memory was 217.3MB in the beginning and 205.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. [2023-09-08 02:33:54,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.96ms. Allocated memory is still 263.2MB. Free memory was 205.4MB in the beginning and 203.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-08 02:33:54,232 INFO L158 Benchmark]: Boogie Preprocessor took 23.28ms. Allocated memory is still 263.2MB. Free memory was 203.3MB in the beginning and 202.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. [2023-09-08 02:33:54,233 INFO L158 Benchmark]: RCFGBuilder took 378.77ms. Allocated memory is still 263.2MB. Free memory was 201.6MB in the beginning and 183.8MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 7.0GB. [2023-09-08 02:33:54,233 INFO L158 Benchmark]: TraceAbstraction took 838233.95ms. Allocated memory was 263.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 183.2MB in the beginning and 1.1GB in the end (delta: -956.2MB). Peak memory consumption was 66.7MB. Max. memory is 7.0GB. [2023-09-08 02:33:54,234 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory was 120.8MB in the beginning and 120.7MB in the end (delta: 80.9kB). There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 238.27ms. Allocated memory is still 263.2MB. Free memory was 217.3MB in the beginning and 205.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 45.96ms. Allocated memory is still 263.2MB. Free memory was 205.4MB in the beginning and 203.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 23.28ms. Allocated memory is still 263.2MB. Free memory was 203.3MB in the beginning and 202.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. * RCFGBuilder took 378.77ms. Allocated memory is still 263.2MB. Free memory was 201.6MB in the beginning and 183.8MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 7.0GB. * TraceAbstraction took 838233.95ms. Allocated memory was 263.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 183.2MB in the beginning and 1.1GB in the end (delta: -956.2MB). Peak memory consumption was 66.7MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6717, independent: 6126, independent conditional: 6126, independent unconditional: 0, dependent: 591, dependent conditional: 591, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6126, independent: 6126, independent conditional: 6126, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6126, independent: 6126, independent conditional: 6126, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6126, independent: 6126, independent conditional: 0, independent unconditional: 6126, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6126, independent: 6126, independent conditional: 0, independent unconditional: 6126, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6126, independent: 6126, independent conditional: 0, independent unconditional: 6126, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6126, independent: 6126, independent conditional: 0, independent unconditional: 6126, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6126, independent: 6126, independent conditional: 0, independent unconditional: 6126, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6126, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6126, unknown conditional: 0, unknown unconditional: 6126] , Statistics on independence cache: Total cache size (in pairs): 6126, Positive cache size: 6126, Positive conditional cache size: 0, Positive unconditional cache size: 6126, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 591 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 19, RedundantProofs: 5, ProvenStates: 662 - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 265 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 838.0s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 589.1s, 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: 242, 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.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 245.6s InterpolantComputationTime, 2061 NumberOfCodeBlocks, 2061 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2982 ConstructedInterpolants, 142 QuantifiedInterpolants, 61569 SizeOfPredicates, 116 NumberOfNonLiveVariables, 1816 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 277/1417 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