/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-25 23:18:35,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-25 23:18:35,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-25 23:18:35,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-25 23:18:35,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-25 23:18:35,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-25 23:18:35,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-25 23:18:35,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-25 23:18:35,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-25 23:18:35,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-25 23:18:35,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-25 23:18:35,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-25 23:18:35,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-25 23:18:35,177 INFO L153 SettingsManager]: * Use SBE=true [2024-01-25 23:18:35,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-25 23:18:35,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-25 23:18:35,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-25 23:18:35,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-25 23:18:35,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-25 23:18:35,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-25 23:18:35,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-25 23:18:35,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-25 23:18:35,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-25 23:18:35,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-25 23:18:35,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-25 23:18:35,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-25 23:18:35,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-25 23:18:35,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-25 23:18:35,179 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-25 23:18:35,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-25 23:18:35,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-25 23:18:35,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-25 23:18:35,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-25 23:18:35,181 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-25 23:18:35,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-25 23:18:35,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-25 23:18:35,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-25 23:18:35,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-25 23:18:35,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-25 23:18:35,181 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-25 23:18:35,181 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-25 23:18:35,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-01-25 23:18:35,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-25 23:18:35,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-25 23:18:35,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-25 23:18:35,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-25 23:18:35,366 INFO L274 PluginConnector]: CDTParser initialized [2024-01-25 23:18:35,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-01-25 23:18:36,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-25 23:18:36,514 INFO L384 CDTParser]: Found 1 translation units. [2024-01-25 23:18:36,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-01-25 23:18:36,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3d7887caa/3e2df308e1a24b1982bdd4bb5753f7e2/FLAG942acd65e [2024-01-25 23:18:36,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3d7887caa/3e2df308e1a24b1982bdd4bb5753f7e2 [2024-01-25 23:18:36,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-25 23:18:36,557 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-25 23:18:36,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-25 23:18:36,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-25 23:18:36,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-25 23:18:36,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 11:18:36" (1/1) ... [2024-01-25 23:18:36,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1479df81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:36, skipping insertion in model container [2024-01-25 23:18:36,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 11:18:36" (1/1) ... [2024-01-25 23:18:36,608 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-25 23:18:36,719 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-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-01-25 23:18:36,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-25 23:18:36,959 INFO L202 MainTranslator]: Completed pre-run [2024-01-25 23:18:36,966 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-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-01-25 23:18:36,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-25 23:18:37,041 INFO L206 MainTranslator]: Completed translation [2024-01-25 23:18:37,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37 WrapperNode [2024-01-25 23:18:37,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-25 23:18:37,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-25 23:18:37,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-25 23:18:37,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-25 23:18:37,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,080 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-01-25 23:18:37,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-25 23:18:37,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-25 23:18:37,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-25 23:18:37,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-25 23:18:37,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-25 23:18:37,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-25 23:18:37,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-25 23:18:37,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-25 23:18:37,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (1/1) ... [2024-01-25 23:18:37,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-25 23:18:37,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:18:37,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-01-25 23:18:37,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-01-25 23:18:37,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-25 23:18:37,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-25 23:18:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-25 23:18:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-25 23:18:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-25 23:18:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-01-25 23:18:37,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-01-25 23:18:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-25 23:18:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-25 23:18:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-25 23:18:37,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-25 23:18:37,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-25 23:18:37,164 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-25 23:18:37,289 INFO L241 CfgBuilder]: Building ICFG [2024-01-25 23:18:37,290 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-25 23:18:37,418 INFO L282 CfgBuilder]: Performing block encoding [2024-01-25 23:18:37,427 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-25 23:18:37,428 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-25 23:18:37,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 11:18:37 BoogieIcfgContainer [2024-01-25 23:18:37,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-25 23:18:37,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-25 23:18:37,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-25 23:18:37,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-25 23:18:37,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 11:18:36" (1/3) ... [2024-01-25 23:18:37,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316c2fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 11:18:37, skipping insertion in model container [2024-01-25 23:18:37,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:18:37" (2/3) ... [2024-01-25 23:18:37,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316c2fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 11:18:37, skipping insertion in model container [2024-01-25 23:18:37,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 11:18:37" (3/3) ... [2024-01-25 23:18:37,433 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-01-25 23:18:37,439 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-25 23:18:37,445 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-25 23:18:37,445 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-25 23:18:37,446 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-25 23:18:37,477 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-25 23:18:37,502 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:18:37,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:18:37,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:18:37,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-01-25 23:18:37,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-01-25 23:18:37,549 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:18:37,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:18:37,560 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;@57eba308, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:18:37,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:18:37,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:18:37,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:18:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1525020291, now seen corresponding path program 1 times [2024-01-25 23:18:37,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:18:37,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615887416] [2024-01-25 23:18:37,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:18:37,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:18:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:18:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-25 23:18:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:18:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615887416] [2024-01-25 23:18:37,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615887416] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:18:37,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:18:37,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-25 23:18:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225743111] [2024-01-25 23:18:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:18:37,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-25 23:18:37,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:18:37,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-25 23:18:37,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-25 23:18:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:37,849 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:18:37,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-25 23:18:37,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:18:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:37,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-25 23:18:37,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:18:37,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:18:37,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1066552231, now seen corresponding path program 1 times [2024-01-25 23:18:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:18:37,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629884778] [2024-01-25 23:18:37,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:18:37,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:18:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:18:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-25 23:18:38,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:18:38,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629884778] [2024-01-25 23:18:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629884778] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-25 23:18:38,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001926714] [2024-01-25 23:18:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:18:38,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:38,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:18:38,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-25 23:18:38,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-25 23:18:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:18:38,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-25 23:18:38,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-25 23:18:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:18:38,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-25 23:18:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:18:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001926714] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-25 23:18:38,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-25 23:18:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-01-25 23:18:38,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811844412] [2024-01-25 23:18:38,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-25 23:18:38,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-25 23:18:38,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:18:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-25 23:18:38,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-01-25 23:18:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:38,374 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:18:38,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-25 23:18:38,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:38,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:18:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-25 23:18:38,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-25 23:18:38,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-01-25 23:18:38,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:18:38,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:18:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash 192353938, now seen corresponding path program 2 times [2024-01-25 23:18:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:18:38,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45054696] [2024-01-25 23:18:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:18:38,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:18:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:18:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-25 23:18:39,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:18:39,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45054696] [2024-01-25 23:18:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45054696] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-25 23:18:39,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414013674] [2024-01-25 23:18:39,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-25 23:18:39,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:39,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:18:39,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-25 23:18:39,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-25 23:18:39,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-25 23:18:39,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-25 23:18:39,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-25 23:18:39,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-25 23:18:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-01-25 23:18:39,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-25 23:18:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-01-25 23:18:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414013674] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-25 23:18:39,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-25 23:18:39,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 25 [2024-01-25 23:18:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53692825] [2024-01-25 23:18:39,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-25 23:18:39,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-01-25 23:18:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:18:39,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-01-25 23:18:39,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-01-25 23:18:39,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:39,362 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:18:39,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.48) internal successors, (137), 25 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-25 23:18:39,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:39,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-25 23:18:39,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:18:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:39,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-25 23:18:39,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:39,976 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:18:39,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:18:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2128123083, now seen corresponding path program 3 times [2024-01-25 23:18:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:18:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713745613] [2024-01-25 23:18:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:18:39,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:18:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:18:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 9 proven. 189 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-01-25 23:18:40,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:18:40,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713745613] [2024-01-25 23:18:40,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713745613] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-25 23:18:40,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128441104] [2024-01-25 23:18:40,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-25 23:18:40,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:40,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:18:40,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-25 23:18:40,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-25 23:18:40,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-01-25 23:18:40,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-25 23:18:40,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-25 23:18:40,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-25 23:18:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 41 proven. 85 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-01-25 23:18:40,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-25 23:18:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 41 proven. 85 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-01-25 23:18:40,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128441104] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-25 23:18:40,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-25 23:18:40,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 43 [2024-01-25 23:18:40,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21436299] [2024-01-25 23:18:40,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-25 23:18:40,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-01-25 23:18:40,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:18:40,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-01-25 23:18:40,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1531, Unknown=0, NotChecked=0, Total=1806 [2024-01-25 23:18:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:40,811 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:18:40,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.930232558139535) internal successors, (212), 43 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-25 23:18:40,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:40,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:40,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:40,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:18:41,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:41,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:41,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:41,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-01-25 23:18:41,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-25 23:18:41,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:41,833 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:18:41,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:18:41,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1309426541, now seen corresponding path program 4 times [2024-01-25 23:18:41,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:18:41,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925763129] [2024-01-25 23:18:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:18:41,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:18:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:18:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 21 proven. 342 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2024-01-25 23:18:42,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:18:42,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925763129] [2024-01-25 23:18:42,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925763129] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-25 23:18:42,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581280219] [2024-01-25 23:18:42,305 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-25 23:18:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:18:42,307 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-25 23:18:42,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-25 23:18:42,397 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-25 23:18:42,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-25 23:18:42,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 26 conjunts are in the unsatisfiable core [2024-01-25 23:18:42,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-25 23:18:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 21 proven. 342 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2024-01-25 23:18:42,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-25 23:18:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 21 proven. 342 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2024-01-25 23:18:42,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581280219] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-25 23:18:42,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-25 23:18:42,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 43 [2024-01-25 23:18:42,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417984215] [2024-01-25 23:18:42,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-25 23:18:42,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-01-25 23:18:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:18:42,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-01-25 23:18:42,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-01-25 23:18:42,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:42,853 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:18:42,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-25 23:18:42,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:42,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:42,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:42,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-01-25 23:18:42,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:18:43,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-01-25 23:18:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-01-25 23:18:43,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-25 23:18:43,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:43,747 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:18:43,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:18:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash 779850123, now seen corresponding path program 5 times [2024-01-25 23:18:43,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:18:43,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399512947] [2024-01-25 23:18:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:18:43,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:18:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:18:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1522 backedges. 994 proven. 77 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-01-25 23:18:44,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:18:44,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399512947] [2024-01-25 23:18:44,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399512947] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-25 23:18:44,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931990889] [2024-01-25 23:18:44,681 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-25 23:18:44,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:44,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:18:44,682 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-25 23:18:44,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-25 23:18:44,776 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2024-01-25 23:18:44,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-25 23:18:44,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 42 conjunts are in the unsatisfiable core [2024-01-25 23:18:44,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-25 23:18:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1522 backedges. 1071 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-01-25 23:18:44,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-25 23:18:44,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931990889] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:18:44,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-25 23:18:44,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2024-01-25 23:18:44,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074054029] [2024-01-25 23:18:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:18:44,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-01-25 23:18:44,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:18:44,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-01-25 23:18:44,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2024-01-25 23:18:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:44,888 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:18:44,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.8372093023255816) internal successors, (165), 43 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-25 23:18:44,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:44,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:44,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:44,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-01-25 23:18:44,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-01-25 23:18:44,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:18:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-01-25 23:18:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-01-25 23:18:45,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-01-25 23:18:45,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-25 23:18:45,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:45,787 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:18:45,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:18:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1465465548, now seen corresponding path program 6 times [2024-01-25 23:18:45,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:18:45,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930849866] [2024-01-25 23:18:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:18:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:18:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:18:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 1510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:18:46,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:18:46,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930849866] [2024-01-25 23:18:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930849866] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-25 23:18:46,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917744455] [2024-01-25 23:18:46,971 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-25 23:18:46,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:18:46,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-25 23:18:46,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-25 23:18:47,081 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-01-25 23:18:47,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-25 23:18:47,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 26 conjunts are in the unsatisfiable core [2024-01-25 23:18:47,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-25 23:18:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-01-25 23:18:47,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-25 23:18:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-01-25 23:18:48,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917744455] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-25 23:18:48,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-25 23:18:48,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 27, 27] total 89 [2024-01-25 23:18:48,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453734033] [2024-01-25 23:18:48,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-25 23:18:48,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2024-01-25 23:18:48,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:18:48,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2024-01-25 23:18:48,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1142, Invalid=6690, Unknown=0, NotChecked=0, Total=7832 [2024-01-25 23:18:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:48,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:18:48,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 5.067415730337078) internal successors, (451), 89 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-25 23:18:48,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:48,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:48,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:48,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-01-25 23:18:48,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-01-25 23:18:48,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-01-25 23:18:48,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:18:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-01-25 23:18:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-01-25 23:18:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-01-25 23:18:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-01-25 23:18:51,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-25 23:18:51,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-01-25 23:18:51,498 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:18:51,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:18:51,498 INFO L85 PathProgramCache]: Analyzing trace with hash 201363405, now seen corresponding path program 7 times [2024-01-25 23:18:51,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:18:51,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650625330] [2024-01-25 23:18:51,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:18:51,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:18:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:18:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2671 backedges. 2632 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:18:53,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:18:53,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650625330] [2024-01-25 23:18:53,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650625330] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-25 23:18:53,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127554261] [2024-01-25 23:18:53,784 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-25 23:18:53,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:53,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:18:53,785 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-25 23:18:53,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-25 23:18:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:18:53,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 42 conjunts are in the unsatisfiable core [2024-01-25 23:18:53,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-25 23:18:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2671 backedges. 1701 proven. 0 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-01-25 23:18:55,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-25 23:18:55,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127554261] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:18:55,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-25 23:18:55,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [68] total 109 [2024-01-25 23:18:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619099960] [2024-01-25 23:18:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:18:55,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-01-25 23:18:55,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:18:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-01-25 23:18:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1666, Invalid=10106, Unknown=0, NotChecked=0, Total=11772 [2024-01-25 23:18:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:55,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:18:55,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.232558139534884) internal successors, (225), 43 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-25 23:18:55,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:55,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:55,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:55,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-01-25 23:18:55,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-01-25 23:18:55,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-01-25 23:18:55,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2024-01-25 23:18:55,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:18:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:18:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-25 23:18:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-25 23:18:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-01-25 23:18:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-01-25 23:18:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-01-25 23:18:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-01-25 23:18:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-01-25 23:18:56,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-25 23:18:56,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-25 23:18:56,306 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:18:56,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:18:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash 836122772, now seen corresponding path program 8 times [2024-01-25 23:18:56,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:18:56,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721550786] [2024-01-25 23:18:56,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:18:56,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:18:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-25 23:18:56,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-25 23:18:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-25 23:18:56,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-25 23:18:56,434 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-25 23:18:56,435 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:18:56,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-25 23:18:56,443 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1] [2024-01-25 23:18:56,444 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/2) [2024-01-25 23:18:56,447 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-25 23:18:56,447 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-25 23:18:56,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 11:18:56 BasicIcfg [2024-01-25 23:18:56,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-25 23:18:56,534 INFO L158 Benchmark]: Toolchain (without parser) took 19977.18ms. Allocated memory was 235.9MB in the beginning and 503.3MB in the end (delta: 267.4MB). Free memory was 195.0MB in the beginning and 244.8MB in the end (delta: -49.8MB). Peak memory consumption was 218.6MB. Max. memory is 8.0GB. [2024-01-25 23:18:56,534 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-25 23:18:56,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.36ms. Allocated memory is still 235.9MB. Free memory was 195.0MB in the beginning and 156.2MB in the end (delta: 38.9MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2024-01-25 23:18:56,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.42ms. Allocated memory is still 235.9MB. Free memory was 156.2MB in the beginning and 153.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-25 23:18:56,535 INFO L158 Benchmark]: Boogie Preprocessor took 16.10ms. Allocated memory is still 235.9MB. Free memory was 153.6MB in the beginning and 152.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-25 23:18:56,535 INFO L158 Benchmark]: RCFGBuilder took 330.24ms. Allocated memory is still 235.9MB. Free memory was 152.0MB in the beginning and 137.9MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-01-25 23:18:56,535 INFO L158 Benchmark]: TraceAbstraction took 19104.49ms. Allocated memory was 235.9MB in the beginning and 503.3MB in the end (delta: 267.4MB). Free memory was 137.4MB in the beginning and 244.8MB in the end (delta: -107.5MB). Peak memory consumption was 160.9MB. Max. memory is 8.0GB. [2024-01-25 23:18:56,536 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 484.36ms. Allocated memory is still 235.9MB. Free memory was 195.0MB in the beginning and 156.2MB in the end (delta: 38.9MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.42ms. Allocated memory is still 235.9MB. Free memory was 156.2MB in the beginning and 153.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.10ms. Allocated memory is still 235.9MB. Free memory was 153.6MB in the beginning and 152.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 330.24ms. Allocated memory is still 235.9MB. Free memory was 152.0MB in the beginning and 137.9MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 19104.49ms. Allocated memory was 235.9MB in the beginning and 503.3MB in the end (delta: 267.4MB). Free memory was 137.4MB in the beginning and 244.8MB in the end (delta: -107.5MB). Peak memory consumption was 160.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2839, independent: 2746, independent conditional: 2746, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2750, independent: 2746, independent conditional: 2746, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2750, independent: 2746, independent conditional: 2746, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2758, independent: 2746, independent conditional: 0, independent unconditional: 2746, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2758, independent: 2746, independent conditional: 0, independent unconditional: 2746, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2758, independent: 2746, independent conditional: 0, independent unconditional: 2746, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2750, independent: 2746, independent conditional: 0, independent unconditional: 2746, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2750, independent: 2746, independent conditional: 0, independent unconditional: 2746, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2758, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2750, unknown conditional: 0, unknown unconditional: 2750] , Statistics on independence cache: Total cache size (in pairs): 2750, Positive cache size: 2746, Positive conditional cache size: 0, Positive unconditional cache size: 2746, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 4, Independence queries for same thread: 89 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 21, RedundantProofs: 5, ProvenStates: 619, Times there's more than one choice: 460, Avg number of choices: 3.756058158319871 - StatisticsResult: Reduction benchmarks 0.1s Time before loop, 0.8s Time in loop, 0.8s Time in total, Has Loop: true, Protected Variables: [ULTIMATE.start___VERIFIER_assert_~cond#1, ~myglobal~0, ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, ULTIMATE.start___VERIFIER_assert_#in~cond#1, thread_function_dataraceThread1of1ForFork0_~i~0, thread_function_dataraceThread1of1ForFork0_~j~0], Protected Variables before encountering a loop: [] - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; VAL [myglobal=0] [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [myglobal=0] [L1340] 0 pthread_t mythread; VAL [myglobal=0, mythread={3:0}] [L1341] 0 int i; VAL [myglobal=0, mythread={3:0}] [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [arg={0:0}, myglobal=0, mythread={3:0}] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) VAL [arg={0:0}, myglobal=0, mythread={3:0}] [L1352] 0 i=0 VAL [arg={0:0}, i=0, myglobal=0, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=0, myglobal=0, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=0, myglobal=1, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=1, myglobal=1, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=1, myglobal=1, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=1, myglobal=2, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=2, myglobal=2, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=2, myglobal=2, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=2, myglobal=3, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=3, myglobal=3, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=3, myglobal=3, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=3, myglobal=4, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=4, myglobal=4, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=4, myglobal=4, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=4, myglobal=5, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=5, myglobal=5, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=5, myglobal=5, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=5, myglobal=6, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=6, myglobal=6, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=6, myglobal=6, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=6, myglobal=7, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=7, myglobal=7, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=7, myglobal=7, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=7, myglobal=8, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=8, myglobal=8, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=8, myglobal=8, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=8, myglobal=9, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=9, myglobal=9, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=9, myglobal=9, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=9, myglobal=10, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=10, myglobal=10, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=10, myglobal=10, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=10, myglobal=11, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=11, myglobal=11, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=11, myglobal=11, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=11, myglobal=12, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=12, myglobal=12, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=12, myglobal=12, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=12, myglobal=13, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=13, myglobal=13, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=13, myglobal=13, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=13, myglobal=14, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=14, myglobal=14, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=14, myglobal=14, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=14, myglobal=15, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=15, myglobal=15, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=15, myglobal=15, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=15, myglobal=16, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=16, myglobal=16, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=16, myglobal=16, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=16, myglobal=17, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=17, myglobal=17, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=17, myglobal=17, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=17, myglobal=18, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=18, myglobal=18, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=18, myglobal=18, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=18, myglobal=19, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=19, myglobal=19, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=19, myglobal=19, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=19, myglobal=20, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=20, myglobal=20, mythread={3:0}] [L1352] COND FALSE 0 !(i<20) VAL [arg={0:0}, i=20, myglobal=20, mythread={3:0}] [L1358] 0 \read(mythread) VAL [arg={0:0}, i=20, myglobal=20, mythread={3:0}] [L1324] 1 int i,j; VAL [arg={0:0}, arg={0:0}, myglobal=20] [L1325] 1 i=0 VAL [arg={0:0}, arg={0:0}, i=0, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=0, myglobal=20] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=0, j=20, myglobal=20] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=0, j=21, myglobal=20] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=0, j=21, myglobal=21] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=1, j=22, myglobal=21] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=1, j=22, myglobal=22] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=2, j=23, myglobal=22] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=2, j=23, myglobal=23] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=3, j=24, myglobal=23] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=3, j=24, myglobal=24] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=4, j=25, myglobal=24] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=4, j=25, myglobal=25] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=5, j=26, myglobal=25] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=5, j=26, myglobal=26] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=6, j=27, myglobal=26] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=6, j=27, myglobal=27] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=7, j=28, myglobal=27] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=7, j=28, myglobal=28] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=8, j=29, myglobal=28] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=8, j=29, myglobal=29] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=9, j=30, myglobal=29] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=9, j=30, myglobal=30] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=10, j=31, myglobal=30] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=10, j=31, myglobal=31] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=11, j=32, myglobal=31] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=11, j=32, myglobal=32] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=12, j=33, myglobal=32] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=12, j=33, myglobal=33] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=13, j=34, myglobal=33] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=13, j=34, myglobal=34] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=14, j=35, myglobal=34] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=14, j=35, myglobal=35] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=15, j=36, myglobal=35] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=15, j=36, myglobal=36] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=16, j=37, myglobal=36] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=16, j=37, myglobal=37] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=17, j=38, myglobal=37] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=17, j=38, myglobal=38] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=18, j=39, myglobal=38] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=18, j=39, myglobal=39] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=19, j=40, myglobal=39] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1325] COND FALSE 1 !(i<20) VAL [arg={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1336] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\result={0:0}, arg={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread={3:0}] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) VAL [\result={0:0}, arg={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread={3:0}] [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(cond)=0, \result={0:0}, arg={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] [L13] 0 reach_error() VAL [\old(cond)=0, \result={0:0}, arg={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 3 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 6.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 417, 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, 9.7s InterpolantComputationTime, 3020 NumberOfCodeBlocks, 2995 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 3441 ConstructedInterpolants, 0 QuantifiedInterpolants, 6583 SizeOfPredicates, 146 NumberOfNonLiveVariables, 2262 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 20 InterpolantComputations, 3 PerfectInterpolantSequences, 12215/16422 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-01-25 23:18:56,554 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-01-25 23:18:56,758 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...