/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/pthread/bigshot_s2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-02 23:30:10,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-02 23:30:11,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-02 23:30:11,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-02 23:30:11,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-02 23:30:11,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-02 23:30:11,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-02 23:30:11,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-02 23:30:11,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-02 23:30:11,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-02 23:30:11,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-02 23:30:11,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-02 23:30:11,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-02 23:30:11,049 INFO L153 SettingsManager]: * Use SBE=true [2024-05-02 23:30:11,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-02 23:30:11,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-02 23:30:11,049 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-02 23:30:11,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-02 23:30:11,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-02 23:30:11,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-02 23:30:11,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-02 23:30:11,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-02 23:30:11,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-02 23:30:11,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-02 23:30:11,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-02 23:30:11,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-02 23:30:11,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-02 23:30:11,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-02 23:30:11,052 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-02 23:30:11,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-02 23:30:11,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-02 23:30:11,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-02 23:30:11,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-02 23:30:11,054 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-02 23:30:11,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-02 23:30:11,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-02 23:30:11,054 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-02 23:30:11,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-02 23:30:11,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-02 23:30:11,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-02 23:30:11,055 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-02 23:30:11,055 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-02 23:30:11,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-02 23:30:11,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-02 23:30:11,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-02 23:30:11,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-02 23:30:11,312 INFO L274 PluginConnector]: CDTParser initialized [2024-05-02 23:30:11,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2024-05-02 23:30:12,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-02 23:30:12,559 INFO L384 CDTParser]: Found 1 translation units. [2024-05-02 23:30:12,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2024-05-02 23:30:12,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e19111815/1102a56fe56d4a93b26c2cfda43bbc9a/FLAGf4e2bf1be [2024-05-02 23:30:12,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e19111815/1102a56fe56d4a93b26c2cfda43bbc9a [2024-05-02 23:30:12,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-02 23:30:12,597 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-02 23:30:12,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-02 23:30:12,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-02 23:30:12,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-02 23:30:12,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:30:12" (1/1) ... [2024-05-02 23:30:12,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ff34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:12, skipping insertion in model container [2024-05-02 23:30:12,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:30:12" (1/1) ... [2024-05-02 23:30:12,649 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-02 23:30:13,050 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i[55203,55216] [2024-05-02 23:30:13,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-02 23:30:13,074 INFO L202 MainTranslator]: Completed pre-run [2024-05-02 23:30:13,102 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i[55203,55216] [2024-05-02 23:30:13,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-02 23:30:13,145 INFO L206 MainTranslator]: Completed translation [2024-05-02 23:30:13,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13 WrapperNode [2024-05-02 23:30:13,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-02 23:30:13,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-02 23:30:13,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-02 23:30:13,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-02 23:30:13,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,179 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-05-02 23:30:13,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-02 23:30:13,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-02 23:30:13,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-02 23:30:13,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-02 23:30:13,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-02 23:30:13,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-02 23:30:13,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-02 23:30:13,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-02 23:30:13,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (1/1) ... [2024-05-02 23:30:13,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-02 23:30:13,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-02 23:30:13,245 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-02 23:30:13,250 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-02 23:30:13,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-02 23:30:13,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-02 23:30:13,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-05-02 23:30:13,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-02 23:30:13,280 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-02 23:30:13,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-02 23:30:13,280 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-02 23:30:13,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-02 23:30:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-02 23:30:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-02 23:30:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-02 23:30:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-02 23:30:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-02 23:30:13,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-02 23:30:13,282 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-02 23:30:13,370 INFO L241 CfgBuilder]: Building ICFG [2024-05-02 23:30:13,372 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-02 23:30:13,543 INFO L282 CfgBuilder]: Performing block encoding [2024-05-02 23:30:13,550 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-02 23:30:13,551 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2024-05-02 23:30:13,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:30:13 BoogieIcfgContainer [2024-05-02 23:30:13,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-02 23:30:13,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-02 23:30:13,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-02 23:30:13,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-02 23:30:13,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:30:12" (1/3) ... [2024-05-02 23:30:13,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aeced37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:30:13, skipping insertion in model container [2024-05-02 23:30:13,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:13" (2/3) ... [2024-05-02 23:30:13,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aeced37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:30:13, skipping insertion in model container [2024-05-02 23:30:13,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:30:13" (3/3) ... [2024-05-02 23:30:13,557 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2024-05-02 23:30:13,565 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-02 23:30:13,574 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-02 23:30:13,574 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-02 23:30:13,575 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-02 23:30:13,650 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-02 23:30:13,687 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-02 23:30:13,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-02 23:30:13,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-02 23:30:13,690 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-02 23:30:13,736 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-02 23:30:13,739 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-02 23:30:13,746 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-02 23:30:13,752 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;@25084bad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-02 23:30:13,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-02 23:30:13,758 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-02 23:30:13,783 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 70 states. [2024-05-02 23:30:13,784 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-02 23:30:13,786 INFO L78 Accepts]: Start accepts. Automaton has currently 72 states, but on-demand construction may add more states Word has length 63 [2024-05-02 23:30:13,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-02 23:30:13,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-02 23:30:13,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-02 23:30:13,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1854845509, now seen corresponding path program 1 times [2024-05-02 23:30:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-02 23:30:13,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527294750] [2024-05-02 23:30:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-02 23:30:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-02 23:30:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-02 23:30:14,086 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-02 23:30:14,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-02 23:30:14,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527294750] [2024-05-02 23:30:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527294750] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-02 23:30:14,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-02 23:30:14,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-02 23:30:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872906703] [2024-05-02 23:30:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-02 23:30:14,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-02 23:30:14,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-02 23:30:14,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-02 23:30:14,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-02 23:30:14,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:14,113 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-02 23:30:14,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-02 23:30:14,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:14,115 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-02 23:30:14,168 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 73 states. [2024-05-02 23:30:14,169 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-02 23:30:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:14,169 INFO L78 Accepts]: Start accepts. Automaton has currently 74 states, but on-demand construction may add more states Word has length 65 [2024-05-02 23:30:14,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-02 23:30:14,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-02 23:30:14,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-02 23:30:14,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-02 23:30:14,172 INFO L85 PathProgramCache]: Analyzing trace with hash -291690424, now seen corresponding path program 1 times [2024-05-02 23:30:14,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-02 23:30:14,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114228478] [2024-05-02 23:30:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-02 23:30:14,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-02 23:30:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-02 23:30:14,670 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-02 23:30:14,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-02 23:30:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114228478] [2024-05-02 23:30:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114228478] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-02 23:30:14,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-02 23:30:14,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-02 23:30:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683783277] [2024-05-02 23:30:14,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-02 23:30:14,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-02 23:30:14,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-02 23:30:14,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-02 23:30:14,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-05-02 23:30:14,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:14,677 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-02 23:30:14,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-02 23:30:14,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:14,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:14,678 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-02 23:30:14,890 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 79 states. [2024-05-02 23:30:14,890 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-02 23:30:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:30:14,891 INFO L78 Accepts]: Start accepts. Automaton has currently 80 states, but on-demand construction may add more states Word has length 69 [2024-05-02 23:30:14,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-02 23:30:14,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-02 23:30:14,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-02 23:30:14,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-02 23:30:14,893 INFO L85 PathProgramCache]: Analyzing trace with hash 813431460, now seen corresponding path program 1 times [2024-05-02 23:30:14,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-02 23:30:14,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500528296] [2024-05-02 23:30:14,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-02 23:30:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-02 23:30:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-02 23:30:15,355 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-02 23:30:15,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-02 23:30:15,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500528296] [2024-05-02 23:30:15,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500528296] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-02 23:30:15,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043946957] [2024-05-02 23:30:15,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-02 23:30:15,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-02 23:30:15,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-02 23:30:15,402 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-02 23:30:15,429 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-02 23:30:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-02 23:30:15,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 43 conjunts are in the unsatisfiable core [2024-05-02 23:30:15,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-02 23:30:15,567 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-02 23:30:15,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-02 23:30:15,593 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-02 23:30:15,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-05-02 23:30:15,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:15,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:15,905 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-05-02 23:30:15,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-05-02 23:30:16,007 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-02 23:30:16,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-05-02 23:30:16,146 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-02 23:30:16,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-02 23:30:16,874 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-02 23:30:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043946957] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-02 23:30:16,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-02 23:30:16,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 43 [2024-05-02 23:30:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760628050] [2024-05-02 23:30:16,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-02 23:30:16,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-05-02 23:30:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-02 23:30:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-05-02 23:30:16,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1653, Unknown=0, NotChecked=0, Total=1806 [2024-05-02 23:30:16,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:16,877 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-02 23:30:16,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.27906976744186) internal successors, (184), 43 states have internal predecessors, (184), 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-02 23:30:16,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:16,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:30:16,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:16,878 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-02 23:30:18,008 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 109 states. [2024-05-02 23:30:18,008 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-02 23:30:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:30:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-02 23:30:18,009 INFO L78 Accepts]: Start accepts. Automaton has currently 110 states, but on-demand construction may add more states Word has length 81 [2024-05-02 23:30:18,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-02 23:30:18,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-02 23:30:18,210 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-02 23:30:18,210 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-02 23:30:18,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-02 23:30:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1853955512, now seen corresponding path program 2 times [2024-05-02 23:30:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-02 23:30:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129622054] [2024-05-02 23:30:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-02 23:30:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-02 23:30:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-02 23:30:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-02 23:30:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-02 23:30:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129622054] [2024-05-02 23:30:18,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129622054] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-02 23:30:18,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307119651] [2024-05-02 23:30:18,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-02 23:30:18,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-02 23:30:18,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-02 23:30:18,784 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-02 23:30:18,820 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-02 23:30:18,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-02 23:30:18,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-02 23:30:18,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjunts are in the unsatisfiable core [2024-05-02 23:30:18,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-02 23:30:18,923 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-02 23:30:18,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-02 23:30:18,958 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-02 23:30:18,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-02 23:30:19,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:19,071 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-02 23:30:19,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-05-02 23:30:19,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:19,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:19,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:19,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:19,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:19,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-02 23:30:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-02 23:30:19,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-02 23:30:19,598 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_105 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_105) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2024-05-02 23:30:19,603 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_105 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_105) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2024-05-02 23:30:19,651 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_105 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_105) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2024-05-02 23:30:20,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 485 treesize of output 465 [2024-05-02 23:30:20,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2024-05-02 23:30:20,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-05-02 23:30:20,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-05-02 23:30:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2024-05-02 23:30:20,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307119651] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-02 23:30:20,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-02 23:30:20,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 48 [2024-05-02 23:30:20,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636933095] [2024-05-02 23:30:20,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-02 23:30:20,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-05-02 23:30:20,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-02 23:30:20,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-05-02 23:30:20,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1800, Unknown=13, NotChecked=264, Total=2256 [2024-05-02 23:30:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:20,634 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-02 23:30:20,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.125) internal successors, (198), 48 states have internal predecessors, (198), 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-02 23:30:20,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:20,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:30:20,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-02 23:30:20,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:20,634 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-02 23:30:21,497 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 114 states. [2024-05-02 23:30:21,497 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-02 23:30:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:30:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-02 23:30:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-02 23:30:21,498 INFO L78 Accepts]: Start accepts. Automaton has currently 115 states, but on-demand construction may add more states Word has length 85 [2024-05-02 23:30:21,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-02 23:30:21,516 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-02 23:30:21,699 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-02 23:30:21,699 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-02 23:30:21,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-02 23:30:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1987594220, now seen corresponding path program 3 times [2024-05-02 23:30:21,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-02 23:30:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645236099] [2024-05-02 23:30:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-02 23:30:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-02 23:30:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-02 23:30:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-02 23:30:22,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-02 23:30:22,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645236099] [2024-05-02 23:30:22,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645236099] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-02 23:30:22,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002904436] [2024-05-02 23:30:22,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-02 23:30:22,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-02 23:30:22,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-02 23:30:22,249 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-02 23:30:22,250 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-02 23:30:22,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-02 23:30:22,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-02 23:30:22,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 50 conjunts are in the unsatisfiable core [2024-05-02 23:30:22,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-02 23:30:22,520 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-05-02 23:30:22,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-05-02 23:30:22,610 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-05-02 23:30:22,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-05-02 23:30:22,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:22,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-02 23:30:22,895 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-05-02 23:30:22,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2024-05-02 23:30:23,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:23,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:23,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:23,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:23,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:23,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:23,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-02 23:30:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-02 23:30:23,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-02 23:30:23,604 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_158) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2024-05-02 23:30:24,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 229 [2024-05-02 23:30:24,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-05-02 23:30:24,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2024-05-02 23:30:24,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 86 [2024-05-02 23:30:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2024-05-02 23:30:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002904436] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-02 23:30:24,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-02 23:30:24,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 19] total 53 [2024-05-02 23:30:24,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788455510] [2024-05-02 23:30:24,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-02 23:30:24,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-05-02 23:30:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-02 23:30:24,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-05-02 23:30:24,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2401, Unknown=41, NotChecked=100, Total=2756 [2024-05-02 23:30:24,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:24,868 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-02 23:30:24,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.150943396226415) internal successors, (220), 53 states have internal predecessors, (220), 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-02 23:30:24,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:24,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:30:24,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-02 23:30:24,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-02 23:30:24,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:24,868 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-02 23:30:26,134 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 119 states. [2024-05-02 23:30:26,134 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-02 23:30:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:30:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:30:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-02 23:30:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-02 23:30:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-02 23:30:26,137 INFO L78 Accepts]: Start accepts. Automaton has currently 120 states, but on-demand construction may add more states Word has length 89 [2024-05-02 23:30:26,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-02 23:30:26,146 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-02 23:30:26,338 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-02 23:30:26,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-02 23:30:26,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-02 23:30:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash 818005104, now seen corresponding path program 4 times [2024-05-02 23:30:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-02 23:30:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51204433] [2024-05-02 23:30:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-02 23:30:26,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-02 23:30:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-02 23:30:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-02 23:30:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-02 23:30:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51204433] [2024-05-02 23:30:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51204433] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-02 23:30:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810892424] [2024-05-02 23:30:26,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-02 23:30:26,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-02 23:30:26,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-02 23:30:26,988 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-02 23:30:27,016 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-02 23:30:27,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-02 23:30:27,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-02 23:30:27,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 58 conjunts are in the unsatisfiable core [2024-05-02 23:30:27,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-02 23:30:27,150 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-02 23:30:27,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-02 23:30:27,181 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-02 23:30:27,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-05-02 23:30:27,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:27,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-02 23:30:27,457 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-05-02 23:30:27,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-05-02 23:30:27,559 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-02 23:30:27,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-05-02 23:30:27,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-02 23:30:27,617 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-02 23:30:27,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-05-02 23:30:27,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-02 23:30:27,682 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-02 23:30:27,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-05-02 23:30:27,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-02 23:30:27,778 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-02 23:30:27,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-05-02 23:30:27,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-02 23:30:27,853 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-02 23:30:27,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-05-02 23:30:27,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-02 23:30:27,919 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-02 23:30:27,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-05-02 23:30:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 32 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-02 23:30:28,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-02 23:32:20,301 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_60| Int)) (or (forall ((v_ArrVal_214 Int) (v_ArrVal_223 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_57| Int) (v_ArrVal_220 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_56| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_59| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_58| Int) (v_ArrVal_218 Int) (v_ArrVal_216 Int)) (or (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| (store (store (store (store (store (select |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_60| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_214) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_59| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_216) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_58| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_218) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_57| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_220) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_56| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_223)) c_~v~0.base) c_~v~0.offset) 66) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_57| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_58| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_59| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_60| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_58| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_59| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_56| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_57| 1)))) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_60| (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 1)))) is different from false [2024-05-02 23:35:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 24 proven. 17 refuted. 26 times theorem prover too weak. 0 trivial. 11 not checked. [2024-05-02 23:35:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810892424] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-02 23:35:35,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-02 23:35:35,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 27] total 62 [2024-05-02 23:35:35,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208524618] [2024-05-02 23:35:35,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-02 23:35:35,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-05-02 23:35:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-02 23:35:35,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-05-02 23:35:35,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3224, Unknown=123, NotChecked=118, Total=3782 [2024-05-02 23:35:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:35:35,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-02 23:35:35,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 3.935483870967742) internal successors, (244), 62 states have internal predecessors, (244), 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-02 23:35:35,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:35:35,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:35:35,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-02 23:35:35,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-02 23:35:35,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-02 23:35:35,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:35:35,183 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-02 23:35:37,914 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-02 23:35:37,914 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start___VERIFIER_assert_~expression#1, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset, thread1Thread1of1ForFork1_#t~malloc3.offset, ~v~0.offset, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset, ~v~0.base, thread1Thread1of1ForFork1_#t~malloc3.base, #valid, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base, #StackHeapBarrier, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1, #memory_int, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1] [2024-05-02 23:35:37,914 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start___VERIFIER_assert_~expression#1, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset, thread1Thread1of1ForFork1_#t~malloc3.offset, ~v~0.offset, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset, ~v~0.base, thread1Thread1of1ForFork1_#t~malloc3.base, #valid, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base, #StackHeapBarrier, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1, #memory_int, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1] [2024-05-02 23:35:37,928 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 134 states. [2024-05-02 23:35:37,928 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-02 23:35:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:35:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:35:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-02 23:35:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-02 23:35:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-02 23:35:37,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-02 23:35:37,935 INFO L78 Accepts]: Start accepts. Automaton has currently 135 states, but on-demand construction may add more states Word has length 54 [2024-05-02 23:35:37,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-02 23:35:37,941 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-02 23:35:38,141 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-02 23:35:38,141 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-02 23:35:38,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-02 23:35:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1762399208, now seen corresponding path program 1 times [2024-05-02 23:35:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-02 23:35:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997443932] [2024-05-02 23:35:38,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-02 23:35:38,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-02 23:35:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-02 23:35:38,174 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-02 23:35:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-02 23:35:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997443932] [2024-05-02 23:35:38,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997443932] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-02 23:35:38,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-02 23:35:38,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-02 23:35:38,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184799276] [2024-05-02 23:35:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-02 23:35:38,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-02 23:35:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-02 23:35:38,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-02 23:35:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-02 23:35:38,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:35:38,178 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-02 23:35:38,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-02 23:35:38,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:35:38,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:35:38,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-02 23:35:38,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-02 23:35:38,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-02 23:35:38,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-02 23:35:38,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:35:38,179 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-02 23:35:38,200 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-02 23:35:38,200 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start___VERIFIER_assert_~expression#1, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset, thread1Thread1of1ForFork1_#t~malloc3.offset, ~v~0.offset, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset, ~v~0.base, thread1Thread1of1ForFork1_#t~malloc3.base, #valid, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base, #StackHeapBarrier, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1, #memory_int, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1] [2024-05-02 23:35:38,200 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start___VERIFIER_assert_~expression#1, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset, thread1Thread1of1ForFork1_#t~malloc3.offset, ~v~0.offset, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset, ~v~0.base, thread1Thread1of1ForFork1_#t~malloc3.base, #valid, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base, #StackHeapBarrier, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1, #memory_int, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1] [2024-05-02 23:35:38,582 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-02 23:35:38,583 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start___VERIFIER_assert_~expression#1, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset, thread1Thread1of1ForFork1_#t~malloc3.offset, ~v~0.offset, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset, ~v~0.base, thread1Thread1of1ForFork1_#t~malloc3.base, #valid, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base, #StackHeapBarrier, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1, #memory_int, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1] [2024-05-02 23:35:38,583 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start___VERIFIER_assert_~expression#1, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset, thread1Thread1of1ForFork1_#t~malloc3.offset, ~v~0.offset, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset, ~v~0.base, thread1Thread1of1ForFork1_#t~malloc3.base, #valid, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base, #StackHeapBarrier, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1, #memory_int, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1] [2024-05-02 23:35:38,607 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-02 23:35:38,607 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start___VERIFIER_assert_~expression#1, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset, thread1Thread1of1ForFork1_#t~malloc3.offset, ~v~0.offset, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset, ~v~0.base, thread1Thread1of1ForFork1_#t~malloc3.base, #valid, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base, #StackHeapBarrier, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1, #memory_int, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1] [2024-05-02 23:35:38,607 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start___VERIFIER_assert_~expression#1, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset, thread1Thread1of1ForFork1_#t~malloc3.offset, ~v~0.offset, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset, ~v~0.base, thread1Thread1of1ForFork1_#t~malloc3.base, #valid, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base, #StackHeapBarrier, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1, #memory_int, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1] [2024-05-02 23:35:38,636 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-02 23:35:38,637 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start___VERIFIER_assert_~expression#1, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset, thread1Thread1of1ForFork1_#t~malloc3.offset, ~v~0.offset, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset, ~v~0.base, thread1Thread1of1ForFork1_#t~malloc3.base, #valid, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base, #StackHeapBarrier, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1, #memory_int, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1] [2024-05-02 23:35:38,637 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start___VERIFIER_assert_~expression#1, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset, thread1Thread1of1ForFork1_#t~malloc3.offset, ~v~0.offset, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset, ~v~0.base, thread1Thread1of1ForFork1_#t~malloc3.base, #valid, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base, #StackHeapBarrier, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1, #memory_int, thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1] [2024-05-02 23:35:38,716 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 322 states. [2024-05-02 23:35:38,717 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-02 23:35:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-02 23:35:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-02 23:35:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-02 23:35:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-02 23:35:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-02 23:35:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-02 23:35:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-02 23:35:38,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-02 23:35:38,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-02 23:35:38,725 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-05-02 23:35:38,726 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/3) [2024-05-02 23:35:38,730 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-02 23:35:38,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-02 23:35:38,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-02 23:35:38,745 INFO L229 MonitoredProcess]: Starting monitored process 7 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-02 23:35:38,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-05-02 23:35:38,775 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-02 23:35:38,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-02 23:35:38,775 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;@25084bad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-02 23:35:38,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-02 23:35:38,776 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-02 23:35:38,798 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 56 states. [2024-05-02 23:35:38,798 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-02 23:35:38,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-02 23:35:38,800 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-02 23:35:38,800 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2024-05-02 23:35:38,803 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-02 23:35:38,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-02 23:35:38,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-02 23:35:38,818 INFO L229 MonitoredProcess]: Starting monitored process 8 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-02 23:35:38,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-05-02 23:35:38,834 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-02 23:35:38,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-02 23:35:38,835 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;@25084bad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-02 23:35:38,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-02 23:35:38,835 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-02 23:35:38,836 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 23 states. [2024-05-02 23:35:38,836 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-02 23:35:38,836 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-02 23:35:38,837 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-02 23:35:38,837 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/3) [2024-05-02 23:35:38,838 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-02 23:35:38,838 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-02 23:35:38,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:35:38 BasicIcfg [2024-05-02 23:35:38,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-02 23:35:38,841 INFO L158 Benchmark]: Toolchain (without parser) took 326243.83ms. Allocated memory was 167.8MB in the beginning and 552.6MB in the end (delta: 384.8MB). Free memory was 99.2MB in the beginning and 354.0MB in the end (delta: -254.8MB). Peak memory consumption was 129.3MB. Max. memory is 8.0GB. [2024-05-02 23:35:38,841 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-02 23:35:38,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.38ms. Allocated memory was 167.8MB in the beginning and 219.2MB in the end (delta: 51.4MB). Free memory was 99.1MB in the beginning and 166.0MB in the end (delta: -67.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-02 23:35:38,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.54ms. Allocated memory is still 219.2MB. Free memory was 166.0MB in the beginning and 163.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-02 23:35:38,842 INFO L158 Benchmark]: Boogie Preprocessor took 17.59ms. Allocated memory is still 219.2MB. Free memory was 163.9MB in the beginning and 162.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-02 23:35:38,842 INFO L158 Benchmark]: RCFGBuilder took 352.89ms. Allocated memory is still 219.2MB. Free memory was 162.3MB in the beginning and 147.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-02 23:35:38,842 INFO L158 Benchmark]: TraceAbstraction took 325287.79ms. Allocated memory was 219.2MB in the beginning and 552.6MB in the end (delta: 333.4MB). Free memory was 146.6MB in the beginning and 354.0MB in the end (delta: -207.4MB). Peak memory consumption was 125.5MB. Max. memory is 8.0GB. [2024-05-02 23:35:38,843 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 546.38ms. Allocated memory was 167.8MB in the beginning and 219.2MB in the end (delta: 51.4MB). Free memory was 99.1MB in the beginning and 166.0MB in the end (delta: -67.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.54ms. Allocated memory is still 219.2MB. Free memory was 166.0MB in the beginning and 163.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.59ms. Allocated memory is still 219.2MB. Free memory was 163.9MB in the beginning and 162.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 352.89ms. Allocated memory is still 219.2MB. Free memory was 162.3MB in the beginning and 147.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 325287.79ms. Allocated memory was 219.2MB in the beginning and 552.6MB in the end (delta: 333.4MB). Free memory was 146.6MB in the beginning and 354.0MB in the end (delta: -207.4MB). Peak memory consumption was 125.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 301, independent: 183, independent conditional: 183, independent unconditional: 0, dependent: 118, dependent conditional: 118, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 183, independent conditional: 183, 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: 183, independent: 183, independent conditional: 183, 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: 183, independent: 183, independent conditional: 0, independent unconditional: 183, 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: 183, independent: 183, independent conditional: 0, independent unconditional: 183, 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: 183, independent: 183, independent conditional: 0, independent unconditional: 183, 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: 183, independent: 183, independent conditional: 0, independent unconditional: 183, 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: 183, independent: 183, independent conditional: 0, independent unconditional: 183, 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: 183, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, 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: 118 - StatisticsResult: Reduction benchmarks 24.6ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 70, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 53.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 73, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 211.5ms Time before loop, 0.0ms Time in loop, 0.2s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 79, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 1130.1ms Time before loop, 0.0ms Time in loop, 1.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 109, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 862.2ms Time before loop, 0.0ms Time in loop, 0.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 114, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 1265.0ms Time before loop, 0.0ms Time in loop, 1.3s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 119, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 2730.8ms Time before loop, 13.9ms Time in loop, 2.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 134, Duplicate States: 0, Protected Variables: 18 - StatisticsResult: Reduction benchmarks 20.9ms Time before loop, 517.0ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 322, Duplicate States: 0, Protected Variables: 18 - StatisticsResult: Visitor Statistics States: 64, Transitions: 63, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 66, Transitions: 66, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 70, Transitions: 72, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 98, Transitions: 106, Traversal time: 1.1s - StatisticsResult: Visitor Statistics States: 102, Transitions: 112, Traversal time: 0.9s - StatisticsResult: Visitor Statistics States: 106, Transitions: 118, Traversal time: 1.3s - StatisticsResult: Visitor Statistics States: 121, Transitions: 138, Traversal time: 2.7s - StatisticsResult: Visitor Statistics States: 293, Transitions: 362, Traversal time: 0.5s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 8, RedundantProofs: 1, ProvenStates: 112, Times there's more than one choice: 75, Avg number of choices: 3.982142857142857 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, 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: 0 - StatisticsResult: Reduction benchmarks 22.6ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 56, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 57, Transitions: 56, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Reduction benchmarks 1.2ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 23, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 24, Transitions: 23, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - PositiveResult [Line: 1107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 108 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 325.0s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 6.9s, 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: 106, 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.3s SatisfiabilityAnalysisTime, 316.5s InterpolantComputationTime, 830 NumberOfCodeBlocks, 830 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1139 ConstructedInterpolants, 191 QuantifiedInterpolants, 17820 SizeOfPredicates, 57 NumberOfNonLiveVariables, 932 ConjunctsInSsa, 191 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 56/516 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 108 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 108 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-02 23:35:38,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2024-05-02 23:35:39,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2024-05-02 23:35:39,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-02 23:35:39,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...