/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 07:54:17,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 07:54:17,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-03 07:54:17,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 07:54:17,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 07:54:17,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 07:54:17,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 07:54:17,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 07:54:17,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 07:54:17,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 07:54:17,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 07:54:17,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 07:54:17,906 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 07:54:17,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 07:54:17,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 07:54:17,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 07:54:17,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 07:54:17,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 07:54:17,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 07:54:17,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 07:54:17,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 07:54:17,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 07:54:17,909 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 07:54:17,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 07:54:17,909 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 07:54:17,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 07:54:17,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 07:54:17,910 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 07:54:17,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 07:54:17,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 07:54:17,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 07:54:17,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 07:54:17,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 07:54:17,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 07:54:17,912 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-03 07:54:17,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-03 07:54:17,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 07:54:17,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 07:54:17,912 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 07:54:17,912 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-05-03 07:54:18,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 07:54:18,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 07:54:18,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 07:54:18,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 07:54:18,193 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 07:54:18,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-05-03 07:54:19,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 07:54:19,513 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 07:54:19,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-05-03 07:54:19,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d3da45ea4/e7cb5eb6a8624618bfe049eed7b15fec/FLAGa87dbe0d4 [2024-05-03 07:54:19,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d3da45ea4/e7cb5eb6a8624618bfe049eed7b15fec [2024-05-03 07:54:19,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 07:54:19,534 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 07:54:19,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 07:54:19,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 07:54:19,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 07:54:19,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b612ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19, skipping insertion in model container [2024-05-03 07:54:19,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,557 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 07:54:19,663 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/mult-dist.wvr.c[2116,2129] [2024-05-03 07:54:19,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 07:54:19,673 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 07:54:19,686 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/mult-dist.wvr.c[2116,2129] [2024-05-03 07:54:19,687 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 07:54:19,697 INFO L206 MainTranslator]: Completed translation [2024-05-03 07:54:19,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19 WrapperNode [2024-05-03 07:54:19,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 07:54:19,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 07:54:19,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 07:54:19,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 07:54:19,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,735 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-05-03 07:54:19,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 07:54:19,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 07:54:19,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 07:54:19,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 07:54:19,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 07:54:19,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 07:54:19,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 07:54:19,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 07:54:19,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (1/1) ... [2024-05-03 07:54:19,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 07:54:19,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 07:54:19,782 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-05-03 07:54:19,829 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-05-03 07:54:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 07:54:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 07:54:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 07:54:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 07:54:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 07:54:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-03 07:54:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-03 07:54:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 07:54:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 07:54:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 07:54:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 07:54:19,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 07:54:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 07:54:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 07:54:19,854 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 07:54:19,915 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 07:54:19,917 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 07:54:20,044 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 07:54:20,052 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 07:54:20,052 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-03 07:54:20,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 07:54:20 BoogieIcfgContainer [2024-05-03 07:54:20,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 07:54:20,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 07:54:20,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 07:54:20,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 07:54:20,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 07:54:19" (1/3) ... [2024-05-03 07:54:20,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17270636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 07:54:20, skipping insertion in model container [2024-05-03 07:54:20,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 07:54:19" (2/3) ... [2024-05-03 07:54:20,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17270636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 07:54:20, skipping insertion in model container [2024-05-03 07:54:20,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 07:54:20" (3/3) ... [2024-05-03 07:54:20,058 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2024-05-03 07:54:20,064 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 07:54:20,070 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 07:54:20,071 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 07:54:20,071 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 07:54:20,119 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-03 07:54:20,148 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 07:54:20,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 07:54:20,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 07:54:20,150 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-05-03 07:54:20,161 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-05-03 07:54:20,198 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 07:54:20,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 07:54:20,207 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@193811b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 07:54:20,207 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 07:54:20,353 INFO L78 Accepts]: Start accepts. Automaton has currently 572 states, but on-demand construction may add more states Word has length 76 [2024-05-03 07:54:20,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 07:54:20,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 07:54:20,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 07:54:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1473421353, now seen corresponding path program 1 times [2024-05-03 07:54:20,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 07:54:20,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312950561] [2024-05-03 07:54:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 07:54:20,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 07:54:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 07:54:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:20,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 07:54:20,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312950561] [2024-05-03 07:54:20,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312950561] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 07:54:20,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 07:54:20,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 07:54:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679212284] [2024-05-03 07:54:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 07:54:20,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 07:54:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 07:54:20,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 07:54:20,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 07:54:20,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:20,671 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 07:54:20,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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-05-03 07:54:20,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:20,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:20,729 INFO L78 Accepts]: Start accepts. Automaton has currently 572 states, but on-demand construction may add more states Word has length 75 [2024-05-03 07:54:20,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 07:54:20,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 07:54:20,730 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 07:54:20,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 07:54:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash 601748910, now seen corresponding path program 1 times [2024-05-03 07:54:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 07:54:20,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874001639] [2024-05-03 07:54:20,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 07:54:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 07:54:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 07:54:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 07:54:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874001639] [2024-05-03 07:54:21,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874001639] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 07:54:21,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 07:54:21,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-03 07:54:21,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644350406] [2024-05-03 07:54:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 07:54:21,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-03 07:54:21,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 07:54:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-03 07:54:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-03 07:54:21,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:21,383 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 07:54:21,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-05-03 07:54:21,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:21,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 07:54:21,453 INFO L78 Accepts]: Start accepts. Automaton has currently 288 states, but on-demand construction may add more states Word has length 80 [2024-05-03 07:54:21,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 07:54:21,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 07:54:21,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 07:54:21,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 07:54:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash 620088758, now seen corresponding path program 1 times [2024-05-03 07:54:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 07:54:21,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010682877] [2024-05-03 07:54:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 07:54:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 07:54:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 07:54:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 07:54:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010682877] [2024-05-03 07:54:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010682877] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 07:54:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878710096] [2024-05-03 07:54:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 07:54:21,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 07:54:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 07:54:21,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 07:54:21,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-03 07:54:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 07:54:22,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-03 07:54:22,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 07:54:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:22,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 07:54:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:24,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878710096] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-03 07:54:24,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-03 07:54:24,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 12 [2024-05-03 07:54:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073583896] [2024-05-03 07:54:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 07:54:24,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 07:54:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 07:54:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 07:54:24,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-05-03 07:54:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:24,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 07:54:24,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-05-03 07:54:24,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:24,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 07:54:24,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 07:54:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 07:54:24,293 INFO L78 Accepts]: Start accepts. Automaton has currently 433 states, but on-demand construction may add more states Word has length 90 [2024-05-03 07:54:24,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 07:54:24,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-03 07:54:24,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-03 07:54:24,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 07:54:24,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 07:54:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash -718090985, now seen corresponding path program 1 times [2024-05-03 07:54:24,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 07:54:24,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997310536] [2024-05-03 07:54:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 07:54:24,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 07:54:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 07:54:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:24,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 07:54:24,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997310536] [2024-05-03 07:54:24,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997310536] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 07:54:24,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89818573] [2024-05-03 07:54:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 07:54:24,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 07:54:24,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 07:54:24,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 07:54:24,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-03 07:54:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 07:54:25,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 23 conjunts are in the unsatisfiable core [2024-05-03 07:54:25,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 07:54:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:25,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 07:54:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:26,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89818573] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 07:54:26,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 07:54:26,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 37 [2024-05-03 07:54:26,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621139350] [2024-05-03 07:54:26,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 07:54:26,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-03 07:54:26,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 07:54:26,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-03 07:54:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2024-05-03 07:54:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:26,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 07:54:26,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.081081081081081) internal successors, (151), 37 states have internal predecessors, (151), 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-05-03 07:54:26,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:26,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 07:54:26,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 07:54:26,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 07:54:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 07:54:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 07:54:27,111 INFO L78 Accepts]: Start accepts. Automaton has currently 249 states, but on-demand construction may add more states Word has length 105 [2024-05-03 07:54:27,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 07:54:27,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-03 07:54:27,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 07:54:27,317 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 07:54:27,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 07:54:27,317 INFO L85 PathProgramCache]: Analyzing trace with hash 669846848, now seen corresponding path program 2 times [2024-05-03 07:54:27,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 07:54:27,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876983244] [2024-05-03 07:54:27,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 07:54:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 07:54:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 07:54:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 07:54:27,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876983244] [2024-05-03 07:54:27,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876983244] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 07:54:27,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555491547] [2024-05-03 07:54:27,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 07:54:27,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 07:54:27,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 07:54:27,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 07:54:27,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-03 07:54:28,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 07:54:28,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 07:54:28,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2024-05-03 07:54:28,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 07:54:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:28,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 07:54:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555491547] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 07:54:29,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 07:54:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 51 [2024-05-03 07:54:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818239703] [2024-05-03 07:54:29,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 07:54:29,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-05-03 07:54:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 07:54:29,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-05-03 07:54:29,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2252, Unknown=0, NotChecked=0, Total=2550 [2024-05-03 07:54:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:29,417 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 07:54:29,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.5294117647058822) internal successors, (180), 51 states have internal predecessors, (180), 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-05-03 07:54:29,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:29,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 07:54:29,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 07:54:29,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 07:54:29,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 07:54:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 07:54:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 07:54:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-03 07:54:30,869 INFO L78 Accepts]: Start accepts. Automaton has currently 313 states, but on-demand construction may add more states Word has length 125 [2024-05-03 07:54:30,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 07:54:30,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-03 07:54:31,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 07:54:31,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 07:54:31,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 07:54:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1257822016, now seen corresponding path program 3 times [2024-05-03 07:54:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 07:54:31,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735905420] [2024-05-03 07:54:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 07:54:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 07:54:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 07:54:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:31,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 07:54:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735905420] [2024-05-03 07:54:31,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735905420] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 07:54:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88305344] [2024-05-03 07:54:31,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 07:54:31,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 07:54:31,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 07:54:31,998 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 07:54:32,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-03 07:54:32,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-05-03 07:54:32,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 07:54:32,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 53 conjunts are in the unsatisfiable core [2024-05-03 07:54:32,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 07:54:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:33,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 07:54:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:54:35,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88305344] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 07:54:35,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 07:54:35,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 30] total 78 [2024-05-03 07:54:35,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446254728] [2024-05-03 07:54:35,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 07:54:35,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-05-03 07:54:35,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 07:54:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-05-03 07:54:35,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=5335, Unknown=0, NotChecked=0, Total=6006 [2024-05-03 07:54:35,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:35,107 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 07:54:35,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.08974358974359) internal successors, (241), 78 states have internal predecessors, (241), 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-05-03 07:54:35,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:35,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 07:54:35,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 07:54:35,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 07:54:35,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-03 07:54:35,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:54:52,004 WARN L293 SmtUtils]: Spent 13.50s on a formula simplification. DAG size of input: 80 DAG size of output: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 07:55:01,611 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification. DAG size of input: 76 DAG size of output: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 07:55:08,103 WARN L293 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 73 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 07:55:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:55:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 07:55:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 07:55:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-03 07:55:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-03 07:55:15,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-03 07:55:15,888 INFO L78 Accepts]: Start accepts. Automaton has currently 437 states, but on-demand construction may add more states Word has length 165 [2024-05-03 07:55:15,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 07:55:15,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-03 07:55:16,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-03 07:55:16,089 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 07:55:16,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 07:55:16,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1976210624, now seen corresponding path program 4 times [2024-05-03 07:55:16,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 07:55:16,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668434138] [2024-05-03 07:55:16,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 07:55:16,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 07:55:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 07:55:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:55:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 07:55:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668434138] [2024-05-03 07:55:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668434138] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 07:55:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807840760] [2024-05-03 07:55:17,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 07:55:17,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 07:55:17,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 07:55:17,692 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 07:55:17,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-03 07:55:17,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 07:55:17,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 07:55:17,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 84 conjunts are in the unsatisfiable core [2024-05-03 07:55:17,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 07:55:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:55:19,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 07:55:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 07:55:25,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807840760] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 07:55:25,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 07:55:25,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 46] total 128 [2024-05-03 07:55:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778561706] [2024-05-03 07:55:25,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 07:55:25,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-05-03 07:55:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 07:55:25,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-05-03 07:55:25,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1732, Invalid=14524, Unknown=0, NotChecked=0, Total=16256 [2024-05-03 07:55:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:55:25,566 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 07:55:25,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 2.890625) internal successors, (370), 128 states have internal predecessors, (370), 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-05-03 07:55:25,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:55:25,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 07:55:25,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 07:55:25,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-03 07:55:25,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-03 07:55:25,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-03 07:55:25,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 07:56:37,734 WARN L293 SmtUtils]: Spent 33.63s on a formula simplification. DAG size of input: 107 DAG size of output: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 07:57:55,745 WARN L293 SmtUtils]: Spent 41.31s on a formula simplification. DAG size of input: 131 DAG size of output: 119 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 07:57:57,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 08:02:17,081 WARN L293 SmtUtils]: Spent 3.37m on a formula simplification. DAG size of input: 150 DAG size of output: 151 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 08:02:55,897 WARN L293 SmtUtils]: Spent 21.56s on a formula simplification. DAG size of input: 90 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 08:07:08,949 WARN L293 SmtUtils]: Spent 3.36m on a formula simplification. DAG size of input: 146 DAG size of output: 147 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 08:07:11,025 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~a~0 4294967296))) (let ((.cse0 (< (+ 4294967295 (* (div (+ (- 2) .cse2) 4294967296) 4294967296)) .cse2)) (.cse1 (< (+ 4294967297 (* (div (+ .cse2 (- 4294967295)) 4294967296) 4294967296)) .cse2))) (and (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 12) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse2)) (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 14) 4294967296) 4294967295) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse2) .cse0 .cse1) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 13) 4294967296) 4294967295) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse2)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 13) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse2)) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 12) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse2))))) is different from false [2024-05-03 08:07:39,460 WARN L293 SmtUtils]: Spent 20.26s on a formula simplification. DAG size of input: 86 DAG size of output: 87 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 08:07:45,943 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~a~0 4294967296))) (let ((.cse0 (< (+ 4294967295 (* (div (+ (- 2) .cse2) 4294967296) 4294967296)) .cse2)) (.cse1 (< (+ 4294967297 (* (div (+ .cse2 (- 4294967295)) 4294967296) 4294967296)) .cse2))) (and (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 12) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse2) .cse0 .cse1) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 13) 4294967296) 4294967295) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse2)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 13) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse2)) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 12) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse2))))) is different from false [2024-05-03 08:08:02,156 WARN L293 SmtUtils]: Spent 10.25s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 08:08:04,691 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~a~0 4294967296))) (let ((.cse0 (< (+ 4294967295 (* (div (+ (- 2) .cse2) 4294967296) 4294967296)) .cse2)) (.cse1 (< (+ 4294967297 (* (div (+ .cse2 (- 4294967295)) 4294967296) 4294967296)) .cse2))) (and (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 12) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse2)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse2)) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 12) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse2))))) is different from false [2024-05-03 08:08:24,366 WARN L293 SmtUtils]: Spent 9.50s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 08:08:26,425 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~a~0 4294967296))) (let ((.cse0 (< (+ 4294967295 (* (div (+ (- 2) .cse2) 4294967296) 4294967296)) .cse2)) (.cse1 (< (+ 4294967297 (* (div (+ .cse2 (- 4294967295)) 4294967296) 4294967296)) .cse2))) (and (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse2)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse2))))) is different from false Received shutdown request... [2024-05-03 08:08:55,931 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 08:08:55,938 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 08:08:55,938 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 08:08:56,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-03 08:08:56,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-03 08:08:56,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-03 08:08:56,954 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-05-03 08:08:56,955 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 08:08:56,958 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-05-03 08:08:56,959 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2024-05-03 08:08:56,961 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 08:08:56,961 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 08:08:56,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 08:08:56 BasicIcfg [2024-05-03 08:08:56,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 08:08:56,963 INFO L158 Benchmark]: Toolchain (without parser) took 877428.66ms. Allocated memory was 278.9MB in the beginning and 563.1MB in the end (delta: 284.2MB). Free memory was 205.3MB in the beginning and 257.3MB in the end (delta: -52.0MB). Peak memory consumption was 232.1MB. Max. memory is 8.0GB. [2024-05-03 08:08:56,963 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 169.9MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 08:08:56,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.81ms. Allocated memory is still 278.9MB. Free memory was 205.1MB in the beginning and 193.5MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-03 08:08:56,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.25ms. Allocated memory is still 278.9MB. Free memory was 193.4MB in the beginning and 191.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 08:08:56,963 INFO L158 Benchmark]: Boogie Preprocessor took 17.84ms. Allocated memory is still 278.9MB. Free memory was 191.9MB in the beginning and 190.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 08:08:56,963 INFO L158 Benchmark]: RCFGBuilder took 298.18ms. Allocated memory is still 278.9MB. Free memory was 190.4MB in the beginning and 234.2MB in the end (delta: -43.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2024-05-03 08:08:56,964 INFO L158 Benchmark]: TraceAbstraction took 876908.40ms. Allocated memory was 278.9MB in the beginning and 563.1MB in the end (delta: 284.2MB). Free memory was 233.2MB in the beginning and 257.3MB in the end (delta: -24.1MB). Peak memory consumption was 259.5MB. Max. memory is 8.0GB. [2024-05-03 08:08:56,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2024-05-03 08:08:56,977 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 169.9MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 162.81ms. Allocated memory is still 278.9MB. Free memory was 205.1MB in the beginning and 193.5MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.25ms. Allocated memory is still 278.9MB. Free memory was 193.4MB in the beginning and 191.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.84ms. Allocated memory is still 278.9MB. Free memory was 191.9MB in the beginning and 190.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 298.18ms. Allocated memory is still 278.9MB. Free memory was 190.4MB in the beginning and 234.2MB in the end (delta: -43.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 876908.40ms. Allocated memory was 278.9MB in the beginning and 563.1MB in the end (delta: 284.2MB). Free memory was 233.2MB in the beginning and 257.3MB in the end (delta: -24.1MB). Peak memory consumption was 259.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4802, independent: 4447, independent conditional: 4447, independent unconditional: 0, dependent: 355, dependent conditional: 355, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4447, independent: 4447, independent conditional: 4447, 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: 4447, independent: 4447, independent conditional: 4447, 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: 4447, independent: 4447, independent conditional: 0, independent unconditional: 4447, 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: 4447, independent: 4447, independent conditional: 0, independent unconditional: 4447, 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: 4447, independent: 4447, independent conditional: 0, independent unconditional: 4447, 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: 259, independent: 259, independent conditional: 0, independent unconditional: 259, 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: 259, independent: 259, independent conditional: 0, independent unconditional: 259, 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: 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: 4447, independent: 4188, independent conditional: 0, independent unconditional: 4188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 259, unknown conditional: 0, unknown unconditional: 259] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 259, Positive conditional cache size: 0, Positive unconditional cache size: 259, 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: 355 - StatisticsResult: Visitor Statistics States: 521, Transitions: 619, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 521, Transitions: 571, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 226, Transitions: 243, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 364, Transitions: 388, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 152, Transitions: 157, Traversal time: 1.1s - StatisticsResult: Visitor Statistics States: 172, Transitions: 177, Traversal time: 1.5s - StatisticsResult: Visitor Statistics States: 212, Transitions: 217, Traversal time: 40.8s - StatisticsResult: Visitor Statistics States: 149, Transitions: 148, Traversal time: 811.4s - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 136 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 876.8s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 855.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: 290, 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.8s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1829 ConstructedInterpolants, 0 QuantifiedInterpolants, 14565 SizeOfPredicates, 134 NumberOfNonLiveVariables, 1254 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2094 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown