/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/chl-file-item-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 00:18:39,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 00:18:39,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 00:18:39,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 00:18:39,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 00:18:39,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 00:18:39,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 00:18:39,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 00:18:39,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 00:18:39,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 00:18:39,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 00:18:39,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 00:18:39,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 00:18:39,568 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 00:18:39,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 00:18:39,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 00:18:39,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 00:18:39,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 00:18:39,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 00:18:39,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 00:18:39,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 00:18:39,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 00:18:39,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 00:18:39,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 00:18:39,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 00:18:39,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 00:18:39,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 00:18:39,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 00:18:39,571 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 00:18:39,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 00:18:39,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:18:39,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 00:18:39,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 00:18:39,572 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 00:18:39,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 00:18:39,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 00:18:39,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 00:18:39,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 00:18:39,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 00:18:39,573 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 00:18:39,573 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 00:18:39,573 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:18:39,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 00:18:39,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 00:18:39,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 00:18:39,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 00:18:39,798 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 00:18:39,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c [2024-01-26 00:18:41,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 00:18:41,653 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 00:18:41,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c [2024-01-26 00:18:41,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1b72f6221/bc2d435a619740a59a2fef35c3ab4a6f/FLAGeb31b77e3 [2024-01-26 00:18:41,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1b72f6221/bc2d435a619740a59a2fef35c3ab4a6f [2024-01-26 00:18:41,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 00:18:41,716 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 00:18:41,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 00:18:41,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 00:18:41,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 00:18:41,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:18:41" (1/1) ... [2024-01-26 00:18:41,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd0d903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:41, skipping insertion in model container [2024-01-26 00:18:41,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:18:41" (1/1) ... [2024-01-26 00:18:41,769 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 00:18:42,022 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/chl-file-item-symm.wvr.c[2521,2534] [2024-01-26 00:18:42,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:18:42,055 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 00:18:42,103 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/chl-file-item-symm.wvr.c[2521,2534] [2024-01-26 00:18:42,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:18:42,124 INFO L206 MainTranslator]: Completed translation [2024-01-26 00:18:42,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42 WrapperNode [2024-01-26 00:18:42,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 00:18:42,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 00:18:42,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 00:18:42,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 00:18:42,146 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:18:42" (1/1) ... [2024-01-26 00:18:42,158 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:18:42" (1/1) ... [2024-01-26 00:18:42,199 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 149 [2024-01-26 00:18:42,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 00:18:42,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 00:18:42,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 00:18:42,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 00:18:42,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42" (1/1) ... [2024-01-26 00:18:42,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42" (1/1) ... [2024-01-26 00:18:42,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42" (1/1) ... [2024-01-26 00:18:42,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42" (1/1) ... [2024-01-26 00:18:42,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42" (1/1) ... [2024-01-26 00:18:42,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42" (1/1) ... [2024-01-26 00:18:42,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42" (1/1) ... [2024-01-26 00:18:42,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42" (1/1) ... [2024-01-26 00:18:42,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 00:18:42,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 00:18:42,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 00:18:42,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 00:18:42,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42" (1/1) ... [2024-01-26 00:18:42,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:18:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:18:42,321 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:18:42,396 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:18:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 00:18:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 00:18:42,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 00:18:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 00:18:42,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 00:18:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 00:18:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 00:18:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 00:18:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 00:18:42,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 00:18:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 00:18:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 00:18:42,450 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:18:42,554 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 00:18:42,555 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 00:18:42,967 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 00:18:42,998 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 00:18:42,999 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-26 00:18:42,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:18:42 BoogieIcfgContainer [2024-01-26 00:18:42,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 00:18:43,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 00:18:43,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 00:18:43,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 00:18:43,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 12:18:41" (1/3) ... [2024-01-26 00:18:43,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e791a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:18:43, skipping insertion in model container [2024-01-26 00:18:43,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:18:42" (2/3) ... [2024-01-26 00:18:43,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e791a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:18:43, skipping insertion in model container [2024-01-26 00:18:43,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:18:42" (3/3) ... [2024-01-26 00:18:43,005 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2024-01-26 00:18:43,039 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 00:18:43,046 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 00:18:43,046 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 00:18:43,046 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 00:18:43,217 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 00:18:43,307 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:18:43,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 00:18:43,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:18:43,322 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:18:43,377 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:18:43,397 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 00:18:43,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 00:18:43,431 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;@68fe773f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:18:43,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 00:18:43,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:43,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1306829319, now seen corresponding path program 1 times [2024-01-26 00:18:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:43,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396373727] [2024-01-26 00:18:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:43,959 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:18:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396373727] [2024-01-26 00:18:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396373727] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:43,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 00:18:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144198077] [2024-01-26 00:18:43,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:43,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 00:18:43,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:44,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 00:18:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 00:18:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:44,016 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:44,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 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:18:44,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:44,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 00:18:44,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:44,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash -91981113, now seen corresponding path program 1 times [2024-01-26 00:18:44,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:44,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224759434] [2024-01-26 00:18:44,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:44,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:45,112 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:18:45,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224759434] [2024-01-26 00:18:45,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224759434] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:45,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:45,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-01-26 00:18:45,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796757238] [2024-01-26 00:18:45,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:45,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-26 00:18:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:45,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-26 00:18:45,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-01-26 00:18:45,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:45,115 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:45,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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:18:45,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:45,116 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 [2024-01-26 00:18:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:45,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-26 00:18:45,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 00:18:45,514 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:45,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1876125085, now seen corresponding path program 1 times [2024-01-26 00:18:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:45,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674484042] [2024-01-26 00:18:45,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:45,818 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:18:45,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:45,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674484042] [2024-01-26 00:18:45,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674484042] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:45,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:45,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-01-26 00:18:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780712300] [2024-01-26 00:18:45,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:45,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-26 00:18:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:45,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-26 00:18:45,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-01-26 00:18:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:45,824 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:45,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 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:18:45,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:45,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-01-26 00:18:45,825 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 [2024-01-26 00:18:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:46,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 00:18:46,673 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:46,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash -437470461, now seen corresponding path program 1 times [2024-01-26 00:18:46,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:46,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908162791] [2024-01-26 00:18:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:46,986 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:18:46,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:46,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908162791] [2024-01-26 00:18:46,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908162791] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:46,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:46,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-01-26 00:18:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46844441] [2024-01-26 00:18:46,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:46,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-26 00:18:46,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-26 00:18:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-01-26 00:18:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:46,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:46,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 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:18:46,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:46,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:46,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:46,995 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 [2024-01-26 00:18:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:47,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 00:18:47,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-26 00:18:47,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:47,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash -701508701, now seen corresponding path program 1 times [2024-01-26 00:18:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:47,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892052416] [2024-01-26 00:18:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:47,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:47,347 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:18:47,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:47,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892052416] [2024-01-26 00:18:47,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892052416] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:47,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:47,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 00:18:47,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058095851] [2024-01-26 00:18:47,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:47,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 00:18:47,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:47,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 00:18:47,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 00:18:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:47,354 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:47,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:18:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:47,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 00:18:47,355 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 [2024-01-26 00:18:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:47,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-26 00:18:47,836 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:47,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1102533799, now seen corresponding path program 1 times [2024-01-26 00:18:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:47,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255302058] [2024-01-26 00:18:47,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:47,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:47,897 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:18:47,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:47,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255302058] [2024-01-26 00:18:47,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255302058] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:47,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:47,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 00:18:47,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691476334] [2024-01-26 00:18:47,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:47,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 00:18:47,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:47,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 00:18:47,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 00:18:47,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:47,898 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:47,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:18:47,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:47,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:47,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:47,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:47,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:47,899 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 [2024-01-26 00:18:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:48,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:48,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-26 00:18:48,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:48,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:48,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1307772089, now seen corresponding path program 1 times [2024-01-26 00:18:48,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:48,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399839992] [2024-01-26 00:18:48,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:48,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:48,832 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:18:48,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399839992] [2024-01-26 00:18:48,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399839992] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:48,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:48,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-01-26 00:18:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405303658] [2024-01-26 00:18:48,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:48,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-26 00:18:48,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:48,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-26 00:18:48,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-01-26 00:18:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:48,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:48,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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:18:48,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:48,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:48,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:48,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:48,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:48,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:48,838 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 [2024-01-26 00:18:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-26 00:18:49,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 00:18:49,983 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:49,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash 692094980, now seen corresponding path program 1 times [2024-01-26 00:18:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:49,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617237097] [2024-01-26 00:18:49,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:50,398 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:18:50,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:50,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617237097] [2024-01-26 00:18:50,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617237097] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:50,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:50,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-01-26 00:18:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692556043] [2024-01-26 00:18:50,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:50,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-26 00:18:50,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-26 00:18:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-01-26 00:18:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:50,403 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:50,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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:18:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:50,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-01-26 00:18:50,404 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 [2024-01-26 00:18:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-01-26 00:18:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-26 00:18:53,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-26 00:18:53,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:53,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash 633777252, now seen corresponding path program 1 times [2024-01-26 00:18:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:53,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260353869] [2024-01-26 00:18:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:54,096 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:18:54,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:54,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260353869] [2024-01-26 00:18:54,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260353869] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:54,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:54,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-01-26 00:18:54,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439385874] [2024-01-26 00:18:54,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:54,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-26 00:18:54,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:54,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-26 00:18:54,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-01-26 00:18:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:54,098 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:54,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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:18:54,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:54,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:54,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:54,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:54,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:54,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:54,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-01-26 00:18:54,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-01-26 00:18:54,099 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 [2024-01-26 00:18:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-01-26 00:18:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-26 00:18:55,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-01-26 00:18:55,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-26 00:18:55,492 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:55,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2037615216, now seen corresponding path program 1 times [2024-01-26 00:18:55,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:55,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715442140] [2024-01-26 00:18:55,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:55,560 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:18:55,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:55,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715442140] [2024-01-26 00:18:55,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715442140] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:55,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:55,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 00:18:55,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502364597] [2024-01-26 00:18:55,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:55,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 00:18:55,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:55,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 00:18:55,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 00:18:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:55,563 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:55,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:18:55,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:55,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:55,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:55,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:55,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:55,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:55,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-01-26 00:18:55,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-01-26 00:18:55,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-01-26 00:18:55,564 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 [2024-01-26 00:18:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-01-26 00:18:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-26 00:18:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-01-26 00:18:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:58,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-26 00:18:58,128 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:58,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1761852403, now seen corresponding path program 1 times [2024-01-26 00:18:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:58,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799738548] [2024-01-26 00:18:58,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:18:58,193 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:18:58,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:18:58,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799738548] [2024-01-26 00:18:58,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799738548] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:18:58,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:18:58,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 00:18:58,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083769591] [2024-01-26 00:18:58,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:18:58,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 00:18:58,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:18:58,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 00:18:58,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 00:18:58,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:58,194 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:18:58,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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:18:58,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:58,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:58,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:58,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:58,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:58,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:58,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-01-26 00:18:58,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-01-26 00:18:58,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-01-26 00:18:58,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:58,195 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 [2024-01-26 00:18:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:18:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:18:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:18:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-01-26 00:18:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-26 00:18:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-01-26 00:18:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:18:59,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-26 00:18:59,738 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:18:59,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:18:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash -834172897, now seen corresponding path program 1 times [2024-01-26 00:18:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:18:59,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039108775] [2024-01-26 00:18:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:18:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:18:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:19:01,131 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:19:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:19:01,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039108775] [2024-01-26 00:19:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039108775] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:19:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:19:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2024-01-26 00:19:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265527042] [2024-01-26 00:19:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:19:01,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-01-26 00:19:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:19:01,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-01-26 00:19:01,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2024-01-26 00:19:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:19:01,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:19:01,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.1) internal successors, (153), 30 states have internal predecessors, (153), 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:19:01,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:19:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:19:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:19:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:19:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:19:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:19:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-01-26 00:19:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-01-26 00:19:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-01-26 00:19:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:19:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:19:01,134 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 [2024-01-26 00:29:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:29:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:29:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:29:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:29:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:29:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:29:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-01-26 00:29:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-26 00:29:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-01-26 00:29:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:29:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:29:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2024-01-26 00:29:40,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 00:29:40,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-26 00:29:40,840 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 00:29:40,845 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/3) [2024-01-26 00:29:40,854 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:29:40,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 00:29:40,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:29:40,900 INFO L229 MonitoredProcess]: Starting monitored process 3 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:29:40,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-01-26 00:29:40,923 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 00:29:40,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-01-26 00:29:40,923 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;@68fe773f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:29:40,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-26 00:29:40,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-01-26 00:29:40,927 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-01-26 00:29:40,927 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2024-01-26 00:29:40,929 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:29:40,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 00:29:40,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:29:40,962 INFO L229 MonitoredProcess]: Starting monitored process 4 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:29:40,970 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 00:29:40,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-01-26 00:29:40,971 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;@68fe773f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:29:40,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:29:41,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer 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:29:41,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-01-26 00:29:41,495 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-01-26 00:29:41,495 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/3) [2024-01-26 00:29:41,496 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 00:29:41,496 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 00:29:41,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 12:29:41 BasicIcfg [2024-01-26 00:29:41,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 00:29:41,501 INFO L158 Benchmark]: Toolchain (without parser) took 659785.55ms. Allocated memory was 232.8MB in the beginning and 584.1MB in the end (delta: 351.3MB). Free memory was 178.5MB in the beginning and 259.3MB in the end (delta: -80.8MB). Peak memory consumption was 271.6MB. Max. memory is 8.0GB. [2024-01-26 00:29:41,501 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory was 124.9MB in the beginning and 124.8MB in the end (delta: 158.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 00:29:41,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.42ms. Allocated memory is still 232.8MB. Free memory was 178.5MB in the beginning and 166.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-01-26 00:29:41,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.96ms. Allocated memory is still 232.8MB. Free memory was 166.5MB in the beginning and 164.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 00:29:41,502 INFO L158 Benchmark]: Boogie Preprocessor took 63.20ms. Allocated memory is still 232.8MB. Free memory was 164.4MB in the beginning and 163.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-01-26 00:29:41,502 INFO L158 Benchmark]: RCFGBuilder took 735.68ms. Allocated memory is still 232.8MB. Free memory was 162.8MB in the beginning and 144.5MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-01-26 00:29:41,502 INFO L158 Benchmark]: TraceAbstraction took 658500.39ms. Allocated memory was 232.8MB in the beginning and 584.1MB in the end (delta: 351.3MB). Free memory was 143.9MB in the beginning and 259.3MB in the end (delta: -115.4MB). Peak memory consumption was 237.0MB. Max. memory is 8.0GB. [2024-01-26 00:29:41,504 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory was 124.9MB in the beginning and 124.8MB in the end (delta: 158.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 406.42ms. Allocated memory is still 232.8MB. Free memory was 178.5MB in the beginning and 166.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.96ms. Allocated memory is still 232.8MB. Free memory was 166.5MB in the beginning and 164.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.20ms. Allocated memory is still 232.8MB. Free memory was 164.4MB in the beginning and 163.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 735.68ms. Allocated memory is still 232.8MB. Free memory was 162.8MB in the beginning and 144.5MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 658500.39ms. Allocated memory was 232.8MB in the beginning and 584.1MB in the end (delta: 351.3MB). Free memory was 143.9MB in the beginning and 259.3MB in the end (delta: -115.4MB). Peak memory consumption was 237.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29238, independent: 27327, independent conditional: 27327, independent unconditional: 0, dependent: 1911, dependent conditional: 1911, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27327, independent: 27327, independent conditional: 27327, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27327, independent: 27327, independent conditional: 27327, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27327, independent: 27327, independent conditional: 0, independent unconditional: 27327, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27327, independent: 27327, independent conditional: 0, independent unconditional: 27327, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27327, independent: 27327, independent conditional: 0, independent unconditional: 27327, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27327, independent: 27327, independent conditional: 0, independent unconditional: 27327, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27327, independent: 27327, independent conditional: 0, independent unconditional: 27327, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27327, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 27327, unknown conditional: 0, unknown unconditional: 27327] , Statistics on independence cache: Total cache size (in pairs): 27327, Positive cache size: 27327, Positive conditional cache size: 0, Positive unconditional cache size: 27327, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1911 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 10, RedundantProofs: 1, ProvenStates: 2111, Times there's more than one choice: 505, Avg number of choices: 3.3694931312174323 - StatisticsResult: Reduction benchmarks 0.2s Time before loop, 639.5s Time in loop, 639.6s Time in total, Has Loop: true, Protected Variables: [thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1, ~result_6~0, ~result_7~0, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_#t~ret1#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, ~filename_1~0, ~filename_2~0, ~filename_4~0, ~filename_5~0, thread2Thread1of1ForFork1_#t~ite7#1, thread2Thread1of1ForFork1_#t~ite8#1, thread2Thread1of1ForFork1_#t~ite9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, thread2Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~isNull_0~0, ~isNull_3~0, thread1Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork1_#t~ite10#1], Protected Variables before encountering a loop: [] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Reduction benchmarks 0.0s Time before loop, 0.0s Time in loop, 0.0s Time in total, Has Loop: false, Protected Variables: [], Protected Variables before encountering a loop: [] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 706, independent: 670, independent conditional: 670, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 670, independent: 670, independent conditional: 670, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 670, independent: 670, independent conditional: 670, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 670, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 670, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 670, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 670, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 670, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 670, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 670, unknown conditional: 0, unknown unconditional: 670] , Statistics on independence cache: Total cache size (in pairs): 670, Positive cache size: 670, Positive conditional cache size: 0, Positive unconditional cache size: 670, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 36 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Reduction benchmarks 0.0s Time before loop, 0.5s Time in loop, 0.5s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1, write~int_#ptr.base, thread2Thread1of1ForFork1_#t~ret6#1, thread2_#t~ite10#1, thread1_#res#1.base, thread2_#res#1.base, thread2Thread1of1ForFork1_~_argptr#1.base, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#res#1, thread2Thread1of1ForFork1_#res#1.offset, thread1_minus_#in~a#1, thread2_minus_#in~a#1, thread1_minus_#in~b#1, thread2_minus_#in~b#1, thread1_#t~ret1#1, thread2_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base, thread1_~_argptr#1.base, thread2_~_argptr#1.base, read~int_#ptr.base, ~result_6~0, old(~result_6~0), ~result_7~0, old(~result_7~0), ULTIMATE.start_#t~ret23#1, thread1_#res#1.offset, thread2_#res#1.offset, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork0_#res#1.offset, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_~_argptr#1.offset, ~filename_1~0, old(~filename_1~0), ~filename_2~0, old(~filename_2~0), ~filename_4~0, old(~filename_4~0), ~filename_5~0, old(~filename_5~0), ULTIMATE.start_main_~#t1~0#1.offset, thread2Thread1of1ForFork1_#t~ite7#1, thread2Thread1of1ForFork1_#t~ite8#1, thread2Thread1of1ForFork1_#t~ite9#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1, #Ultimate.allocOnStack_#res.offset, thread2Thread1of1ForFork1_#in~_argptr#1.offset, ULTIMATE.dealloc_~addr.offset, thread1_minus_~a#1, thread2_minus_~a#1, thread1_minus_~b#1, thread2_minus_~b#1, thread1_~_argptr#1.offset, thread2_~_argptr#1.offset, write~int_#value, write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, thread1_#t~ite2#1, thread1_#t~ite3#1, thread1_#t~ite4#1, thread1_#t~ite5#1, thread2_#t~ite7#1, thread2_#t~ite8#1, thread2_#t~ite9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1_#in~_argptr#1.offset, thread2_#in~_argptr#1.offset, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread2Thread1of1ForFork1_#in~_argptr#1.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, thread1_assume_abort_if_not_~cond#1, thread2_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, thread2Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet18#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet20#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, thread1_minus_#res#1, thread2_minus_#res#1, #StackHeapBarrier, old(#StackHeapBarrier), thread1_assume_abort_if_not_#in~cond#1, thread2_assume_abort_if_not_#in~cond#1, ~isNull_0~0, old(~isNull_0~0), ~isNull_3~0, old(~isNull_3~0), thread1Thread1of1ForFork0_minus_#res#1, 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), #Ultimate.allocOnStack_#res.base, thread2Thread1of1ForFork1_#t~ite10#1, thread2Thread1of1ForFork1_#res#1.base, read~int_#ptr.offset], Protected Variables before encountering a loop: [] - PositiveResult [Line: 74]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 274 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 657.5s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 652.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 352, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1331 NumberOfCodeBlocks, 1331 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1319 ConstructedInterpolants, 0 QuantifiedInterpolants, 5446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 274 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 274 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-01-26 00:29:41,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-01-26 00:29:41,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-01-26 00:29:41,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-01-26 00:29:42,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...