/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/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-08 00:54:12,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-08 00:54:12,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-08 00:54:12,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-08 00:54:12,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-08 00:54:12,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-08 00:54:12,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 00:54:12,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 00:54:12,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 00:54:12,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-08 00:54:12,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-08 00:54:12,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 00:54:12,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 00:54:12,477 INFO L153 SettingsManager]: * Use SBE=true [2023-09-08 00:54:12,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 00:54:12,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-08 00:54:12,478 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-08 00:54:12,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 00:54:12,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-08 00:54:12,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 00:54:12,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-08 00:54:12,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-08 00:54:12,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-08 00:54:12,480 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-08 00:54:12,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 00:54:12,480 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-08 00:54:12,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 00:54:12,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 00:54:12,481 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-08 00:54:12,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-08 00:54:12,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 00:54:12,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 00:54:12,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-08 00:54:12,483 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-08 00:54:12,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-08 00:54:12,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 00:54:12,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-08 00:54:12,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 00:54:12,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-08 00:54:12,484 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-08 00:54:12,484 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-08 00:54:12,484 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 00:54:12,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 00:54:12,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 00:54:12,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 00:54:12,728 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 00:54:12,728 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 00:54:12,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2023-09-08 00:54:13,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 00:54:14,024 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 00:54:14,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2023-09-08 00:54:14,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9256eb9bd/629a53c8214546528c27055ffa367c6f/FLAG785b67066 [2023-09-08 00:54:14,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9256eb9bd/629a53c8214546528c27055ffa367c6f [2023-09-08 00:54:14,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 00:54:14,051 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 00:54:14,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 00:54:14,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 00:54:14,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 00:54:14,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f062835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14, skipping insertion in model container [2023-09-08 00:54:14,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,081 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-08 00:54:14,218 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/parallel-misc-2.wvr.c[2554,2567] [2023-09-08 00:54:14,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 00:54:14,229 INFO L202 MainTranslator]: Completed pre-run [2023-09-08 00:54:14,251 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/parallel-misc-2.wvr.c[2554,2567] [2023-09-08 00:54:14,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 00:54:14,258 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 00:54:14,258 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 00:54:14,264 INFO L206 MainTranslator]: Completed translation [2023-09-08 00:54:14,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14 WrapperNode [2023-09-08 00:54:14,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 00:54:14,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 00:54:14,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 00:54:14,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 00:54:14,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,288 INFO L138 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2023-09-08 00:54:14,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 00:54:14,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 00:54:14,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 00:54:14,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 00:54:14,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 00:54:14,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 00:54:14,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 00:54:14,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 00:54:14,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (1/1) ... [2023-09-08 00:54:14,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 00:54:14,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 00:54:14,338 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 00:54:14,346 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 00:54:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 00:54:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-08 00:54:14,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-08 00:54:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-08 00:54:14,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-08 00:54:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 00:54:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 00:54:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 00:54:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-08 00:54:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-08 00:54:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 00:54:14,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 00:54:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 00:54:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 00:54:14,372 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 00:54:14,472 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 00:54:14,473 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 00:54:14,626 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 00:54:14,643 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 00:54:14,643 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-08 00:54:14,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:54:14 BoogieIcfgContainer [2023-09-08 00:54:14,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 00:54:14,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-08 00:54:14,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-08 00:54:14,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-08 00:54:14,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:54:14" (1/3) ... [2023-09-08 00:54:14,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca71fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:54:14, skipping insertion in model container [2023-09-08 00:54:14,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:14" (2/3) ... [2023-09-08 00:54:14,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca71fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:54:14, skipping insertion in model container [2023-09-08 00:54:14,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:54:14" (3/3) ... [2023-09-08 00:54:14,652 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2023-09-08 00:54:14,658 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-08 00:54:14,666 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-08 00:54:14,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-08 00:54:14,666 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-08 00:54:14,715 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 00:54:14,749 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 00:54:14,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-08 00:54:14,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 00:54:14,751 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 00:54:14,752 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 00:54:14,790 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-08 00:54:14,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-08 00:54:14,802 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;@1911360b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 00:54:14,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. Found a loop, use abstraction hammer [2023-09-08 00:54:15,061 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 00:54:15,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 00:54:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash 654327370, now seen corresponding path program 1 times [2023-09-08 00:54:15,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 00:54:15,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073427982] [2023-09-08 00:54:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:54:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 00:54:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:54:15,296 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 00:54:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 00:54:15,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073427982] [2023-09-08 00:54:15,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073427982] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 00:54:15,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 00:54:15,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-08 00:54:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971354517] [2023-09-08 00:54:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 00:54:15,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-08 00:54:15,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 00:54:15,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-08 00:54:15,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-08 00:54:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:15,328 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 00:54:15,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 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 00:54:15,329 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 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 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 Found a loop, use abstraction hammer [2023-09-08 00:54:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:15,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-08 00:54:15,420 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 00:54:15,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 00:54:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash -748356765, now seen corresponding path program 1 times [2023-09-08 00:54:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 00:54:15,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522176829] [2023-09-08 00:54:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:54:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 00:54:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:54:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 00:54:16,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 00:54:16,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522176829] [2023-09-08 00:54:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522176829] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 00:54:16,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74996586] [2023-09-08 00:54:16,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:54:16,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 00:54:16,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 00:54:16,203 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 00:54:16,205 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 00:54:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:54:16,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-08 00:54:16,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 00:54:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 00:54:16,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 00:54:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 00:54:16,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74996586] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 00:54:16,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 00:54:16,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2023-09-08 00:54:16,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136542993] [2023-09-08 00:54:16,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 00:54:16,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-08 00:54:16,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 00:54:16,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-08 00:54:16,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-09-08 00:54:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:16,781 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 00:54:16,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.625) internal successors, (138), 16 states have internal predecessors, (138), 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 00:54:16,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:16,782 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 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 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 Found a loop, use abstraction hammer [2023-09-08 00:54:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:54:17,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-08 00:54:17,564 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,SelfDestructingSolverStorable1 [2023-09-08 00:54:17,565 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 00:54:17,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 00:54:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1875230129, now seen corresponding path program 1 times [2023-09-08 00:54:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 00:54:17,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961057987] [2023-09-08 00:54:17,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:54:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 00:54:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:54:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-08 00:54:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 00:54:17,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961057987] [2023-09-08 00:54:17,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961057987] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 00:54:17,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 00:54:17,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 00:54:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250815177] [2023-09-08 00:54:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 00:54:17,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 00:54:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 00:54:17,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 00:54:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 00:54:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:17,813 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 00:54:17,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 00:54:17,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:17,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:54:17,817 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 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 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 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 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 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 00:54:17,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:17,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:54:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:54:17,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-08 00:54:17,920 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 00:54:17,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 00:54:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1400054063, now seen corresponding path program 1 times [2023-09-08 00:54:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 00:54:17,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879092947] [2023-09-08 00:54:17,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:54:17,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 00:54:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:54:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-08 00:54:18,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 00:54:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879092947] [2023-09-08 00:54:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879092947] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 00:54:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509176008] [2023-09-08 00:54:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:54:18,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 00:54:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 00:54:18,877 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 00:54:18,901 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 00:54:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:54:19,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 27 conjunts are in the unsatisfiable core [2023-09-08 00:54:19,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 00:54:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 00:54:19,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 00:54:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 00:54:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509176008] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 00:54:21,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 00:54:21,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 45 [2023-09-08 00:54:21,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622798541] [2023-09-08 00:54:21,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 00:54:21,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-09-08 00:54:21,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 00:54:21,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-09-08 00:54:21,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1756, Unknown=0, NotChecked=0, Total=1980 [2023-09-08 00:54:21,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:21,225 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 00:54:21,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.4) internal successors, (243), 45 states have internal predecessors, (243), 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 00:54:21,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:21,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:54:21,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:54:21,226 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 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 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 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 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 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 00:54:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:54:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:54:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-08 00:54:24,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-09-08 00:54:24,470 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 00:54:24,470 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 00:54:24,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 00:54:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1031580497, now seen corresponding path program 2 times [2023-09-08 00:54:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 00:54:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107760127] [2023-09-08 00:54:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:54:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 00:54:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:54:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-09-08 00:54:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 00:54:24,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107760127] [2023-09-08 00:54:24,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107760127] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 00:54:24,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 00:54:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 00:54:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347720767] [2023-09-08 00:54:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 00:54:24,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 00:54:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 00:54:24,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 00:54:24,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 00:54:24,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:24,766 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 00:54:24,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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 00:54:24,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:24,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:54:24,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:54:24,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-08 00:54:24,766 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 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 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 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 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 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 00:54:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:54:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:54:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-08 00:54:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:54:24,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-08 00:54:24,801 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 00:54:24,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 00:54:24,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1579662301, now seen corresponding path program 1 times [2023-09-08 00:54:24,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 00:54:24,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046869955] [2023-09-08 00:54:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:54:24,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 00:54:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:54:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 219 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-09-08 00:54:25,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 00:54:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046869955] [2023-09-08 00:54:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046869955] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 00:54:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917095738] [2023-09-08 00:54:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:54:25,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 00:54:25,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 00:54:25,944 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 00:54:25,963 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 00:54:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:54:26,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 56 conjunts are in the unsatisfiable core [2023-09-08 00:54:26,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 00:54:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 00:54:33,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 00:54:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 45 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 00:54:46,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917095738] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 00:54:46,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 00:54:46,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 31, 31] total 76 [2023-09-08 00:54:46,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017496641] [2023-09-08 00:54:46,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 00:54:46,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-09-08 00:54:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 00:54:46,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-09-08 00:54:46,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=5020, Unknown=1, NotChecked=0, Total=5700 [2023-09-08 00:54:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:46,033 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 00:54:46,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.5131578947368425) internal successors, (343), 76 states have internal predecessors, (343), 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 00:54:46,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:54:46,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:54:46,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:54:46,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-08 00:54:46,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:54:46,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:55:39,159 WARN L234 SmtUtils]: Spent 39.09s on a formula simplification. DAG size of input: 122 DAG size of output: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 00:55:42,674 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 00:55:44,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] 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 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 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 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 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 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 00:56:47,655 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 00:56:49,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-08 00:56:57,318 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 00:56:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:56:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:56:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:56:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-09-08 00:56:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:56:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-09-08 00:56:58,706 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 00:56:58,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 00:56:58,901 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 00:56:58,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 00:56:58,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2052220700, now seen corresponding path program 2 times [2023-09-08 00:56:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 00:56:58,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317841263] [2023-09-08 00:56:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:56:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 00:56:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:57:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 377 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2023-09-08 00:57:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 00:57:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317841263] [2023-09-08 00:57:00,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317841263] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 00:57:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355782781] [2023-09-08 00:57:00,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 00:57:00,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 00:57:00,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 00:57:00,053 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 00:57:00,061 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 00:57:00,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 00:57:00,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 00:57:00,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 54 conjunts are in the unsatisfiable core [2023-09-08 00:57:00,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 00:57:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 377 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2023-09-08 00:57:00,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 00:57:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 377 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2023-09-08 00:57:01,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355782781] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 00:57:01,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 00:57:01,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-09-08 00:57:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558097320] [2023-09-08 00:57:01,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 00:57:01,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-08 00:57:01,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 00:57:01,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-08 00:57:01,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-09-08 00:57:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:57:01,052 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 00:57:01,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 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 00:57:01,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:57:01,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:57:01,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:57:01,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-09-08 00:57:01,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:57:01,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2023-09-08 00:57:01,053 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 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 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 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 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 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 00:57:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:57:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:57:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:57:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-09-08 00:57:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:57:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-09-08 00:57:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-08 00:57:07,994 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 00:57:08,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 00:57:08,193 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 00:57:08,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 00:57:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1940353234, now seen corresponding path program 3 times [2023-09-08 00:57:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 00:57:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072142004] [2023-09-08 00:57:08,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 00:57:08,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 00:57:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 00:57:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 00:57:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 00:57:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072142004] [2023-09-08 00:57:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072142004] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 00:57:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534424573] [2023-09-08 00:57:13,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-08 00:57:13,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 00:57:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 00:57:13,169 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 00:57:13,173 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 00:57:16,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-09-08 00:57:16,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 00:57:16,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 48 conjunts are in the unsatisfiable core [2023-09-08 00:57:16,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 00:57:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2023-09-08 00:57:22,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 00:57:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2023-09-08 00:57:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534424573] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 00:57:59,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 00:57:59,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 28, 27] total 101 [2023-09-08 00:57:59,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54405410] [2023-09-08 00:57:59,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 00:57:59,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2023-09-08 00:57:59,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 00:57:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2023-09-08 00:57:59,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=9359, Unknown=0, NotChecked=0, Total=10100 [2023-09-08 00:57:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:57:59,330 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 00:57:59,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 4.01980198019802) internal successors, (406), 101 states have internal predecessors, (406), 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 00:57:59,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:57:59,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-09-08 00:57:59,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:57:59,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-09-08 00:57:59,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 00:57:59,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2023-09-08 00:57:59,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-09-08 00:57:59,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 00:58:01,401 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_thread2Thread1of1ForFork1_#t~post4| 3)) (.cse3 (* (mod c_~N~0 2147483648) 2)) (.cse13 (+ |c_thread2Thread1of1ForFork1_#t~post4| 2))) (let ((.cse5 (< .cse3 (+ (mod .cse13 4294967296) 1))) (.cse4 (+ |c_thread2Thread1of1ForFork1_#t~post4| 7)) (.cse0 (< .cse3 (+ (mod (+ 3 c_~i2~0) 4294967296) 1))) (.cse9 (+ |c_thread2Thread1of1ForFork1_#t~post4| 6)) (.cse6 (+ |c_thread2Thread1of1ForFork1_#t~post4| 5)) (.cse7 (+ |c_thread2Thread1of1ForFork1_#t~post4| 4)) (.cse12 (< .cse3 (+ (mod .cse8 4294967296) 1))) (.cse10 (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 1) 4294967296) 1))) (.cse1 (* (div c_~N~0 2147483648) 4294967296)) (.cse2 (* c_~N~0 2)) (.cse14 (+ 2 c_~i2~0)) (.cse11 (< .cse3 (+ 1 (mod (+ c_~i2~0 1) 4294967296))))) (and (or .cse0 (< (+ .cse1 6 c_~i2~0) (+ .cse2 (* (div (+ 6 c_~i2~0) 4294967296) 4294967296))) (< .cse3 (+ (mod (+ 5 c_~i2~0) 4294967296) 1))) (or (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse1 8) (+ (* 4294967296 (div (+ |c_thread2Thread1of1ForFork1_#t~post4| 8) 4294967296)) .cse2)) (< .cse3 (+ (mod .cse4 4294967296) 1)) .cse5) (or (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse1 5) (+ .cse2 (* (div .cse6 4294967296) 4294967296))) (< .cse3 (+ 1 (mod .cse7 4294967296))) .cse5) (or (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse1 3) (+ (* (div .cse8 4294967296) 4294967296) .cse2)) .cse5) (or (< .cse3 (+ (mod .cse9 4294967296) 1)) (< (+ |c_thread2Thread1of1ForFork1_#t~post4| 7 .cse1) (+ (* (div .cse4 4294967296) 4294967296) .cse2)) .cse10) (or .cse0 .cse11 (< (+ .cse1 c_~i2~0 4) (+ .cse2 (* (div (+ c_~i2~0 4) 4294967296) 4294967296)))) (or .cse12 (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse1 6) (+ (* (div .cse9 4294967296) 4294967296) .cse2)) (< .cse3 (+ (mod .cse6 4294967296) 1))) (or (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse1 4) (+ .cse2 (* (div .cse7 4294967296) 4294967296))) .cse12 .cse10) (= (mod c_~i2~0 4294967296) 0) (or (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse1 2) (+ (* 4294967296 (div .cse13 4294967296)) .cse2)) .cse10) (or (< .cse3 (+ (mod .cse14 4294967296) 1)) (< .cse3 (+ (mod (+ 7 c_~i2~0) 4294967296) 1)) (< (+ .cse1 8 c_~i2~0) (+ .cse2 (* (div (+ 8 c_~i2~0) 4294967296) 4294967296)))) (or (< (+ .cse1 2 c_~i2~0) (+ .cse2 (* (div .cse14 4294967296) 4294967296))) .cse11)))) is different from false [2023-09-08 00:58:04,240 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_thread2Thread1of1ForFork1_#t~post4| 3)) (.cse4 (* (mod c_~N~0 2147483648) 2)) (.cse15 (+ |c_thread2Thread1of1ForFork1_#t~post4| 2))) (let ((.cse6 (< .cse4 (+ (mod .cse15 4294967296) 1))) (.cse5 (+ |c_thread2Thread1of1ForFork1_#t~post4| 7)) (.cse0 (= (mod c_~i2~0 4294967296) 0)) (.cse1 (< .cse4 (+ (mod (+ 3 c_~i2~0) 4294967296) 1))) (.cse10 (* 4294967296 (div c_~i1~0 4294967296))) (.cse11 (+ |c_thread2Thread1of1ForFork1_#t~post4| 6)) (.cse7 (+ |c_thread2Thread1of1ForFork1_#t~post4| 5)) (.cse8 (+ |c_thread2Thread1of1ForFork1_#t~post4| 4)) (.cse14 (< .cse4 (+ (mod .cse9 4294967296) 1))) (.cse12 (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 1) 4294967296) 1))) (.cse2 (* (div c_~N~0 2147483648) 4294967296)) (.cse3 (* c_~N~0 2)) (.cse16 (+ 2 c_~i2~0)) (.cse13 (< .cse4 (+ 1 (mod (+ c_~i2~0 1) 4294967296))))) (and (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (or .cse1 (< (+ .cse2 6 c_~i2~0) (+ .cse3 (* (div (+ 6 c_~i2~0) 4294967296) 4294967296))) (< .cse4 (+ (mod (+ 5 c_~i2~0) 4294967296) 1))) (or (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse2 8) (+ (* 4294967296 (div (+ |c_thread2Thread1of1ForFork1_#t~post4| 8) 4294967296)) .cse3)) (< .cse4 (+ (mod .cse5 4294967296) 1)) .cse6) (or (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse2 5) (+ .cse3 (* (div .cse7 4294967296) 4294967296))) (< .cse4 (+ 1 (mod .cse8 4294967296))) .cse6) (or (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse2 3) (+ (* (div .cse9 4294967296) 4294967296) .cse3)) .cse6) (<= (+ c_~i2~0 .cse10) (+ c_~i1~0 (* (div c_~i2~0 4294967296) 4294967296))) (or (< .cse4 (+ (mod .cse11 4294967296) 1)) (< (+ |c_thread2Thread1of1ForFork1_#t~post4| 7 .cse2) (+ (* (div .cse5 4294967296) 4294967296) .cse3)) .cse12) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or .cse1 .cse13 (< (+ .cse2 c_~i2~0 4) (+ .cse3 (* (div (+ c_~i2~0 4) 4294967296) 4294967296)))) (= c_~i1~0 .cse10) (or .cse14 (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse2 6) (+ (* (div .cse11 4294967296) 4294967296) .cse3)) (< .cse4 (+ (mod .cse7 4294967296) 1))) (or (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse2 4) (+ .cse3 (* (div .cse8 4294967296) 4294967296))) .cse14 .cse12) (or (< (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse2 2) (+ (* 4294967296 (div .cse15 4294967296)) .cse3)) .cse12) (or (< .cse4 (+ (mod .cse16 4294967296) 1)) (< .cse4 (+ (mod (+ 7 c_~i2~0) 4294967296) 1)) (< (+ .cse2 8 c_~i2~0) (+ .cse3 (* (div (+ 8 c_~i2~0) 4294967296) 4294967296)))) (or (< (+ .cse2 2 c_~i2~0) (+ .cse3 (* (div .cse16 4294967296) 4294967296))) .cse13)))) is different from false 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 01:01:30,484 WARN L234 SmtUtils]: Spent 2.60m on a formula simplification. DAG size of input: 151 DAG size of output: 126 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) 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 Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-08 01:02:04,027 WARN L234 SmtUtils]: Spent 17.20s on a formula simplification. DAG size of input: 120 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) 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 01:04:52,040 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~i2~0 1)) (.cse4 (* (mod c_~N~0 2147483648) 2))) (let ((.cse1 (< .cse4 (+ (mod (+ 3 c_~i2~0) 4294967296) 1))) (.cse0 (= (mod c_~i2~0 4294967296) 0)) (.cse2 (* (div c_~N~0 2147483648) 4294967296)) (.cse3 (* c_~N~0 2)) (.cse7 (+ 2 c_~i2~0)) (.cse6 (< .cse4 (+ 1 (mod .cse5 4294967296))))) (and (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (or .cse1 (< (+ .cse2 6 c_~i2~0) (+ .cse3 (* (div (+ 6 c_~i2~0) 4294967296) 4294967296))) (< .cse4 (+ (mod (+ 5 c_~i2~0) 4294967296) 1))) (< (+ .cse2 c_~i2~0) (+ .cse3 (* (div c_~i2~0 4294967296) 4294967296))) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (+ .cse2 c_~i2~0 1) (+ (* (div .cse5 4294967296) 4294967296) .cse3)) (or .cse1 .cse6 (< (+ .cse2 c_~i2~0 4) (+ .cse3 (* (div (+ c_~i2~0 4) 4294967296) 4294967296)))) .cse0 (or (< .cse4 (+ (mod .cse7 4294967296) 1)) (< .cse4 (+ (mod (+ 7 c_~i2~0) 4294967296) 1)) (< (+ .cse2 8 c_~i2~0) (+ .cse3 (* (div (+ 8 c_~i2~0) 4294967296) 4294967296)))) (or (< (+ .cse2 2 c_~i2~0) (+ .cse3 (* (div .cse7 4294967296) 4294967296))) .cse6)))) is different from false 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 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 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 Found a loop, use abstraction hammer Found a loop, use abstraction hammer Received shutdown request... [2023-09-08 01:08:37,665 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 01:08:37,665 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 01:08:37,665 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 01:08:37,925 WARN L266 SmtUtils]: Removed 6 from assertion stack [2023-09-08 01:08:37,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-08 01:08:38,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 01:08:38,126 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 90313ms.. [2023-09-08 01:08:38,127 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-09-08 01:08:38,128 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-09-08 01:08:38,128 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-09-08 01:08:38,135 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2023-09-08 01:08:38,137 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-08 01:08:38,137 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-08 01:08:38,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:08:38 BasicIcfg [2023-09-08 01:08:38,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-08 01:08:38,139 INFO L158 Benchmark]: Toolchain (without parser) took 864088.40ms. Allocated memory was 234.9MB in the beginning and 434.1MB in the end (delta: 199.2MB). Free memory was 187.3MB in the beginning and 191.1MB in the end (delta: -3.8MB). Peak memory consumption was 196.5MB. Max. memory is 7.0GB. [2023-09-08 01:08:38,139 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-08 01:08:38,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.72ms. Allocated memory is still 234.9MB. Free memory was 186.9MB in the beginning and 175.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 7.0GB. [2023-09-08 01:08:38,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.20ms. Allocated memory is still 234.9MB. Free memory was 175.8MB in the beginning and 174.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-08 01:08:38,140 INFO L158 Benchmark]: Boogie Preprocessor took 20.64ms. Allocated memory is still 234.9MB. Free memory was 174.3MB in the beginning and 172.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. [2023-09-08 01:08:38,140 INFO L158 Benchmark]: RCFGBuilder took 334.53ms. Allocated memory is still 234.9MB. Free memory was 172.9MB in the beginning and 158.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 7.0GB. [2023-09-08 01:08:38,141 INFO L158 Benchmark]: TraceAbstraction took 863491.95ms. Allocated memory was 234.9MB in the beginning and 434.1MB in the end (delta: 199.2MB). Free memory was 157.6MB in the beginning and 191.1MB in the end (delta: -33.6MB). Peak memory consumption was 166.1MB. Max. memory is 7.0GB. [2023-09-08 01:08:38,142 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 159.4MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 211.72ms. Allocated memory is still 234.9MB. Free memory was 186.9MB in the beginning and 175.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 23.20ms. Allocated memory is still 234.9MB. Free memory was 175.8MB in the beginning and 174.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 20.64ms. Allocated memory is still 234.9MB. Free memory was 174.3MB in the beginning and 172.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. * RCFGBuilder took 334.53ms. Allocated memory is still 234.9MB. Free memory was 172.9MB in the beginning and 158.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 7.0GB. * TraceAbstraction took 863491.95ms. Allocated memory was 234.9MB in the beginning and 434.1MB in the end (delta: 199.2MB). Free memory was 157.6MB in the beginning and 191.1MB in the end (delta: -33.6MB). Peak memory consumption was 166.1MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7536, independent: 6808, independent conditional: 6808, independent unconditional: 0, dependent: 728, dependent conditional: 728, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6808, independent: 6808, independent conditional: 6808, 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: 6808, independent: 6808, independent conditional: 6808, 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: 6808, independent: 6808, independent conditional: 0, independent unconditional: 6808, 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: 6808, independent: 6808, independent conditional: 0, independent unconditional: 6808, 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: 6808, independent: 6808, independent conditional: 0, independent unconditional: 6808, 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: 6808, independent: 6808, independent conditional: 0, independent unconditional: 6808, 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: 6808, independent: 6656, independent conditional: 0, independent unconditional: 6656, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 152, independent: 152, independent conditional: 0, independent unconditional: 152, 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: 152, independent: 152, independent conditional: 0, independent unconditional: 152, 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: 152, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, independent: 176, independent conditional: 0, independent unconditional: 176, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6808, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6808, unknown conditional: 0, unknown unconditional: 6808] , Statistics on independence cache: Total cache size (in pairs): 6808, Positive cache size: 6808, Positive conditional cache size: 0, Positive unconditional cache size: 6808, 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: 728 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 15, RedundantProofs: 5, ProvenStates: 1681 - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 90313ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 90313ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 135 for 90313ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 120 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 863.4s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 782.3s, 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: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 74.6s InterpolantComputationTime, 1893 NumberOfCodeBlocks, 1865 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2661 ConstructedInterpolants, 0 QuantifiedInterpolants, 32871 SizeOfPredicates, 96 NumberOfNonLiveVariables, 1451 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 2359/5603 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