/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 17:09:13,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 17:09:13,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 17:09:13,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 17:09:13,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 17:09:13,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 17:09:13,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 17:09:13,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 17:09:13,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 17:09:13,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 17:09:13,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 17:09:13,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 17:09:13,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 17:09:13,361 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 17:09:13,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 17:09:13,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 17:09:13,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 17:09:13,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 17:09:13,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 17:09:13,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 17:09:13,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 17:09:13,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 17:09:13,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 17:09:13,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 17:09:13,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 17:09:13,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 17:09:13,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 17:09:13,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 17:09:13,365 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 17:09:13,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 17:09:13,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 17:09:13,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 17:09:13,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 17:09:13,367 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 17:09:13,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 17:09:13,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 17:09:13,376 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 17:09:13,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 17:09:13,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 17:09:13,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 17:09:13,377 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 17:09:13,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 17:09:13,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 17:09:13,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 17:09:13,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 17:09:13,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 17:09:13,671 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 17:09:13,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-05-30 17:09:14,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 17:09:15,083 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 17:09:15,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-05-30 17:09:15,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/292fd77b3/637ce7994a5f486695166cf3a2405b04/FLAG53cd488f7 [2024-05-30 17:09:15,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/292fd77b3/637ce7994a5f486695166cf3a2405b04 [2024-05-30 17:09:15,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 17:09:15,124 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 17:09:15,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 17:09:15,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 17:09:15,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 17:09:15,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d04f740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15, skipping insertion in model container [2024-05-30 17:09:15,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,184 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 17:09:15,663 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-05-30 17:09:15,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 17:09:15,686 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 17:09:15,736 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-05-30 17:09:15,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 17:09:15,790 INFO L206 MainTranslator]: Completed translation [2024-05-30 17:09:15,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15 WrapperNode [2024-05-30 17:09:15,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 17:09:15,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 17:09:15,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 17:09:15,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 17:09:15,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,861 INFO L138 Inliner]: procedures = 244, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2024-05-30 17:09:15,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 17:09:15,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 17:09:15,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 17:09:15,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 17:09:15,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 17:09:15,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 17:09:15,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 17:09:15,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 17:09:15,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (1/1) ... [2024-05-30 17:09:15,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 17:09:15,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:09:15,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 17:09:15,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 17:09:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 17:09:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 17:09:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-05-30 17:09:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-30 17:09:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 17:09:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 17:09:15,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 17:09:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 17:09:15,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 17:09:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 17:09:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-30 17:09:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 17:09:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 17:09:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 17:09:15,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 17:09:15,975 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 17:09:16,144 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 17:09:16,147 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 17:09:16,414 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 17:09:16,443 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 17:09:16,444 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-30 17:09:16,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 05:09:16 BoogieIcfgContainer [2024-05-30 17:09:16,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 17:09:16,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 17:09:16,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 17:09:16,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 17:09:16,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 05:09:15" (1/3) ... [2024-05-30 17:09:16,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2d7253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 05:09:16, skipping insertion in model container [2024-05-30 17:09:16,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:09:15" (2/3) ... [2024-05-30 17:09:16,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2d7253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 05:09:16, skipping insertion in model container [2024-05-30 17:09:16,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 05:09:16" (3/3) ... [2024-05-30 17:09:16,451 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-05-30 17:09:16,459 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 17:09:16,466 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 17:09:16,467 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 17:09:16,467 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 17:09:16,530 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 17:09:16,567 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 17:09:16,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 17:09:16,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:09:16,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 17:09:16,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 17:09:16,613 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 17:09:16,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 17:09:16,627 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;@38dd22b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 17:09:16,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 17:09:16,633 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:09:16,760 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,760 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,760 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,776 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,776 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,776 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,840 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,841 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,841 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,856 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,856 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,856 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,892 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,892 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,892 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,899 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,899 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,899 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,937 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,937 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,937 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,945 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,945 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,945 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,968 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,968 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,968 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,972 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,972 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,973 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,986 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,987 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,987 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:16,990 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:16,990 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:16,990 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,023 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,023 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,023 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,034 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,034 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,034 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,056 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,057 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,057 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,066 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,066 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,067 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,134 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,134 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,134 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,135 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,135 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,135 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,180 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,180 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,180 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,182 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,183 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,183 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,212 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,212 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,213 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,225 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,225 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,225 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,227 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,227 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,227 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:09:17,231 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 417 states. [2024-05-30 17:09:17,232 INFO L212 cStratifiedReduction]: Copied states 24 times. [2024-05-30 17:09:17,234 INFO L78 Accepts]: Start accepts. Automaton has currently 435 states, but on-demand construction may add more states Word has length 125 [2024-05-30 17:09:17,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:09:17,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:09:17,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:09:17,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2121032812, now seen corresponding path program 1 times [2024-05-30 17:09:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:09:17,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112424095] [2024-05-30 17:09:17,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:09:17,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:09:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:09:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-30 17:09:17,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:09:17,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112424095] [2024-05-30 17:09:17,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112424095] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:09:17,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:09:17,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-30 17:09:17,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180026674] [2024-05-30 17:09:17,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:09:17,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 17:09:17,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:09:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 17:09:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-30 17:09:17,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:17,722 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:09:17,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:09:17,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:17,724 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:09:17,834 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,835 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,835 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,842 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,842 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,842 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,874 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,874 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,875 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,878 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,879 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,879 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,884 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,885 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,885 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,920 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,920 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,920 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,943 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,944 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,944 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,947 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,948 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,948 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,954 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,954 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,954 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,956 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,956 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,956 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,972 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,972 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,972 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,978 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,979 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,979 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,983 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,983 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:17,983 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,984 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:17,984 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:17,984 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:17,987 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 343 states. [2024-05-30 17:09:17,988 INFO L212 cStratifiedReduction]: Copied states 23 times. [2024-05-30 17:09:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:17,988 INFO L78 Accepts]: Start accepts. Automaton has currently 363 states, but on-demand construction may add more states Word has length 110 [2024-05-30 17:09:17,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:09:17,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 17:09:17,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:09:17,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:09:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash -85203206, now seen corresponding path program 1 times [2024-05-30 17:09:17,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:09:17,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630309836] [2024-05-30 17:09:17,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:09:17,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:09:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:09:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 17:09:18,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:09:18,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630309836] [2024-05-30 17:09:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630309836] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:09:18,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:09:18,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-30 17:09:18,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060154973] [2024-05-30 17:09:18,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:09:18,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 17:09:18,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:09:18,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 17:09:18,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-30 17:09:18,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:18,205 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:09:18,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:09:18,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:18,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:18,206 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:09:18,289 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,289 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,289 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,300 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,301 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,302 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,322 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,323 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,323 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,328 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,328 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,328 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,331 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,331 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:18,331 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,347 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,347 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,347 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,359 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,360 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,360 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,368 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,368 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,368 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,372 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,373 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,373 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,375 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,375 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,375 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,436 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,436 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,436 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,478 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,478 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,479 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,482 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,483 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:18,483 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,483 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:18,483 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:18,483 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:18,497 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 380 states. [2024-05-30 17:09:18,497 INFO L212 cStratifiedReduction]: Copied states 20 times. [2024-05-30 17:09:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:18,497 INFO L78 Accepts]: Start accepts. Automaton has currently 424 states, but on-demand construction may add more states Word has length 122 [2024-05-30 17:09:18,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:09:18,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 17:09:18,499 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:09:18,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:09:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2115023247, now seen corresponding path program 2 times [2024-05-30 17:09:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:09:18,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033845062] [2024-05-30 17:09:18,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:09:18,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:09:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:09:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-30 17:09:18,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:09:18,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033845062] [2024-05-30 17:09:18,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033845062] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:09:18,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257229526] [2024-05-30 17:09:18,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 17:09:18,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:09:18,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:09:18,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:09:18,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 17:09:18,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 17:09:18,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:09:18,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-30 17:09:18,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:09:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-30 17:09:19,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:09:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-30 17:09:19,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257229526] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:09:19,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:09:19,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-05-30 17:09:19,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991636594] [2024-05-30 17:09:19,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:09:19,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-30 17:09:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:09:19,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-30 17:09:19,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-30 17:09:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:19,075 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:09:19,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:09:19,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:19,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:19,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:19,076 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:09:19,252 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,252 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,252 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,262 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,263 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,263 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,280 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,281 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,281 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,286 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,286 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,286 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,289 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,289 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:19,289 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,304 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,304 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,304 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,322 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,322 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,322 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,329 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,330 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,330 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,334 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,335 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,338 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,341 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,341 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,341 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,352 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,353 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,354 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,367 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,367 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,367 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,381 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,382 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:19,382 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,383 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,383 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~num~0] [2024-05-30 17:09:19,383 INFO L395 cStratifiedReduction]: Actual level: [~num~0] [2024-05-30 17:09:19,387 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 431 states. [2024-05-30 17:09:19,388 INFO L212 cStratifiedReduction]: Copied states 25 times. [2024-05-30 17:09:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 17:09:19,388 INFO L78 Accepts]: Start accepts. Automaton has currently 518 states, but on-demand construction may add more states Word has length 154 [2024-05-30 17:09:19,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:09:19,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-30 17:09:19,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-30 17:09:19,599 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:09:19,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:09:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2098485717, now seen corresponding path program 3 times [2024-05-30 17:09:19,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:09:19,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000587754] [2024-05-30 17:09:19,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:09:19,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:09:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:09:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-05-30 17:09:19,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:09:19,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000587754] [2024-05-30 17:09:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000587754] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:09:19,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:09:19,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-30 17:09:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721610757] [2024-05-30 17:09:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:09:19,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 17:09:19,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:09:19,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 17:09:19,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-30 17:09:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:19,817 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:09:19,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:09:19,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:19,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:19,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 17:09:19,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:19,818 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:09:19,900 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,901 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:19,901 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:19,921 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,921 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:19,921 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:19,925 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:19,925 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:19,926 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:19,928 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 367 states. [2024-05-30 17:09:19,928 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:09:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 17:09:19,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:19,929 INFO L78 Accepts]: Start accepts. Automaton has currently 440 states, but on-demand construction may add more states Word has length 182 [2024-05-30 17:09:19,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:09:19,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-30 17:09:19,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:09:19,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:09:19,930 INFO L85 PathProgramCache]: Analyzing trace with hash 871689766, now seen corresponding path program 2 times [2024-05-30 17:09:19,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:09:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977606133] [2024-05-30 17:09:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:09:19,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:09:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:09:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 67 proven. 5 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-05-30 17:09:20,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:09:20,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977606133] [2024-05-30 17:09:20,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977606133] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:09:20,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460575275] [2024-05-30 17:09:20,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 17:09:20,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:09:20,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:09:20,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:09:20,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 17:09:20,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 17:09:20,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:09:20,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 17:09:20,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:09:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-05-30 17:09:20,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:09:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-05-30 17:09:20,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460575275] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:09:20,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:09:20,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2024-05-30 17:09:20,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68742320] [2024-05-30 17:09:20,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:09:20,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-30 17:09:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:09:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-30 17:09:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-30 17:09:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:20,502 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:09:20,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:09:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 17:09:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:20,503 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:09:20,654 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:20,655 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:20,655 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:20,714 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:20,714 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:20,714 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:20,725 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:20,725 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:20,725 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:20,738 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 436 states. [2024-05-30 17:09:20,738 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:09:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 17:09:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:09:20,739 INFO L78 Accepts]: Start accepts. Automaton has currently 509 states, but on-demand construction may add more states Word has length 206 [2024-05-30 17:09:20,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:09:20,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 17:09:20,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:09:20,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:09:20,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:09:20,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1544371268, now seen corresponding path program 3 times [2024-05-30 17:09:20,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:09:20,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780315737] [2024-05-30 17:09:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:09:20,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:09:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:09:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-05-30 17:09:21,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:09:21,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780315737] [2024-05-30 17:09:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780315737] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:09:21,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:09:21,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 17:09:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325287011] [2024-05-30 17:09:21,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:09:21,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 17:09:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:09:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 17:09:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 17:09:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:21,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:09:21,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:09:21,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:21,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:21,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 17:09:21,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:21,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:09:21,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:21,129 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:09:21,243 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:21,243 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post13, thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread1Thread1of1ForFork0_#t~post7, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:21,244 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post13, thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread1Thread1of1ForFork0_#t~post7, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:21,288 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:21,288 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post13, thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread1Thread1of1ForFork0_#t~post7, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:21,288 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post13, thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread1Thread1of1ForFork0_#t~post7, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:21,293 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:21,294 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post13, thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread1Thread1of1ForFork0_#t~post7, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:21,294 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post13, thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread1Thread1of1ForFork0_#t~post7, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:21,298 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 462 states. [2024-05-30 17:09:21,298 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:09:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 17:09:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:09:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:09:21,299 INFO L78 Accepts]: Start accepts. Automaton has currently 551 states, but on-demand construction may add more states Word has length 219 [2024-05-30 17:09:21,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:09:21,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 17:09:21,301 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:09:21,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:09:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash 535416973, now seen corresponding path program 4 times [2024-05-30 17:09:21,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:09:21,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218791046] [2024-05-30 17:09:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:09:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:09:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:09:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 216 proven. 66 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 17:09:21,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:09:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218791046] [2024-05-30 17:09:21,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218791046] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:09:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763136697] [2024-05-30 17:09:21,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 17:09:21,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:09:21,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:09:21,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:09:21,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 17:09:21,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 17:09:21,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:09:21,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-30 17:09:21,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:09:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-05-30 17:09:21,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-30 17:09:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763136697] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:09:21,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-30 17:09:21,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-05-30 17:09:21,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039669334] [2024-05-30 17:09:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:09:21,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-30 17:09:21,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:09:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-30 17:09:21,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-05-30 17:09:21,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:21,960 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:09:21,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.77777777777778) internal successors, (178), 9 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:09:21,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:21,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:21,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 17:09:21,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:21,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:09:21,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:09:21,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:21,961 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:09:22,107 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:22,107 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post13, thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread1Thread1of1ForFork0_#t~post7, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:22,107 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post13, thread2Thread1of1ForFork1_#t~post15, ~num~0, #pthreadsMutex, ~#m~0.offset, ~#m~0.base, thread1Thread1of1ForFork0_#t~post7, thread2Thread1of1ForFork1_~j~0] [2024-05-30 17:09:22,110 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 277 states. [2024-05-30 17:09:22,110 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:09:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 17:09:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 17:09:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:09:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:09:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 17:09:22,111 INFO L78 Accepts]: Start accepts. Automaton has currently 313 states, but on-demand construction may add more states Word has length 163 [2024-05-30 17:09:22,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:09:22,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 17:09:22,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:09:22,327 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:09:22,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:09:22,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1217022651, now seen corresponding path program 4 times [2024-05-30 17:09:22,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:09:22,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663996163] [2024-05-30 17:09:22,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:09:22,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:09:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 17:09:22,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 17:09:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 17:09:22,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 17:09:22,454 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 17:09:22,455 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 17:09:22,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-30 17:09:22,465 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4] [2024-05-30 17:09:22,467 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/3) [2024-05-30 17:09:22,471 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 17:09:22,471 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 17:09:22,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 05:09:22 BasicIcfg [2024-05-30 17:09:22,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 17:09:22,571 INFO L158 Benchmark]: Toolchain (without parser) took 7447.11ms. Allocated memory was 267.4MB in the beginning and 334.5MB in the end (delta: 67.1MB). Free memory was 196.4MB in the beginning and 148.7MB in the end (delta: 47.7MB). Peak memory consumption was 116.2MB. Max. memory is 8.0GB. [2024-05-30 17:09:22,571 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 267.4MB. Free memory is still 235.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 17:09:22,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 663.88ms. Allocated memory is still 267.4MB. Free memory was 196.3MB in the beginning and 168.8MB in the end (delta: 27.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2024-05-30 17:09:22,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.78ms. Allocated memory is still 267.4MB. Free memory was 168.8MB in the beginning and 234.8MB in the end (delta: -66.0MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2024-05-30 17:09:22,572 INFO L158 Benchmark]: Boogie Preprocessor took 24.82ms. Allocated memory is still 267.4MB. Free memory was 234.8MB in the beginning and 233.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 17:09:22,572 INFO L158 Benchmark]: RCFGBuilder took 556.49ms. Allocated memory is still 267.4MB. Free memory was 233.2MB in the beginning and 212.8MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-30 17:09:22,572 INFO L158 Benchmark]: TraceAbstraction took 6124.66ms. Allocated memory was 267.4MB in the beginning and 334.5MB in the end (delta: 67.1MB). Free memory was 211.7MB in the beginning and 148.7MB in the end (delta: 63.0MB). Peak memory consumption was 130.6MB. Max. memory is 8.0GB. [2024-05-30 17:09:22,573 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.14ms. Allocated memory is still 267.4MB. Free memory is still 235.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 663.88ms. Allocated memory is still 267.4MB. Free memory was 196.3MB in the beginning and 168.8MB in the end (delta: 27.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.78ms. Allocated memory is still 267.4MB. Free memory was 168.8MB in the beginning and 234.8MB in the end (delta: -66.0MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.82ms. Allocated memory is still 267.4MB. Free memory was 234.8MB in the beginning and 233.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 556.49ms. Allocated memory is still 267.4MB. Free memory was 233.2MB in the beginning and 212.8MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 6124.66ms. Allocated memory was 267.4MB in the beginning and 334.5MB in the end (delta: 67.1MB). Free memory was 211.7MB in the beginning and 148.7MB in the end (delta: 63.0MB). Peak memory consumption was 130.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2115, independent: 1847, independent conditional: 1847, independent unconditional: 0, dependent: 268, dependent conditional: 268, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1887, independent: 1847, independent conditional: 1847, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1887, independent: 1847, independent conditional: 1847, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2015, independent: 1847, independent conditional: 0, independent unconditional: 1847, dependent: 168, dependent conditional: 128, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2015, independent: 1847, independent conditional: 0, independent unconditional: 1847, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2015, independent: 1847, independent conditional: 0, independent unconditional: 1847, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1887, independent: 1847, independent conditional: 0, independent unconditional: 1847, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1887, independent: 1826, independent conditional: 0, independent unconditional: 1826, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2015, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 1887, unknown conditional: 0, unknown unconditional: 1887] , Statistics on independence cache: Total cache size (in pairs): 1887, Positive cache size: 1847, Positive conditional cache size: 0, Positive unconditional cache size: 1847, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 128, Maximal queried relation: 7, Independence queries for same thread: 228 - StatisticsResult: Reduction benchmarks 22.0ms Time before loop, 575.7ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 31, Reduction States: 417, Duplicate States: 24, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 29.8ms Time before loop, 233.7ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 19, Reduction States: 343, Duplicate States: 23, Protected Variables: 1 - StatisticsResult: Reduction benchmarks 19.9ms Time before loop, 270.2ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 19, Reduction States: 380, Duplicate States: 20, Protected Variables: 1 - StatisticsResult: Reduction benchmarks 28.3ms Time before loop, 283.0ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 21, Reduction States: 431, Duplicate States: 25, Protected Variables: 1 - StatisticsResult: Reduction benchmarks 22.9ms Time before loop, 87.3ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 12, Reduction States: 367, Duplicate States: 0, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 47.3ms Time before loop, 187.1ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 12, Reduction States: 436, Duplicate States: 0, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 45.3ms Time before loop, 123.6ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 11, Reduction States: 462, Duplicate States: 0, Protected Variables: 8 - StatisticsResult: Reduction benchmarks 46.5ms Time before loop, 102.9ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 277, Duplicate States: 0, Protected Variables: 8 - StatisticsResult: Visitor Statistics States: 384, Transitions: 440, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 288, Transitions: 341, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 303, Transitions: 369, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 341, Transitions: 416, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 255, Transitions: 306, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 295, Transitions: 355, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 316, Transitions: 377, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 184, Transitions: 207, Traversal time: 0.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 0, ProvenStates: 278, Times there's more than one choice: 134, Avg number of choices: 2.2446043165467624 - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; VAL [num=0] [L871] 0 unsigned long total; VAL [num=0, total=0] [L872] 0 int flag; VAL [flag=0, num=0, total=0] [L873] 0 pthread_mutex_t m; VAL [flag=0, m={3:0}, num=0, total=0] [L874] 0 pthread_cond_t empty, full; VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0] [L907] 0 pthread_t t1, t2; VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L908] 0 num = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L909] 0 total = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L915] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L876] 1 int i; VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0] [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L880] COND TRUE 1 num > 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L890] 2 int j; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=0, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=0, m={3:0}, num=1, total=0] [L880] COND TRUE 1 num > 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=0, m={3:0}, num=1, total=0] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=1] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=1, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=1, m={3:0}, num=1, total=1] [L887] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=1, m={3:0}, num=1, total=1] [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=1, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L916] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=1, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L896] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=3] [L897] 2 num-- VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L903] 2 flag = 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L904] 2 return ((void *)0); VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L917] COND TRUE 0 \read(flag) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 167 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 2.2s, 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: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1804 NumberOfCodeBlocks, 1782 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1933 ConstructedInterpolants, 0 QuantifiedInterpolants, 2871 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1370 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 1303/1385 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 proved your program to be incorrect! [2024-05-30 17:09:22,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-30 17:09:22,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...