/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/DynamicStratifiedAbstractions.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-a4a1cd3-m [2024-05-30 16:04:03,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:04:03,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:04:03,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:04:03,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:04:03,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:04:03,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:04:03,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:04:03,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:04:03,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:04:03,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:04:03,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:04:03,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:04:03,813 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:04:03,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:04:03,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:04:03,813 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:04:03,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:04:03,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:04:03,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:04:03,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:04:03,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:04:03,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:04:03,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:04:03,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:04:03,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:04:03,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:04:03,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:04:03,815 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:04:03,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:04:03,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:04:03,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:04:03,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:04:03,817 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:04:03,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:04:03,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:04:03,817 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:04:03,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:04:03,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:04:03,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:04:03,818 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:04:03,818 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-30 16:04:04,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:04:04,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:04:04,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:04:04,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:04:04,077 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:04:04,079 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-30 16:04:05,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:04:05,225 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:04:05,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-05-30 16:04:05,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ceba85b00/c77b5e88e5fa4fdb82975cc8d7c50979/FLAG9019f4c5e [2024-05-30 16:04:05,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ceba85b00/c77b5e88e5fa4fdb82975cc8d7c50979 [2024-05-30 16:04:05,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:04:05,258 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:04:05,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:04:05,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:04:05,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:04:05,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad322c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05, skipping insertion in model container [2024-05-30 16:04:05,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,288 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:04:05,397 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-30 16:04:05,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:04:05,407 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:04:05,421 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-30 16:04:05,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:04:05,432 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:04:05,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05 WrapperNode [2024-05-30 16:04:05,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:04:05,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:04:05,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:04:05,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:04:05,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,463 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-05-30 16:04:05,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:04:05,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:04:05,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:04:05,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:04:05,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:04:05,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:04:05,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:04:05,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:04:05,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (1/1) ... [2024-05-30 16:04:05,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:04:05,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:04:05,521 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-30 16:04:05,541 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-30 16:04:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:04:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:04:05,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:04:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:04:05,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:04:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-30 16:04:05,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-30 16:04:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:04:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:04:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:04:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:04:05,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:04:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:04:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:04:05,566 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 16:04:05,638 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:04:05,639 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:04:05,768 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:04:05,776 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:04:05,776 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-30 16:04:05,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:04:05 BoogieIcfgContainer [2024-05-30 16:04:05,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:04:05,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:04:05,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:04:05,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:04:05,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:04:05" (1/3) ... [2024-05-30 16:04:05,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e40e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:04:05, skipping insertion in model container [2024-05-30 16:04:05,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:04:05" (2/3) ... [2024-05-30 16:04:05,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e40e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:04:05, skipping insertion in model container [2024-05-30 16:04:05,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:04:05" (3/3) ... [2024-05-30 16:04:05,813 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2024-05-30 16:04:05,833 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:04:05,841 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:04:05,841 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:04:05,841 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:04:05,944 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-30 16:04:05,974 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:04:05,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:04:05,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:04:05,977 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-30 16:04:05,987 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-30 16:04:06,030 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:04:06,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:04:06,046 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;@34fc6744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:04:06,047 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:04:06,054 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:06,239 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,240 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,240 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,274 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,275 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,275 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,298 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,299 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,299 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,324 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,324 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,324 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,335 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,335 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,335 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,346 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,347 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,347 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,367 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,367 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,367 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,377 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,377 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,377 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,394 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,394 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,395 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,395 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,395 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,395 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,406 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,406 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,406 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,422 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,422 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,422 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,434 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,435 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,435 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,469 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,470 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,470 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,499 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,499 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,499 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,523 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,523 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,524 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,532 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,532 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,532 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,543 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,550 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,550 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,570 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,570 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,570 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,599 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,600 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,600 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,600 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,600 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,600 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,619 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,619 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,619 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,631 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,631 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,631 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,641 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,641 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,642 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,653 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,653 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,654 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,671 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,671 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,671 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,678 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,678 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,678 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,699 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,699 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,699 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,713 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,713 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,713 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,726 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,727 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,727 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,772 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,773 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,773 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,773 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,774 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,774 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,781 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,781 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,781 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,790 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,791 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,791 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,804 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,804 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,804 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,811 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,811 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,811 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,823 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,823 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,824 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,831 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,831 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,831 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,841 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,841 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,842 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,851 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,851 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,851 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,857 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,857 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,857 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,872 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,872 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,872 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,872 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,872 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,872 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,878 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,878 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,878 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,883 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,883 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,883 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,888 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,888 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,888 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,895 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,895 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,895 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,903 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,903 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,903 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:06,905 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 571 states. [2024-05-30 16:04:06,905 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:04:06,908 INFO L78 Accepts]: Start accepts. Automaton has currently 677 states, but on-demand construction may add more states Word has length 76 [2024-05-30 16:04:06,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:04:06,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:04:06,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:04:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1473421353, now seen corresponding path program 1 times [2024-05-30 16:04:06,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:04:06,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782909910] [2024-05-30 16:04:06,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:06,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:04:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:07,142 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-30 16:04:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:04:07,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782909910] [2024-05-30 16:04:07,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782909910] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:04:07,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:04:07,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:04:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331695362] [2024-05-30 16:04:07,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:04:07,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:04:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:04:07,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:04:07,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:04:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:07,171 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:04:07,171 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-30 16:04:07,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:07,173 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:07,202 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,202 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,202 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,207 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,207 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,207 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,212 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,213 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,213 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,218 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,218 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,218 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,224 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,224 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,225 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,228 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,230 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,230 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,236 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,236 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,236 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,241 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,241 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,241 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,248 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,248 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,248 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,248 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,248 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,248 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,252 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,252 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,252 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,257 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,257 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,257 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,262 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,263 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,263 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,267 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,268 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,268 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,273 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,273 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,273 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,278 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,278 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,278 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,286 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,287 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,287 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,295 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,295 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,296 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,300 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,300 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,300 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,311 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,312 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,312 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,312 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,312 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,312 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,318 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,318 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,320 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,326 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,326 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,327 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,334 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,334 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,334 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,371 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,371 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,372 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,376 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,376 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,376 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,380 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,380 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,380 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,384 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,384 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,384 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,389 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,389 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,389 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,392 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,392 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,393 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,401 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,401 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,401 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,401 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,401 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,401 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,405 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,405 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,405 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,413 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,413 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,413 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,419 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,419 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,419 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,423 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,423 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,423 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,428 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,428 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,428 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,432 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,432 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,432 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,436 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,436 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,436 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,450 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,451 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,451 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,455 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,455 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,455 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,463 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,463 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,463 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,463 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,464 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,464 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,469 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,470 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,471 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,478 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,479 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,479 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,481 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,481 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,482 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,484 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,484 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,484 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,487 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,487 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,487 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:07,496 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 623 states. [2024-05-30 16:04:07,496 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:04:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:07,496 INFO L78 Accepts]: Start accepts. Automaton has currently 761 states, but on-demand construction may add more states Word has length 75 [2024-05-30 16:04:07,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:04:07,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:04:07,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:04:07,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:04:07,499 INFO L85 PathProgramCache]: Analyzing trace with hash 601748910, now seen corresponding path program 1 times [2024-05-30 16:04:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:04:07,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974968115] [2024-05-30 16:04:07,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:04:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:07,998 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-30 16:04:07,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:04:07,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974968115] [2024-05-30 16:04:07,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974968115] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:04:07,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:04:07,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-30 16:04:07,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114348402] [2024-05-30 16:04:07,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:04:08,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 16:04:08,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:04:08,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 16:04:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-30 16:04:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:08,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:04:08,006 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-30 16:04:08,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:08,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:08,007 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:08,050 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,050 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,050 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,056 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,056 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,056 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,061 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,062 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,062 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,067 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,068 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,068 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,075 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,075 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,076 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,081 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,081 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,082 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,089 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,089 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,089 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,095 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,095 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,095 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,103 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,103 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,103 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,104 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,104 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,104 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,109 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,109 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,109 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,119 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,120 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,120 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,124 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,124 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,124 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,130 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,130 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,130 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,133 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:08,134 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:08,134 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:08,151 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 306 states. [2024-05-30 16:04:08,151 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:04:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:04:08,152 INFO L78 Accepts]: Start accepts. Automaton has currently 420 states, but on-demand construction may add more states Word has length 80 [2024-05-30 16:04:08,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:04:08,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:04:08,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:04:08,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:04:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 620088758, now seen corresponding path program 1 times [2024-05-30 16:04:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:04:08,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198398371] [2024-05-30 16:04:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:04:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:08,521 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-30 16:04:08,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:04:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198398371] [2024-05-30 16:04:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198398371] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:04:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823602465] [2024-05-30 16:04:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:08,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:04:08,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:04:08,614 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-30 16:04:08,684 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-30 16:04:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:08,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-30 16:04:08,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:04:09,553 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-30 16:04:09,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:04:10,609 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-30 16:04:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823602465] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-30 16:04:10,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-30 16:04:10,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 12 [2024-05-30 16:04:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354218731] [2024-05-30 16:04:10,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:04:10,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 16:04:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:04:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 16:04:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-05-30 16:04:10,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:10,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:04:10,611 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-30 16:04:10,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:10,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:04:10,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:10,612 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:10,725 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,725 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,725 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,733 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,733 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,733 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,739 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,739 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,739 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,746 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,746 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,746 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,751 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,751 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,751 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,759 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,760 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,760 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,767 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,767 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,767 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,781 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,781 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,781 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,787 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,787 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,787 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,788 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,788 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,789 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,853 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,853 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,853 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,866 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,866 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,866 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,874 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,874 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,874 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:04:10,886 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,886 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,887 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,893 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,893 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,893 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,900 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,900 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,900 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,925 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,925 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,925 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,935 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,935 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,935 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,951 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,951 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:10,951 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,954 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,955 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,955 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,958 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,959 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,959 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,963 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:10,963 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,963 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:10,973 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 480 states. [2024-05-30 16:04:10,973 INFO L212 cStratifiedReduction]: Copied states 26 times. [2024-05-30 16:04:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:04:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:10,973 INFO L78 Accepts]: Start accepts. Automaton has currently 700 states, but on-demand construction may add more states Word has length 90 [2024-05-30 16:04:10,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:04:10,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 16:04:11,182 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-30 16:04:11,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:04:11,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:04:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash -718090985, now seen corresponding path program 1 times [2024-05-30 16:04:11,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:04:11,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131098094] [2024-05-30 16:04:11,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:11,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:04:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:11,635 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-30 16:04:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:04:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131098094] [2024-05-30 16:04:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131098094] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:04:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282311474] [2024-05-30 16:04:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:11,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:04:11,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:04:11,637 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-30 16:04:11,664 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-30 16:04:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:11,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 23 conjunts are in the unsatisfiable core [2024-05-30 16:04:11,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:04:12,169 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-30 16:04:12,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:04:12,717 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-30 16:04:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282311474] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:04:12,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:04:12,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 37 [2024-05-30 16:04:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669808316] [2024-05-30 16:04:12,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:04:12,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-30 16:04:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:04:12,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-30 16:04:12,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2024-05-30 16:04:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:12,721 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:04:12,721 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-30 16:04:12,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:12,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:04:12,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:12,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:12,721 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:13,778 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:13,778 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:13,779 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:13,781 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:13,781 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:13,781 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:13,800 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:13,800 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:13,800 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:13,804 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:13,804 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:13,804 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:13,863 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 263 states. [2024-05-30 16:04:13,863 INFO L212 cStratifiedReduction]: Copied states 8 times. [2024-05-30 16:04:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:04:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:04:13,864 INFO L78 Accepts]: Start accepts. Automaton has currently 269 states, but on-demand construction may add more states Word has length 105 [2024-05-30 16:04:13,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:04:13,881 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-30 16:04:14,069 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-30 16:04:14,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:04:14,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:04:14,070 INFO L85 PathProgramCache]: Analyzing trace with hash 669846848, now seen corresponding path program 2 times [2024-05-30 16:04:14,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:04:14,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369492360] [2024-05-30 16:04:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:04:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:14,673 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-30 16:04:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:04:14,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369492360] [2024-05-30 16:04:14,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369492360] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:04:14,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115103009] [2024-05-30 16:04:14,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:04:14,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:04:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:04:14,675 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-30 16:04:14,700 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-30 16:04:14,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:04:14,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:04:14,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2024-05-30 16:04:14,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:04:15,292 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-30 16:04:15,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:04:16,435 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-30 16:04:16,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115103009] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:04:16,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:04:16,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 51 [2024-05-30 16:04:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657371839] [2024-05-30 16:04:16,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:04:16,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-05-30 16:04:16,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:04:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-05-30 16:04:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2252, Unknown=0, NotChecked=0, Total=2550 [2024-05-30 16:04:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:16,438 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:04:16,438 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-30 16:04:16,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:16,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:04:16,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:16,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:04:16,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:16,439 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:17,861 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:17,862 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:17,862 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:17,864 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:17,864 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:17,864 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:17,880 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:17,881 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:17,881 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:17,884 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:17,884 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:17,884 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:04:17,912 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 327 states. [2024-05-30 16:04:17,912 INFO L212 cStratifiedReduction]: Copied states 8 times. [2024-05-30 16:04:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:04:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:04:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:04:17,913 INFO L78 Accepts]: Start accepts. Automaton has currently 333 states, but on-demand construction may add more states Word has length 125 [2024-05-30 16:04:17,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:04:17,919 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-30 16:04:18,114 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-30 16:04:18,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:04:18,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:04:18,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1257822016, now seen corresponding path program 3 times [2024-05-30 16:04:18,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:04:18,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568178165] [2024-05-30 16:04:18,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:04:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:19,049 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-30 16:04:19,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:04:19,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568178165] [2024-05-30 16:04:19,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568178165] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:04:19,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148331901] [2024-05-30 16:04:19,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:04:19,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:04:19,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:04:19,051 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-30 16:04:19,094 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-30 16:04:19,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-05-30 16:04:19,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:04:19,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 53 conjunts are in the unsatisfiable core [2024-05-30 16:04:19,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:04:20,275 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-30 16:04:20,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:04:22,229 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-30 16:04:22,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148331901] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:04:22,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:04:22,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 30] total 78 [2024-05-30 16:04:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736560648] [2024-05-30 16:04:22,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:04:22,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-05-30 16:04:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:04:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-05-30 16:04:22,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=5335, Unknown=0, NotChecked=0, Total=6006 [2024-05-30 16:04:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:22,232 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:04:22,232 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-30 16:04:22,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:22,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:04:22,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:22,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:04:22,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:04:22,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:22,233 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:40,596 WARN L293 SmtUtils]: Spent 12.74s 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-30 16:04:49,199 WARN L293 SmtUtils]: Spent 7.73s 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-30 16:04:55,219 WARN L293 SmtUtils]: Spent 5.30s 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-30 16:05:03,126 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:03,126 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:05:03,126 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:05:03,129 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:03,129 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:05:03,129 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:05:03,158 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:03,158 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:05:03,158 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:05:03,161 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:03,161 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:05:03,161 INFO L395 cStratifiedReduction]: Actual level: [~a~0, ~b~0, thread3Thread1of1ForFork1_~i~2, thread2Thread1of1ForFork0_~i~1] [2024-05-30 16:05:03,210 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 451 states. [2024-05-30 16:05:03,210 INFO L212 cStratifiedReduction]: Copied states 8 times. [2024-05-30 16:05:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:05:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:05:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:05:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:05:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:05:03,211 INFO L78 Accepts]: Start accepts. Automaton has currently 457 states, but on-demand construction may add more states Word has length 165 [2024-05-30 16:05:03,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:05:03,235 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-30 16:05:03,412 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-30 16:05:03,412 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:05:03,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:05:03,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1976210624, now seen corresponding path program 4 times [2024-05-30 16:05:03,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:05:03,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278944193] [2024-05-30 16:05:03,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:05:03,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:05:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:05:05,008 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-30 16:05:05,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:05:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278944193] [2024-05-30 16:05:05,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278944193] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:05:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381004636] [2024-05-30 16:05:05,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:05:05,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:05:05,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:05:05,011 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-30 16:05:05,012 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-30 16:05:05,174 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:05:05,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:05:05,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 84 conjunts are in the unsatisfiable core [2024-05-30 16:05:05,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:05:07,514 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-30 16:05:07,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:05:13,564 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-30 16:05:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381004636] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:05:13,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:05:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 46] total 128 [2024-05-30 16:05:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387189686] [2024-05-30 16:05:13,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:05:13,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-05-30 16:05:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:05:13,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-05-30 16:05:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1732, Invalid=14524, Unknown=0, NotChecked=0, Total=16256 [2024-05-30 16:05:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:13,570 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:05:13,570 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-30 16:05:13,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:13,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:05:13,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:05:13,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:05:13,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:05:13,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:05:13,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:13,571 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:06:32,641 WARN L293 SmtUtils]: Spent 36.28s 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-30 16:07:56,482 WARN L293 SmtUtils]: Spent 58.03s 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-30 16:08:00,648 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| 15) 4294967296) 4294967295) (< (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)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 14) 4294967296) 4294967295) (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-30 16:08:29,313 WARN L293 SmtUtils]: Spent 18.72s 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-30 16:12:29,466 WARN L293 SmtUtils]: Spent 3.26m 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-30 16:12:32,787 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-30 16:13:03,444 WARN L293 SmtUtils]: Spent 16.83s 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-30 16:16:44,780 WARN L293 SmtUtils]: Spent 3.08m on a formula simplification. DAG size of input: 139 DAG size of output: 140 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:16:46,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:16:48,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:16:50,733 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 (+ |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-30 16:17:10,546 WARN L293 SmtUtils]: Spent 12.78s 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) Received shutdown request... [2024-05-30 16:18:42,654 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-30 16:18:42,655 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-30 16:18:42,655 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-30 16:18:43,671 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-05-30 16:18:43,678 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-30 16:18:43,871 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-30 16:18:43,879 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 367 states. [2024-05-30 16:18:43,879 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:18:43,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 16:18:43,879 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2024-05-30 16:18:43,881 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 16:18:43,888 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-05-30 16:18:43,895 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2024-05-30 16:18:43,897 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 16:18:43,897 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 16:18:43,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 04:18:43 BasicIcfg [2024-05-30 16:18:43,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 16:18:43,899 INFO L158 Benchmark]: Toolchain (without parser) took 878641.24ms. Allocated memory was 264.2MB in the beginning and 666.9MB in the end (delta: 402.7MB). Free memory was 193.2MB in the beginning and 525.0MB in the end (delta: -331.8MB). Peak memory consumption was 71.7MB. Max. memory is 8.0GB. [2024-05-30 16:18:43,899 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 264.2MB. Free memory is still 232.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 16:18:43,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.32ms. Allocated memory is still 264.2MB. Free memory was 193.0MB in the beginning and 181.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 16:18:43,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.48ms. Allocated memory is still 264.2MB. Free memory was 181.4MB in the beginning and 179.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 16:18:43,900 INFO L158 Benchmark]: Boogie Preprocessor took 32.64ms. Allocated memory is still 264.2MB. Free memory was 179.8MB in the beginning and 178.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 16:18:43,900 INFO L158 Benchmark]: RCFGBuilder took 279.90ms. Allocated memory is still 264.2MB. Free memory was 178.3MB in the beginning and 163.9MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-30 16:18:43,900 INFO L158 Benchmark]: TraceAbstraction took 878120.25ms. Allocated memory was 264.2MB in the beginning and 666.9MB in the end (delta: 402.7MB). Free memory was 162.8MB in the beginning and 525.0MB in the end (delta: -362.2MB). Peak memory consumption was 41.2MB. Max. memory is 8.0GB. [2024-05-30 16:18:43,901 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2024-05-30 16:18:43,902 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 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 264.2MB. Free memory is still 232.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.32ms. Allocated memory is still 264.2MB. Free memory was 193.0MB in the beginning and 181.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.48ms. Allocated memory is still 264.2MB. Free memory was 181.4MB in the beginning and 179.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.64ms. Allocated memory is still 264.2MB. Free memory was 179.8MB in the beginning and 178.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 279.90ms. Allocated memory is still 264.2MB. Free memory was 178.3MB in the beginning and 163.9MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 878120.25ms. Allocated memory was 264.2MB in the beginning and 666.9MB in the end (delta: 402.7MB). Free memory was 162.8MB in the beginning and 525.0MB in the end (delta: -362.2MB). Peak memory consumption was 41.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3254, independent: 2959, independent conditional: 2959, independent unconditional: 0, dependent: 295, dependent conditional: 295, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2959, independent: 2959, independent conditional: 2959, 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: 2959, independent: 2959, independent conditional: 2959, 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: 2959, independent: 2959, independent conditional: 0, independent unconditional: 2959, 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: 2959, independent: 2959, independent conditional: 0, independent unconditional: 2959, 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: 2959, independent: 2959, independent conditional: 0, independent unconditional: 2959, 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: 2959, independent: 2959, independent conditional: 0, independent unconditional: 2959, 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: 2959, independent: 2959, independent conditional: 0, independent unconditional: 2959, 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: 2959, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2959, unknown conditional: 0, unknown unconditional: 2959] , Statistics on independence cache: Total cache size (in pairs): 2959, Positive cache size: 2959, Positive conditional cache size: 0, Positive unconditional cache size: 2959, 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: 295 - StatisticsResult: Reduction benchmarks 32.9ms Time before loop, 817.5ms Time in loop, 0.9s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 51, Reduction States: 571, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 16.8ms Time before loop, 306.2ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 51, Reduction States: 623, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 32.7ms Time before loop, 111.3ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 18, Reduction States: 306, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 24.1ms Time before loop, 336.6ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 25, Reduction States: 480, Duplicate States: 26, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 444.2ms Time before loop, 697.3ms Time in loop, 1.1s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 7, Reduction States: 263, Duplicate States: 8, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 1296.9ms Time before loop, 176.6ms Time in loop, 1.5s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 7, Reduction States: 327, Duplicate States: 8, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 40638.4ms Time before loop, 338.4ms Time in loop, 41.0s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 7, Reduction States: 451, Duplicate States: 8, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 810308.1ms Time before loop, 0.0ms Time in loop, 810.3s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 367, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 521, Transitions: 619, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 521, Transitions: 620, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 226, Transitions: 259, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 390, Transitions: 464, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 160, Transitions: 174, Traversal time: 1.1s - StatisticsResult: Visitor Statistics States: 180, Transitions: 194, Traversal time: 1.5s - StatisticsResult: Visitor Statistics States: 220, Transitions: 234, Traversal time: 41.0s - StatisticsResult: Visitor Statistics States: 138, Transitions: 138, Traversal time: 810.3s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 21, RedundantProofs: 7, ProvenStates: 138, Times there's more than one choice: 85, Avg number of choices: 2.463768115942029 - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,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: 877.9s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 855.6s, 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: 287, 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, 20.0s 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