/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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 ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 00:48:00,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 00:48:00,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 00:48:00,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 00:48:00,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 00:48:00,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 00:48:00,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 00:48:00,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 00:48:00,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 00:48:00,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 00:48:00,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 00:48:00,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 00:48:00,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 00:48:00,743 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 00:48:00,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 00:48:00,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 00:48:00,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 00:48:00,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 00:48:00,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 00:48:00,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 00:48:00,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 00:48:00,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 00:48:00,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 00:48:00,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 00:48:00,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 00:48:00,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 00:48:00,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 00:48:00,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 00:48:00,756 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 00:48:00,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 00:48:00,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:48:00,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 00:48:00,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 00:48:00,758 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 00:48:00,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 00:48:00,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 00:48:00,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 00:48:00,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 00:48:00,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 00:48:00,759 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 00:48:00,760 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 00:48:00,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-01-26 00:48:01,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 00:48:01,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 00:48:01,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 00:48:01,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 00:48:01,195 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 00:48:01,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2024-01-26 00:48:02,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 00:48:02,545 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 00:48:02,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2024-01-26 00:48:02,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/86d098268/02e1248f35154dd08455edeba328b8db/FLAG4049a80f4 [2024-01-26 00:48:02,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/86d098268/02e1248f35154dd08455edeba328b8db [2024-01-26 00:48:02,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 00:48:02,578 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 00:48:02,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 00:48:02,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 00:48:02,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 00:48:02,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660eef0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02, skipping insertion in model container [2024-01-26 00:48:02,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 00:48:02,813 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5465,5478] [2024-01-26 00:48:02,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:48:02,826 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 00:48:02,861 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5465,5478] [2024-01-26 00:48:02,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:48:02,878 INFO L206 MainTranslator]: Completed translation [2024-01-26 00:48:02,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02 WrapperNode [2024-01-26 00:48:02,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 00:48:02,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 00:48:02,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 00:48:02,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 00:48:02,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,923 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 267 [2024-01-26 00:48:02,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 00:48:02,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 00:48:02,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 00:48:02,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 00:48:02,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 00:48:02,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 00:48:02,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 00:48:02,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 00:48:02,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (1/1) ... [2024-01-26 00:48:02,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:48:02,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:48:03,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-01-26 00:48:03,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-01-26 00:48:03,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 00:48:03,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 00:48:03,041 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 00:48:03,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 00:48:03,041 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 00:48:03,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 00:48:03,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 00:48:03,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 00:48:03,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 00:48:03,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 00:48:03,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 00:48:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 00:48:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 00:48:03,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 00:48:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 00:48:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 00:48:03,045 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 00:48:03,136 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 00:48:03,138 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 00:48:03,477 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 00:48:03,553 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 00:48:03,553 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-26 00:48:03,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:48:03 BoogieIcfgContainer [2024-01-26 00:48:03,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 00:48:03,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 00:48:03,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 00:48:03,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 00:48:03,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 12:48:02" (1/3) ... [2024-01-26 00:48:03,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b285e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:48:03, skipping insertion in model container [2024-01-26 00:48:03,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:02" (2/3) ... [2024-01-26 00:48:03,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b285e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:48:03, skipping insertion in model container [2024-01-26 00:48:03,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:48:03" (3/3) ... [2024-01-26 00:48:03,559 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2024-01-26 00:48:03,565 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 00:48:03,573 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 00:48:03,574 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 00:48:03,574 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 00:48:03,640 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-26 00:48:03,678 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:48:03,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 00:48:03,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:48:03,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-01-26 00:48:03,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-01-26 00:48:03,774 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 00:48:03,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 00:48:03,794 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@6758995b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:48:03,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 00:48:03,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:03,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1279750222, now seen corresponding path program 1 times [2024-01-26 00:48:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:03,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124699222] [2024-01-26 00:48:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:03,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124699222] [2024-01-26 00:48:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124699222] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:04,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:04,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 00:48:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474878121] [2024-01-26 00:48:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:04,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 00:48:04,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:04,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 00:48:04,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 00:48:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:04,208 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:04,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:48:04,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:04,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:04,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 00:48:04,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:04,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1092481967, now seen corresponding path program 1 times [2024-01-26 00:48:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832829380] [2024-01-26 00:48:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:05,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:05,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832829380] [2024-01-26 00:48:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832829380] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:05,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:05,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-01-26 00:48:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138948360] [2024-01-26 00:48:05,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:05,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-26 00:48:05,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:05,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-26 00:48:05,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-01-26 00:48:05,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:05,083 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:05,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:48:05,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:05,084 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 [2024-01-26 00:48:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-26 00:48:05,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 00:48:05,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:05,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash 831244553, now seen corresponding path program 2 times [2024-01-26 00:48:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:05,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85519912] [2024-01-26 00:48:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:05,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:06,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:06,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85519912] [2024-01-26 00:48:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85519912] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:06,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:06,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-01-26 00:48:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210767985] [2024-01-26 00:48:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:06,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-26 00:48:06,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:06,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-26 00:48:06,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-01-26 00:48:06,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:06,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:06,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 12 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:48:06,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:06,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-01-26 00:48:06,477 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 [2024-01-26 00:48:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-26 00:48:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-26 00:48:07,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 00:48:07,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:07,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash 402933197, now seen corresponding path program 3 times [2024-01-26 00:48:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092346644] [2024-01-26 00:48:07,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:07,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:07,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:07,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092346644] [2024-01-26 00:48:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092346644] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 00:48:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502881315] [2024-01-26 00:48:07,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:07,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 00:48:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:07,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 00:48:07,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 00:48:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:07,916 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:07,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:48:07,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:07,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-01-26 00:48:07,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-01-26 00:48:07,916 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 [2024-01-26 00:48:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-26 00:48:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-26 00:48:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:48:08,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-26 00:48:08,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:08,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash -524961933, now seen corresponding path program 4 times [2024-01-26 00:48:08,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:08,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122073811] [2024-01-26 00:48:08,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:08,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122073811] [2024-01-26 00:48:08,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122073811] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:08,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:08,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 00:48:08,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769636365] [2024-01-26 00:48:08,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:08,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 00:48:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 00:48:08,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 00:48:08,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:08,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:08,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:48:08,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:08,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-01-26 00:48:08,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-01-26 00:48:08,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:48:08,477 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 Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:50:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:50:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-26 00:50:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-26 00:50:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:50:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:50:17,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-26 00:50:17,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:50:17,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:50:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1070267127, now seen corresponding path program 5 times [2024-01-26 00:50:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:50:17,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994943633] [2024-01-26 00:50:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:50:17,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:50:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:50:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:50:17,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:50:17,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994943633] [2024-01-26 00:50:17,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994943633] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:50:17,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:50:17,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-01-26 00:50:17,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536069747] [2024-01-26 00:50:17,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:50:17,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-26 00:50:17,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:50:17,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-26 00:50:17,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-01-26 00:50:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:50:17,967 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:50:17,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:50:17,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:50:17,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-01-26 00:50:17,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-01-26 00:50:17,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:50:17,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:50:17,970 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 Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:52:44,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:52:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-26 00:52:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-26 00:52:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:52:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:52:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:52:44,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-26 00:52:44,699 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:52:44,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:52:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash -397505557, now seen corresponding path program 6 times [2024-01-26 00:52:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:52:44,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009295661] [2024-01-26 00:52:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:52:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:52:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:52:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:52:45,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:52:45,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009295661] [2024-01-26 00:52:45,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009295661] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:52:45,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:52:45,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-01-26 00:52:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320096972] [2024-01-26 00:52:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:52:45,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-26 00:52:45,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:52:45,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-26 00:52:45,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-01-26 00:52:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:52:45,932 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:52:45,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.9375) internal successors, (143), 16 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:52:45,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:52:45,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-01-26 00:52:45,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-01-26 00:52:45,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:52:45,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:52:45,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:52:45,932 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 Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:00:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:00:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-26 01:00:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-26 01:00:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 01:00:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 01:00:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:00:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-26 01:00:17,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 01:00:17,399 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:00:17,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:00:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash 810074603, now seen corresponding path program 7 times [2024-01-26 01:00:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:00:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665443431] [2024-01-26 01:00:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:00:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:00:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:00:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 01:00:18,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:00:18,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665443431] [2024-01-26 01:00:18,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665443431] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 01:00:18,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 01:00:18,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-01-26 01:00:18,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697803151] [2024-01-26 01:00:18,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 01:00:18,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-26 01:00:18,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:00:18,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-26 01:00:18,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-01-26 01:00:18,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:00:18,215 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:00:18,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 01:00:18,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:00:18,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-01-26 01:00:18,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-01-26 01:00:18,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 01:00:18,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 01:00:18,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:00:18,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-01-26 01:00:18,216 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 Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer 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... [2024-01-26 01:02:36,206 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 01:02:36,209 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 01:02:36,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-26 01:02:36,709 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DynamicStratifiedReduction. [2024-01-26 01:02:36,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 01:02:36,780 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1] [2024-01-26 01:02:36,781 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2024-01-26 01:02:36,783 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 01:02:36,783 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 01:02:36,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 01:02:36 BasicIcfg [2024-01-26 01:02:36,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 01:02:36,786 INFO L158 Benchmark]: Toolchain (without parser) took 874207.47ms. Allocated memory was 326.1MB in the beginning and 604.0MB in the end (delta: 277.9MB). Free memory was 270.3MB in the beginning and 293.2MB in the end (delta: -22.8MB). Peak memory consumption was 255.5MB. Max. memory is 8.0GB. [2024-01-26 01:02:36,787 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory is still 160.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 01:02:36,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.85ms. Allocated memory is still 326.1MB. Free memory was 270.1MB in the beginning and 256.8MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-01-26 01:02:36,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.03ms. Allocated memory is still 326.1MB. Free memory was 256.6MB in the beginning and 254.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:02:36,788 INFO L158 Benchmark]: Boogie Preprocessor took 46.04ms. Allocated memory is still 326.1MB. Free memory was 254.4MB in the beginning and 252.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:02:36,788 INFO L158 Benchmark]: RCFGBuilder took 582.60ms. Allocated memory is still 326.1MB. Free memory was 252.5MB in the beginning and 272.5MB in the end (delta: -20.0MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2024-01-26 01:02:36,788 INFO L158 Benchmark]: TraceAbstraction took 873230.31ms. Allocated memory was 326.1MB in the beginning and 604.0MB in the end (delta: 277.9MB). Free memory was 271.4MB in the beginning and 293.2MB in the end (delta: -21.8MB). Peak memory consumption was 256.1MB. Max. memory is 8.0GB. [2024-01-26 01:02:36,794 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.10ms. Allocated memory is still 212.9MB. Free memory is still 160.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.85ms. Allocated memory is still 326.1MB. Free memory was 270.1MB in the beginning and 256.8MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.03ms. Allocated memory is still 326.1MB. Free memory was 256.6MB in the beginning and 254.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.04ms. Allocated memory is still 326.1MB. Free memory was 254.4MB in the beginning and 252.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 582.60ms. Allocated memory is still 326.1MB. Free memory was 252.5MB in the beginning and 272.5MB in the end (delta: -20.0MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. * TraceAbstraction took 873230.31ms. Allocated memory was 326.1MB in the beginning and 604.0MB in the end (delta: 277.9MB). Free memory was 271.4MB in the beginning and 293.2MB in the end (delta: -21.8MB). Peak memory consumption was 256.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 50983, independent: 50384, independent conditional: 50384, independent unconditional: 0, dependent: 599, dependent conditional: 599, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50968, independent: 50384, independent conditional: 50384, independent unconditional: 0, dependent: 584, dependent conditional: 584, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50968, independent: 50384, independent conditional: 50384, independent unconditional: 0, dependent: 584, dependent conditional: 584, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54714, independent: 50384, independent conditional: 0, independent unconditional: 50384, dependent: 4330, dependent conditional: 3746, dependent unconditional: 584, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54714, independent: 50384, independent conditional: 0, independent unconditional: 50384, dependent: 4330, dependent conditional: 0, dependent unconditional: 4330, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54714, independent: 50384, independent conditional: 0, independent unconditional: 50384, dependent: 4330, dependent conditional: 0, dependent unconditional: 4330, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50968, independent: 50384, independent conditional: 0, independent unconditional: 50384, dependent: 584, dependent conditional: 0, dependent unconditional: 584, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50968, independent: 49963, independent conditional: 0, independent unconditional: 49963, dependent: 1005, dependent conditional: 0, dependent unconditional: 1005, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1005, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 584, dependent conditional: 0, dependent unconditional: 584, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1005, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 584, dependent conditional: 0, dependent unconditional: 584, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1005, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 584, dependent conditional: 0, dependent unconditional: 584, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1131, independent: 485, independent conditional: 0, independent unconditional: 485, dependent: 646, dependent conditional: 0, dependent unconditional: 646, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 54714, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3746, dependent conditional: 0, dependent unconditional: 3746, unknown: 50968, unknown conditional: 0, unknown unconditional: 50968] , Statistics on independence cache: Total cache size (in pairs): 50968, Positive cache size: 50384, Positive conditional cache size: 0, Positive unconditional cache size: 50384, Negative cache size: 584, Negative conditional cache size: 0, Negative unconditional cache size: 584, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3746, Maximal queried relation: 8, Independence queries for same thread: 15 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 8, RedundantProofs: 2, ProvenStates: 1992, Times there's more than one choice: 121, Avg number of choices: 1.2414658634538152 - StatisticsResult: Reduction benchmarks 0.2s Time before loop, 451.2s Time in loop, 451.5s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, write~int_#ptr.base, thread1_#res#1.base, thread2_#res#1.base, thread3_#res#1.base, thread2Thread1of1ForFork1_~_argptr#1.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet9#1, thread2Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork2_#t~post3#1, ULTIMATE.start_main_~#t3~0#1.offset, thread3Thread1of1ForFork2_~_argptr#1.offset, thread1Thread1of1ForFork0_#res#1.base, thread1_~_argptr#1.base, thread2_~_argptr#1.base, thread3_~_argptr#1.base, read~int_#ptr.base, ULTIMATE.start_#t~ret23#1, thread1_#res#1.offset, thread2_#res#1.offset, thread3_#res#1.offset, thread3Thread1of1ForFork2_#in~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post2#1, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread2Thread1of1ForFork1_~_argptr#1.offset, thread3Thread1of1ForFork2_#in~_argptr#1.base, thread3Thread1of1ForFork2_thidvar0, old(thread3Thread1of1ForFork2_thidvar0), thread3Thread1of1ForFork2_thidvar1, old(thread3Thread1of1ForFork2_thidvar1), thread3Thread1of1ForFork2_thidvar2, old(thread3Thread1of1ForFork2_thidvar2), thread3Thread1of1ForFork2_thidvar3, old(thread3Thread1of1ForFork2_thidvar3), ~e1~0, old(~e1~0), ~e2~0, old(~e2~0), ~e3~0, old(~e3~0), ~i1~0, old(~i1~0), ~i2~0, old(~i2~0), ~i3~0, old(~i3~0), ULTIMATE.start_main_~#t1~0#1.offset, ~n1~0, old(~n1~0), ~n2~0, old(~n2~0), ~n3~0, old(~n3~0), thread1_#t~post1#1, thread2_#t~post2#1, thread3_#t~post3#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~pre18#1, #Ultimate.allocOnStack_#res.offset, thread2Thread1of1ForFork1_#in~_argptr#1.offset, ULTIMATE.dealloc_~addr.offset, thread1_~_argptr#1.offset, thread2_~_argptr#1.offset, thread3_~_argptr#1.offset, write~int_#value, write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1_#in~_argptr#1.offset, thread2_#in~_argptr#1.offset, thread3_#in~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.offset, ~i~0, old(~i~0), thread2Thread1of1ForFork1_#in~_argptr#1.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread1_assume_abort_if_not_~cond#1, thread2_assume_abort_if_not_~cond#1, thread3_assume_abort_if_not_~cond#1, write~init~int_#ptr.base, thread2Thread1of1ForFork1_thidvar0, old(thread2Thread1of1ForFork1_thidvar0), thread2Thread1of1ForFork1_thidvar1, old(thread2Thread1of1ForFork1_thidvar1), thread2Thread1of1ForFork1_thidvar2, old(thread2Thread1of1ForFork1_thidvar2), thread1Thread1of1ForFork0_#in~_argptr#1.offset, thread1_#in~_argptr#1.base, thread2_#in~_argptr#1.base, thread3_#in~_argptr#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, #length, old(#length), thread1Thread1of1ForFork0_#in~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, thread3Thread1of1ForFork2_#res#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, old(#StackHeapBarrier), thread1_assume_abort_if_not_#in~cond#1, thread2_assume_abort_if_not_#in~cond#1, thread3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, old(thread1Thread1of1ForFork0_thidvar0), thread1Thread1of1ForFork0_thidvar1, old(thread1Thread1of1ForFork0_thidvar1), write~int_#ptr.offset, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, old(#memory_int), thread3Thread1of1ForFork2_#res#1.offset, #Ultimate.allocOnStack_#res.base, thread2Thread1of1ForFork1_#res#1.base, read~int_#ptr.offset], Protected Variables before encountering a loop: [~i1~0, ~i2~0, ~i3~0, ~n1~0, ~n2~0, ~n3~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~i~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] - TimeoutResultAtElement [Line: 196]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing DynamicStratifiedReduction. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 211 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 873.0s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 868.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 67, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1146 NumberOfCodeBlocks, 1146 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1138 ConstructedInterpolants, 0 QuantifiedInterpolants, 2821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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