/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 00:46:18,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 00:46:18,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 00:46:18,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 00:46:18,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 00:46:18,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 00:46:18,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 00:46:18,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 00:46:18,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 00:46:18,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 00:46:18,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 00:46:18,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 00:46:18,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 00:46:18,468 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 00:46:18,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 00:46:18,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 00:46:18,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 00:46:18,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 00:46:18,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 00:46:18,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 00:46:18,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 00:46:18,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 00:46:18,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 00:46:18,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 00:46:18,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 00:46:18,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 00:46:18,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 00:46:18,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 00:46:18,472 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 00:46:18,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 00:46:18,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:46:18,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 00:46:18,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 00:46:18,473 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 00:46:18,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 00:46:18,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 00:46:18,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 00:46:18,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 00:46:18,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 00:46:18,474 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 00:46:18,474 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 00:46:18,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-01-26 00:46:18,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 00:46:18,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 00:46:18,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 00:46:18,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 00:46:18,666 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 00:46:18,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-01-26 00:46:19,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 00:46:19,945 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 00:46:19,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-01-26 00:46:19,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fa5ef219f/ef09f01c1df1407195a52b1b5c324868/FLAG5f6084817 [2024-01-26 00:46:20,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fa5ef219f/ef09f01c1df1407195a52b1b5c324868 [2024-01-26 00:46:20,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 00:46:20,361 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 00:46:20,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 00:46:20,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 00:46:20,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 00:46:20,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244527a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20, skipping insertion in model container [2024-01-26 00:46:20,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,385 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 00:46:20,515 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2155,2168] [2024-01-26 00:46:20,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:46:20,526 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 00:46:20,543 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2155,2168] [2024-01-26 00:46:20,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:46:20,555 INFO L206 MainTranslator]: Completed translation [2024-01-26 00:46:20,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20 WrapperNode [2024-01-26 00:46:20,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 00:46:20,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 00:46:20,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 00:46:20,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 00:46:20,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,583 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-01-26 00:46:20,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 00:46:20,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 00:46:20,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 00:46:20,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 00:46:20,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 00:46:20,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 00:46:20,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 00:46:20,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 00:46:20,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (1/1) ... [2024-01-26 00:46:20,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:46:20,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:46:20,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-01-26 00:46:20,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-01-26 00:46:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 00:46:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 00:46:20,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 00:46:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 00:46:20,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 00:46:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 00:46:20,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 00:46:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 00:46:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 00:46:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 00:46:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 00:46:20,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 00:46:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 00:46:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 00:46:20,690 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 00:46:20,768 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 00:46:20,770 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 00:46:20,933 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 00:46:20,946 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 00:46:20,946 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-26 00:46:20,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:46:20 BoogieIcfgContainer [2024-01-26 00:46:20,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 00:46:20,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 00:46:20,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 00:46:20,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 00:46:20,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 12:46:20" (1/3) ... [2024-01-26 00:46:20,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81c285f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:46:20, skipping insertion in model container [2024-01-26 00:46:20,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:46:20" (2/3) ... [2024-01-26 00:46:20,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81c285f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:46:20, skipping insertion in model container [2024-01-26 00:46:20,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:46:20" (3/3) ... [2024-01-26 00:46:20,958 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2024-01-26 00:46:20,965 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 00:46:20,973 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 00:46:20,974 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 00:46:20,974 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 00:46:21,050 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-26 00:46:21,079 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:46:21,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 00:46:21,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:46:21,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-01-26 00:46:21,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-01-26 00:46:21,115 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 00:46:21,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 00:46:21,125 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;@5d310b4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:46:21,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:46:21,537 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:46:21,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:46:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash 969556616, now seen corresponding path program 1 times [2024-01-26 00:46:21,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:46:21,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315246664] [2024-01-26 00:46:21,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:46:21,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:46:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:46:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 00:46:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:46:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315246664] [2024-01-26 00:46:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315246664] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:46:21,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:46:21,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 00:46:21,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024665351] [2024-01-26 00:46:21,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:46:21,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 00:46:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:46:21,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 00:46:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 00:46:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:21,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:46:21,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:46:21,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:46:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:21,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 00:46:21,937 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:46:21,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:46:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1970969397, now seen corresponding path program 1 times [2024-01-26 00:46:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:46:21,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394454203] [2024-01-26 00:46:21,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:46:21,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:46:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:46:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:22,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:46:22,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394454203] [2024-01-26 00:46:22,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394454203] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 00:46:22,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602385114] [2024-01-26 00:46:22,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:46:22,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:46:22,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:46:22,462 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-01-26 00:46:22,467 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-01-26 00:46:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:46:22,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-26 00:46:22,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:46:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:23,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:46:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:24,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602385114] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 00:46:24,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-26 00:46:24,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 12 [2024-01-26 00:46:24,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243983871] [2024-01-26 00:46:24,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:46:24,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 00:46:24,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:46:24,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 00:46:24,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-01-26 00:46:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:24,512 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:46:24,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:46:24,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:24,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:46:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 00:46:24,691 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-01-26 00:46:24,876 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,SelfDestructingSolverStorable1 [2024-01-26 00:46:24,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:46:24,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:46:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash 406381376, now seen corresponding path program 1 times [2024-01-26 00:46:24,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:46:24,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239203733] [2024-01-26 00:46:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:46:24,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:46:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:46:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:25,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:46:25,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239203733] [2024-01-26 00:46:25,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239203733] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 00:46:25,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272418594] [2024-01-26 00:46:25,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:46:25,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:46:25,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:46:25,496 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-01-26 00:46:25,519 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-01-26 00:46:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:46:25,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 23 conjunts are in the unsatisfiable core [2024-01-26 00:46:25,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:46:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:26,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:46:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 00:46:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272418594] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:46:26,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 00:46:26,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 12] total 37 [2024-01-26 00:46:26,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317267506] [2024-01-26 00:46:26,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 00:46:26,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-01-26 00:46:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:46:26,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-01-26 00:46:26,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2024-01-26 00:46:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:26,488 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:46:26,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.648648648648648) internal successors, (172), 37 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:46:26,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:26,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 00:46:26,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:46:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:46:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-01-26 00:46:31,607 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-01-26 00:46:31,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:46:31,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:46:31,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:46:31,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1046375551, now seen corresponding path program 2 times [2024-01-26 00:46:31,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:46:31,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357500141] [2024-01-26 00:46:31,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:46:31,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:46:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:46:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:32,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:46:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357500141] [2024-01-26 00:46:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357500141] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 00:46:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639527355] [2024-01-26 00:46:32,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 00:46:32,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:46:32,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:46:32,929 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-01-26 00:46:32,948 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-01-26 00:46:33,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 00:46:33,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 00:46:33,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 39 conjunts are in the unsatisfiable core [2024-01-26 00:46:33,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:46:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:34,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:46:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639527355] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:46:35,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 00:46:35,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 61 [2024-01-26 00:46:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664424230] [2024-01-26 00:46:35,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 00:46:35,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-01-26 00:46:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:46:35,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-01-26 00:46:35,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=3255, Unknown=0, NotChecked=0, Total=3660 [2024-01-26 00:46:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:35,300 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:46:35,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 3.4754098360655736) internal successors, (212), 61 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:46:35,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:35,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:46:35,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-01-26 00:46:35,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:46:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:46:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-01-26 00:46:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-01-26 00:46:38,780 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-01-26 00:46:38,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:46:38,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:46:38,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:46:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1082099553, now seen corresponding path program 3 times [2024-01-26 00:46:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:46:38,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146874979] [2024-01-26 00:46:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:46:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:46:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:46:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:40,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:46:40,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146874979] [2024-01-26 00:46:40,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146874979] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 00:46:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673160153] [2024-01-26 00:46:40,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 00:46:40,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:46:40,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:46:40,533 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-01-26 00:46:40,534 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-01-26 00:46:41,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-01-26 00:46:41,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 00:46:41,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 65 conjunts are in the unsatisfiable core [2024-01-26 00:46:41,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:46:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:42,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:46:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:46:45,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673160153] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:46:45,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 00:46:45,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37, 35] total 99 [2024-01-26 00:46:45,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622101379] [2024-01-26 00:46:45,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 00:46:45,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2024-01-26 00:46:45,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:46:45,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2024-01-26 00:46:45,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1043, Invalid=8659, Unknown=0, NotChecked=0, Total=9702 [2024-01-26 00:46:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:45,356 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:46:45,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 3.0505050505050506) internal successors, (302), 99 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:46:45,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:46:45,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:46:45,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-01-26 00:46:45,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-01-26 00:46:45,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer [2024-01-26 00:47:54,590 WARN L293 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 93 DAG size of output: 94 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:48:57,479 WARN L293 SmtUtils]: Spent 55.63s on a formula simplification. DAG size of input: 89 DAG size of output: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:49:49,492 WARN L293 SmtUtils]: Spent 50.72s on a formula simplification. DAG size of input: 86 DAG size of output: 87 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:50:24,840 WARN L293 SmtUtils]: Spent 32.54s on a formula simplification. DAG size of input: 82 DAG size of output: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:50:39,088 WARN L293 SmtUtils]: Spent 13.29s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:50:54,222 WARN L293 SmtUtils]: Spent 12.97s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:51:01,653 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:51:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:51:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:51:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-01-26 00:51:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-01-26 00:51:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-01-26 00:51:20,005 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-01-26 00:51:20,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:51:20,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:51:20,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:51:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1006982945, now seen corresponding path program 4 times [2024-01-26 00:51:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:51:20,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053268466] [2024-01-26 00:51:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:51:20,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:51:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:51:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 0 proven. 1185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:51:23,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:51:23,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053268466] [2024-01-26 00:51:23,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053268466] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 00:51:23,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825002129] [2024-01-26 00:51:23,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 00:51:23,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:51:23,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:51:23,490 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 00:51:23,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-26 00:51:23,746 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 00:51:23,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 00:51:23,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 114 conjunts are in the unsatisfiable core [2024-01-26 00:51:23,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:51:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 0 proven. 1185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:51:27,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:51:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 0 proven. 1185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:51:36,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825002129] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:51:36,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 00:51:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 61, 60] total 172 [2024-01-26 00:51:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834811021] [2024-01-26 00:51:36,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 00:51:36,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 172 states [2024-01-26 00:51:36,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:51:36,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2024-01-26 00:51:36,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3139, Invalid=26273, Unknown=0, NotChecked=0, Total=29412 [2024-01-26 00:51:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:51:36,343 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:51:36,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 172 states, 172 states have (on average 2.802325581395349) internal successors, (482), 172 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:51:36,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:51:36,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:51:36,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-01-26 00:51:36,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-01-26 00:51:36,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-01-26 00:51:36,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer [2024-01-26 00:53:37,771 WARN L293 SmtUtils]: Spent 1.32m on a formula simplification. DAG size of input: 133 DAG size of output: 125 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:53:39,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:53:40,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:53:42,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:53:44,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:53:46,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:53:48,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:53:51,226 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~a~0 4294967296))) (let ((.cse0 (let ((.cse2 (+ .cse1 1))) (< (* (div .cse2 4294967296) 4294967296) .cse2)))) (and (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 17) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 18) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 14) 4294967296) .cse1)) (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 21) 4294967296) 4294967295) (or .cse0 (< (mod (+ 19 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 13) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 12) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 20) 4294967296) .cse1)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 21) 4294967296) 4294967295) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 16) 4294967296) .cse1)) (or .cse0 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 18) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 17) 4294967296) .cse1)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse1) .cse0) (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 22) 4294967296) 4294967295) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 15) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 13) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 14) 4294967296) .cse1)) (or .cse0 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse1)) (or .cse0 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse1)) (or .cse0 (< (mod (+ 19 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse1)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 20) 4294967296) 4294967295) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse1)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse1) .cse0) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 16) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 15) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 12) 4294967296) .cse1))))) is different from false [2024-01-26 00:53:53,256 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~a~0 4294967296))) (let ((.cse0 (let ((.cse2 (+ .cse1 1))) (< (* (div .cse2 4294967296) 4294967296) .cse2)))) (and (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 13) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 12) 4294967296) .cse1)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 21) 4294967296) 4294967295) (or .cse0 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 18) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 17) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 14) 4294967296) .cse1)) (or .cse0 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse1)) (or .cse0 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse1)) (or .cse0 (< (mod (+ 19 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse1)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 20) 4294967296) 4294967295) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse1)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse1) .cse0) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 16) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 15) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse1))))) is different from false [2024-01-26 00:56:02,043 WARN L293 SmtUtils]: Spent 1.21m on a formula simplification. DAG size of input: 114 DAG size of output: 114 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:56:03,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 01:00:31,756 WARN L293 SmtUtils]: Spent 4.12m on a formula simplification. DAG size of input: 198 DAG size of output: 198 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:00:33,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 01:00:35,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 01:00:38,560 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~a~0 4294967296))) (let ((.cse0 (let ((.cse2 (+ .cse1 1))) (< (* (div .cse2 4294967296) 4294967296) .cse2)))) (and (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 17) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 18) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 14) 4294967296) .cse1)) (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 21) 4294967296) 4294967295) (or .cse0 (< (mod (+ 19 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 13) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 12) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 20) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 16) 4294967296) .cse1)) (or .cse0 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 18) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 17) 4294967296) .cse1)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse1) .cse0) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 15) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 13) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 14) 4294967296) .cse1)) (or .cse0 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse1)) (or .cse0 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse1)) (or .cse0 (< (mod (+ 19 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse1)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 20) 4294967296) 4294967295) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse1)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse1) .cse0) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 16) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 15) 4294967296) .cse1)) (or .cse0 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 12) 4294967296) .cse1))))) is different from false [2024-01-26 01:00:40,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2024-01-26 01:00:57,421 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 01:00:57,422 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 01:00:57,421 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 01:00:57,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-26 01:00:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:00:58,080 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 246 known predicates. [2024-01-26 01:00:58,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 01:00:58,101 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2024-01-26 01:00:58,103 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2024-01-26 01:00:58,106 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 01:00:58,106 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 01:00:58,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 01:00:58 BasicIcfg [2024-01-26 01:00:58,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 01:00:58,127 INFO L158 Benchmark]: Toolchain (without parser) took 877766.10ms. Allocated memory was 220.2MB in the beginning and 551.6MB in the end (delta: 331.4MB). Free memory was 173.5MB in the beginning and 273.2MB in the end (delta: -99.7MB). Peak memory consumption was 232.4MB. Max. memory is 8.0GB. [2024-01-26 01:00:58,127 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory was 136.7MB in the beginning and 136.5MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 01:00:58,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.38ms. Allocated memory is still 220.2MB. Free memory was 173.5MB in the beginning and 161.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-01-26 01:00:58,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.53ms. Allocated memory is still 220.2MB. Free memory was 161.8MB in the beginning and 160.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-01-26 01:00:58,128 INFO L158 Benchmark]: Boogie Preprocessor took 21.47ms. Allocated memory is still 220.2MB. Free memory was 160.1MB in the beginning and 158.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:00:58,128 INFO L158 Benchmark]: RCFGBuilder took 340.15ms. Allocated memory is still 220.2MB. Free memory was 158.5MB in the beginning and 144.6MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-01-26 01:00:58,129 INFO L158 Benchmark]: TraceAbstraction took 877178.46ms. Allocated memory was 220.2MB in the beginning and 551.6MB in the end (delta: 331.4MB). Free memory was 143.9MB in the beginning and 273.2MB in the end (delta: -129.3MB). Peak memory consumption was 203.1MB. Max. memory is 8.0GB. [2024-01-26 01:00:58,130 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.13ms. Allocated memory is still 183.5MB. Free memory was 136.7MB in the beginning and 136.5MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.38ms. Allocated memory is still 220.2MB. Free memory was 173.5MB in the beginning and 161.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.53ms. Allocated memory is still 220.2MB. Free memory was 161.8MB in the beginning and 160.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.47ms. Allocated memory is still 220.2MB. Free memory was 160.1MB in the beginning and 158.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 340.15ms. Allocated memory is still 220.2MB. Free memory was 158.5MB in the beginning and 144.6MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 877178.46ms. Allocated memory was 220.2MB in the beginning and 551.6MB in the end (delta: 331.4MB). Free memory was 143.9MB in the beginning and 273.2MB in the end (delta: -129.3MB). Peak memory consumption was 203.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5463, independent: 5147, independent conditional: 5147, independent unconditional: 0, dependent: 316, dependent conditional: 316, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5147, independent: 5147, independent conditional: 5147, 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: 5147, independent: 5147, independent conditional: 5147, 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: 5147, independent: 5147, independent conditional: 0, independent unconditional: 5147, 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: 5147, independent: 5147, independent conditional: 0, independent unconditional: 5147, 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: 5147, independent: 5147, independent conditional: 0, independent unconditional: 5147, 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: 5147, independent: 5147, independent conditional: 0, independent unconditional: 5147, 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: 5147, independent: 5147, independent conditional: 0, independent unconditional: 5147, 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: 5147, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5147, unknown conditional: 0, unknown unconditional: 5147] , Statistics on independence cache: Total cache size (in pairs): 5147, Positive cache size: 5147, Positive conditional cache size: 0, Positive unconditional cache size: 5147, 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: 316 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 14, RedundantProofs: 6, ProvenStates: 342, Times there's more than one choice: 241, Avg number of choices: 2.4502923976608186 - StatisticsResult: Reduction benchmarks 0.3s Time before loop, 274.3s Time in loop, 274.6s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, thread2Thread1of1ForFork0_thidvar0, old(thread2Thread1of1ForFork0_thidvar0), thread2Thread1of1ForFork0_thidvar1, old(thread2Thread1of1ForFork0_thidvar1), thread2Thread1of1ForFork0_thidvar2, old(thread2Thread1of1ForFork0_thidvar2), thread1Thread1of1ForFork2_thidvar0, old(thread1Thread1of1ForFork2_thidvar0), thread1Thread1of1ForFork2_thidvar1, old(thread1Thread1of1ForFork2_thidvar1), write~int_#ptr.base, thread3Thread1of1ForFork1_#in~_argptr.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~mem15#1, thread1_~i~0, thread2_~i~1, thread3_~i~2, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet8#1, thread2Thread1of1ForFork0_#res.offset, ULTIMATE.start_main_~#t3~0#1.offset, thread3Thread1of1ForFork1_~_argptr.base, read~int_#ptr.base, thread1Thread1of1ForFork2_~i~0, ULTIMATE.start_#t~ret16#1, thread1_#res.offset, thread2_#res.offset, thread3_#res.offset, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_#in~_argptr.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork2_#res.offset, thread1_~_argptr.offset, thread2_~_argptr.offset, thread3_~_argptr.offset, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread1_#in~_argptr.base, thread2_#in~_argptr.base, thread3_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.base, ~x_1~0, old(~x_1~0), ~x_2~0, old(~x_2~0), ~x_3~0, old(~x_3~0), ULTIMATE.start_main_~#t1~0#1.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread3Thread1of1ForFork1_#res.base, ULTIMATE.start_main_#t~pre11#1, #Ultimate.allocOnStack_#res.offset, ULTIMATE.dealloc_~addr.offset, thread1Thread1of1ForFork2_#in~_argptr.base, write~int_#value, write~init~int_#ptr.offset, thread1_~_argptr.base, thread2_~_argptr.base, thread3_~_argptr.base, ULTIMATE.dealloc_~addr.base, thread3Thread1of1ForFork1_#in~_argptr.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), thread3Thread1of1ForFork1_#t~post3, ~a~0, old(~a~0), ~b~0, old(~b~0), ~c~0, old(~c~0), thread1Thread1of1ForFork2_~_argptr.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread2Thread1of1ForFork0_#res.base, write~init~int_#ptr.base, thread2Thread1of1ForFork0_#in~_argptr.offset, thread1_#res.base, thread2_#res.base, thread3_#res.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.base, thread2Thread1of1ForFork0_#t~post2, #length, old(#length), ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, thread1_#in~_argptr.offset, thread2_#in~_argptr.offset, thread3_#in~_argptr.offset, thread3Thread1of1ForFork1_~i~2, ULTIMATE.start_main_~#t3~0#1.base, thread3Thread1of1ForFork1_thidvar0, old(thread3Thread1of1ForFork1_thidvar0), thread3Thread1of1ForFork1_thidvar1, old(thread3Thread1of1ForFork1_thidvar1), thread3Thread1of1ForFork1_thidvar2, old(thread3Thread1of1ForFork1_thidvar2), thread3Thread1of1ForFork1_thidvar3, old(thread3Thread1of1ForFork1_thidvar3), #StackHeapBarrier, old(#StackHeapBarrier), thread1Thread1of1ForFork2_#res.base, thread1_#t~post1, thread2_#t~post2, thread3_#t~post3, thread1Thread1of1ForFork2_#in~_argptr.offset, write~int_#ptr.offset, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_#t~pre9#1, thread3Thread1of1ForFork1_#res.offset, #memory_int, old(#memory_int), thread1Thread1of1ForFork2_#t~post1, #Ultimate.allocOnStack_#res.base, thread2Thread1of1ForFork0_~i~1, thread3Thread1of1ForFork1_~_argptr.offset, read~int_#ptr.offset], Protected Variables before encountering a loop: [] - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 246 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 142 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 877.0s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 845.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 307, 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, 1.5s SatisfiabilityAnalysisTime, 28.4s InterpolantComputationTime, 1364 NumberOfCodeBlocks, 1364 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1988 ConstructedInterpolants, 0 QuantifiedInterpolants, 14546 SizeOfPredicates, 158 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 9/4441 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown