/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 08:22:06,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 08:22:06,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-03 08:22:06,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 08:22:06,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 08:22:06,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 08:22:06,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 08:22:06,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 08:22:06,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 08:22:06,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 08:22:06,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 08:22:06,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 08:22:06,287 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 08:22:06,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 08:22:06,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 08:22:06,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 08:22:06,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 08:22:06,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 08:22:06,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 08:22:06,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 08:22:06,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 08:22:06,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 08:22:06,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 08:22:06,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 08:22:06,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 08:22:06,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 08:22:06,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 08:22:06,292 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 08:22:06,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 08:22:06,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 08:22:06,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 08:22:06,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 08:22:06,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 08:22:06,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 08:22:06,295 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-03 08:22:06,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-03 08:22:06,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 08:22:06,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 08:22:06,309 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 08:22:06,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-03 08:22:06,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 08:22:06,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 08:22:06,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 08:22:06,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 08:22:06,547 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 08:22:06,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2024-05-03 08:22:07,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 08:22:07,890 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 08:22:07,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2024-05-03 08:22:07,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bf54e6f07/2e9a034b24d845a99220c1c6926c6849/FLAG0e29a1a68 [2024-05-03 08:22:07,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bf54e6f07/2e9a034b24d845a99220c1c6926c6849 [2024-05-03 08:22:07,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 08:22:07,919 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 08:22:07,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 08:22:07,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 08:22:07,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 08:22:07,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 08:22:07" (1/1) ... [2024-05-03 08:22:07,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14449f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:07, skipping insertion in model container [2024-05-03 08:22:07,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 08:22:07" (1/1) ... [2024-05-03 08:22:07,956 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 08:22:08,189 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c[2761,2774] [2024-05-03 08:22:08,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 08:22:08,218 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 08:22:08,257 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c[2761,2774] [2024-05-03 08:22:08,261 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 08:22:08,276 INFO L206 MainTranslator]: Completed translation [2024-05-03 08:22:08,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08 WrapperNode [2024-05-03 08:22:08,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 08:22:08,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 08:22:08,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 08:22:08,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 08:22:08,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,345 INFO L138 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 206 [2024-05-03 08:22:08,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 08:22:08,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 08:22:08,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 08:22:08,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 08:22:08,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 08:22:08,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 08:22:08,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 08:22:08,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 08:22:08,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (1/1) ... [2024-05-03 08:22:08,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 08:22:08,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:22:08,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-03 08:22:08,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-03 08:22:08,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 08:22:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 08:22:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 08:22:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 08:22:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 08:22:08,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 08:22:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 08:22:08,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 08:22:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-03 08:22:08,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-03 08:22:08,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 08:22:08,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-03 08:22:08,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-03 08:22:08,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-03 08:22:08,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 08:22:08,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 08:22:08,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 08:22:08,510 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 08:22:08,625 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 08:22:08,626 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 08:22:08,914 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 08:22:09,060 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 08:22:09,060 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-03 08:22:09,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 08:22:09 BoogieIcfgContainer [2024-05-03 08:22:09,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 08:22:09,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 08:22:09,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 08:22:09,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 08:22:09,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 08:22:07" (1/3) ... [2024-05-03 08:22:09,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dda5bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 08:22:09, skipping insertion in model container [2024-05-03 08:22:09,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:22:08" (2/3) ... [2024-05-03 08:22:09,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dda5bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 08:22:09, skipping insertion in model container [2024-05-03 08:22:09,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 08:22:09" (3/3) ... [2024-05-03 08:22:09,070 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2024-05-03 08:22:09,080 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 08:22:09,087 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 08:22:09,087 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 08:22:09,087 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 08:22:09,139 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-03 08:22:09,181 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 08:22:09,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 08:22:09,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:22:09,184 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 08:22:09,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-03 08:22:09,216 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 08:22:09,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 08:22:09,228 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=LoopHeads, 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;@5623f642, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 08:22:09,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 08:22:09,474 INFO L78 Accepts]: Start accepts. Automaton has currently 829 states, but on-demand construction may add more states Word has length 129 [2024-05-03 08:22:09,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:22:09,476 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:22:09,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:22:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 53306258, now seen corresponding path program 1 times [2024-05-03 08:22:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:22:09,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982423515] [2024-05-03 08:22:09,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:22:09,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:22:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:22:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-03 08:22:09,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:22:09,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982423515] [2024-05-03 08:22:09,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982423515] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 08:22:09,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 08:22:09,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 08:22:09,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9408071] [2024-05-03 08:22:09,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 08:22:09,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 08:22:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:22:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 08:22:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 08:22:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:09,902 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:22:09,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 08:22:09,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:09,974 INFO L78 Accepts]: Start accepts. Automaton has currently 829 states, but on-demand construction may add more states Word has length 125 [2024-05-03 08:22:09,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:22:09,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 08:22:09,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:22:09,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:22:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1626378678, now seen corresponding path program 1 times [2024-05-03 08:22:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:22:09,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365174615] [2024-05-03 08:22:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:22:09,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:22:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:22:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-03 08:22:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:22:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365174615] [2024-05-03 08:22:10,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365174615] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 08:22:10,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 08:22:10,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-03 08:22:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050565143] [2024-05-03 08:22:10,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 08:22:10,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-03 08:22:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:22:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-03 08:22:10,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-03 08:22:10,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:10,521 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:22:10,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 08:22:10,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:10,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:10,753 INFO L78 Accepts]: Start accepts. Automaton has currently 837 states, but on-demand construction may add more states Word has length 133 [2024-05-03 08:22:10,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:22:10,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 08:22:10,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:22:10,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:22:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash -880960989, now seen corresponding path program 1 times [2024-05-03 08:22:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:22:10,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210891969] [2024-05-03 08:22:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:22:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:22:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:22:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-03 08:22:11,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:22:11,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210891969] [2024-05-03 08:22:11,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210891969] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:22:11,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195065423] [2024-05-03 08:22:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:22:11,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:22:11,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:22:11,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:22:11,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-03 08:22:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:22:11,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-03 08:22:11,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:22:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-03 08:22:11,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:22:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-03 08:22:11,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195065423] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-03 08:22:11,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-03 08:22:11,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-05-03 08:22:11,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651465514] [2024-05-03 08:22:11,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 08:22:11,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-03 08:22:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:22:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-03 08:22:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-05-03 08:22:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:11,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:22:11,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 08:22:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:11,733 INFO L78 Accepts]: Start accepts. Automaton has currently 250 states, but on-demand construction may add more states Word has length 139 [2024-05-03 08:22:11,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:22:11,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-03 08:22:11,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-03 08:22:11,941 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:22:11,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:22:11,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1222851581, now seen corresponding path program 1 times [2024-05-03 08:22:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:22:11,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334646673] [2024-05-03 08:22:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:22:11,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:22:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:22:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-03 08:22:12,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:22:12,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334646673] [2024-05-03 08:22:12,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334646673] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:22:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353590806] [2024-05-03 08:22:12,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:22:12,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:22:12,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:22:12,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:22:12,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-03 08:22:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:22:12,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-03 08:22:12,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:22:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-03 08:22:12,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:22:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-03 08:22:12,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353590806] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 08:22:12,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 08:22:12,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-05-03 08:22:12,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252171165] [2024-05-03 08:22:12,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 08:22:12,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-03 08:22:12,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:22:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-03 08:22:12,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2024-05-03 08:22:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:12,774 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:22:12,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.36) internal successors, (184), 25 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 08:22:12,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:12,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:12,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:12,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 08:22:13,074 INFO L78 Accepts]: Start accepts. Automaton has currently 259 states, but on-demand construction may add more states Word has length 147 [2024-05-03 08:22:13,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:22:13,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-03 08:22:13,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:22:13,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:22:13,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:22:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash -697400918, now seen corresponding path program 2 times [2024-05-03 08:22:13,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:22:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850727226] [2024-05-03 08:22:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:22:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:22:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:22:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-03 08:22:13,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:22:13,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850727226] [2024-05-03 08:22:13,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850727226] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:22:13,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781615651] [2024-05-03 08:22:13,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 08:22:13,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:22:13,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:22:13,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:22:13,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-03 08:22:13,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 08:22:13,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 08:22:13,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-03 08:22:13,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:22:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-05-03 08:22:13,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:22:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-05-03 08:22:13,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781615651] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 08:22:13,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 08:22:13,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2024-05-03 08:22:13,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98892854] [2024-05-03 08:22:13,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 08:22:13,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-05-03 08:22:13,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:22:13,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-05-03 08:22:13,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-05-03 08:22:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:13,872 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:22:13,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.761904761904763) internal successors, (226), 21 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 08:22:13,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:13,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:13,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:13,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-03 08:22:13,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:14,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:14,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:14,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 08:22:14,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-03 08:22:14,360 INFO L78 Accepts]: Start accepts. Automaton has currently 761 states, but on-demand construction may add more states Word has length 153 [2024-05-03 08:22:14,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:22:14,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-03 08:22:14,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:22:14,569 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:22:14,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:22:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash 78914116, now seen corresponding path program 3 times [2024-05-03 08:22:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:22:14,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152721494] [2024-05-03 08:22:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:22:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:22:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:22:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-03 08:22:14,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:22:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152721494] [2024-05-03 08:22:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152721494] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:22:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232751608] [2024-05-03 08:22:14,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 08:22:14,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:22:14,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:22:14,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:22:14,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-03 08:22:15,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-03 08:22:15,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 08:22:15,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-03 08:22:15,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:22:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-03 08:22:15,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:22:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-03 08:22:15,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232751608] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 08:22:15,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 08:22:15,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 29 [2024-05-03 08:22:15,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383411099] [2024-05-03 08:22:15,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 08:22:15,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-05-03 08:22:15,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:22:15,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-05-03 08:22:15,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2024-05-03 08:22:15,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:15,610 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:22:15,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.344827586206897) internal successors, (242), 29 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 08:22:15,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:15,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:15,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:15,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-03 08:22:15,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-03 08:22:15,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:16,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:22:16,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:16,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:22:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 08:22:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-03 08:22:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-03 08:22:16,227 INFO L78 Accepts]: Start accepts. Automaton has currently 789 states, but on-demand construction may add more states Word has length 167 [2024-05-03 08:22:16,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:22:16,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-03 08:22:16,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-03 08:22:16,435 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:22:16,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:22:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2052461707, now seen corresponding path program 4 times [2024-05-03 08:22:16,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:22:16,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892113247] [2024-05-03 08:22:16,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:22:16,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:22:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-03 08:22:16,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-03 08:22:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-03 08:22:16,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-03 08:22:16,679 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-03 08:22:16,680 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 08:22:16,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-03 08:22:16,693 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-05-03 08:22:16,694 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/4) [2024-05-03 08:22:16,698 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 08:22:16,698 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 08:22:16,773 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-03 08:22:16,777 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-03 08:22:16,780 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-03 08:22:16,781 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-03 08:22:16,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 08:22:16 BasicIcfg [2024-05-03 08:22:16,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 08:22:16,793 INFO L158 Benchmark]: Toolchain (without parser) took 8873.83ms. Allocated memory was 260.0MB in the beginning and 313.5MB in the end (delta: 53.5MB). Free memory was 187.8MB in the beginning and 132.9MB in the end (delta: 54.9MB). Peak memory consumption was 109.5MB. Max. memory is 8.0GB. [2024-05-03 08:22:16,793 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 260.0MB. Free memory is still 226.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 08:22:16,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.76ms. Allocated memory is still 260.0MB. Free memory was 187.7MB in the beginning and 175.3MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-03 08:22:16,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.05ms. Allocated memory is still 260.0MB. Free memory was 175.3MB in the beginning and 173.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 08:22:16,794 INFO L158 Benchmark]: Boogie Preprocessor took 51.22ms. Allocated memory is still 260.0MB. Free memory was 172.9MB in the beginning and 171.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 08:22:16,794 INFO L158 Benchmark]: RCFGBuilder took 663.28ms. Allocated memory is still 260.0MB. Free memory was 171.2MB in the beginning and 196.8MB in the end (delta: -25.7MB). Peak memory consumption was 16.1MB. Max. memory is 8.0GB. [2024-05-03 08:22:16,794 INFO L158 Benchmark]: TraceAbstraction took 7729.30ms. Allocated memory was 260.0MB in the beginning and 313.5MB in the end (delta: 53.5MB). Free memory was 195.8MB in the beginning and 132.9MB in the end (delta: 62.9MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. [2024-05-03 08:22:16,795 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.12ms. Allocated memory is still 260.0MB. Free memory is still 226.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 356.76ms. Allocated memory is still 260.0MB. Free memory was 187.7MB in the beginning and 175.3MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.05ms. Allocated memory is still 260.0MB. Free memory was 175.3MB in the beginning and 173.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.22ms. Allocated memory is still 260.0MB. Free memory was 172.9MB in the beginning and 171.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 663.28ms. Allocated memory is still 260.0MB. Free memory was 171.2MB in the beginning and 196.8MB in the end (delta: -25.7MB). Peak memory consumption was 16.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7729.30ms. Allocated memory was 260.0MB in the beginning and 313.5MB in the end (delta: 53.5MB). Free memory was 195.8MB in the beginning and 132.9MB in the end (delta: 62.9MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9130, independent: 8427, independent conditional: 8427, independent unconditional: 0, dependent: 703, dependent conditional: 703, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8540, independent: 8427, independent conditional: 8427, independent unconditional: 0, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8540, independent: 8427, independent conditional: 8427, independent unconditional: 0, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8839, independent: 8427, independent conditional: 0, independent unconditional: 8427, dependent: 412, dependent conditional: 299, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8839, independent: 8427, independent conditional: 0, independent unconditional: 8427, dependent: 412, dependent conditional: 0, dependent unconditional: 412, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8839, independent: 8427, independent conditional: 0, independent unconditional: 8427, dependent: 412, dependent conditional: 0, dependent unconditional: 412, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 314, independent: 311, independent conditional: 0, independent unconditional: 311, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 314, independent: 311, independent conditional: 0, independent unconditional: 311, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8839, independent: 8116, independent conditional: 0, independent unconditional: 8116, dependent: 409, dependent conditional: 0, dependent unconditional: 409, unknown: 314, unknown conditional: 0, unknown unconditional: 314] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 311, Positive conditional cache size: 0, Positive unconditional cache size: 311, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 299, Maximal queried relation: 6, Independence queries for same thread: 590 - StatisticsResult: Visitor Statistics States: 852, Transitions: 1093, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 852, Transitions: 1020, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 859, Transitions: 1027, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 185, Transitions: 193, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 193, Transitions: 201, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 743, Transitions: 879, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 757, Transitions: 893, Traversal time: 0.6s - CounterExampleResult [Line: 104]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L40] 0 int* A; VAL [A={0:0}] [L41] 0 int res1, res2, M, N; VAL [A={0:0}, M=0, N=0, res1=0, res2=0] [L86] 0 pthread_t t1, t2, t3; VAL [A={0:0}, M=0, N=0, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L89] 0 M = __VERIFIER_nondet_int() VAL [A={0:0}, M=2, N=0, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L90] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L91] CALL, EXPR 0 create_fresh_int_array(N) [L110] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) VAL [A={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L110] RET 0 assume_abort_if_not(size >= 0) [L111] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) VAL [A={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L111] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L113] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, res1=0, res2=0, size=3] [L114] 0 int i = 0; VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=0, res1=0, res2=0, size=3] [L114] COND TRUE 0 i < size VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=0, res1=0, res2=0, size=3] [L115] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=0, res1=0, res2=0, size=3] [L114] 0 i++ VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=1, res1=0, res2=0, size=3] [L114] COND TRUE 0 i < size VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=1, res1=0, res2=0, size=3] [L115] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=1, res1=0, res2=0, size=3] [L114] 0 i++ VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=2, res1=0, res2=0, size=3] [L114] COND TRUE 0 i < size VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=2, res1=0, res2=0, size=3] [L115] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=2, res1=0, res2=0, size=3] [L114] 0 i++ VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=3, res1=0, res2=0, size=3] [L114] COND FALSE 0 !(i < size) VAL [A={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=3, res1=0, res2=0, size=3] [L117] 0 return arr; VAL [A={0:0}, M=2, N=3, \old(size)=3, \result={3:0}, arr={3:0}, res1=0, res2=0, size=3] [L91] RET, EXPR 0 create_fresh_int_array(N) [L91] 0 A = create_fresh_int_array(N) VAL [A={3:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L93] CALL 0 assume_abort_if_not(M >= 0 && M <= N) [L37] COND FALSE 0 !(!cond) VAL [A={3:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L93] RET 0 assume_abort_if_not(M >= 0 && M <= N) [L96] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L97] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L98] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [A={3:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L99] 0 \read(t1) VAL [A={3:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L47] 1 int i=0; VAL [A={3:0}, M=2, N=3, i=0, res1=0, res2=0] [L47] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L121] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L122] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L122] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L123] 1 return a + b; [L49] RET, EXPR 1 plus(res1, A[i]) [L49] 1 int tmp = plus(res1, A[i]); [L52] 1 res1 = tmp VAL [A={3:0}, M=2, N=3, i=0, res1=9, res2=0, tmp=9] [L47] 1 i++ VAL [A={3:0}, M=2, N=3, i=1, res1=9, res2=0, tmp=9] [L47] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L121] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L122] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L122] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L123] 1 return a + b; [L49] RET, EXPR 1 plus(res1, A[i]) [L49] 1 int tmp = plus(res1, A[i]); [L52] 1 res1 = tmp VAL [A={3:0}, M=2, N=3, i=1, res1=1, res2=0, tmp=1] [L47] 1 i++ VAL [A={3:0}, M=2, N=3, i=2, res1=1, res2=0, tmp=1] [L47] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L121] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L122] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L122] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L123] 1 return a + b; [L49] RET, EXPR 1 plus(res1, A[i]) [L49] 1 int tmp = plus(res1, A[i]); [L52] 1 res1 = tmp VAL [A={3:0}, M=2, N=3, i=2, res1=1, res2=0, tmp=1] [L47] 1 i++ VAL [A={3:0}, M=2, N=3, i=3, res1=1, res2=0, tmp=1] [L47] COND FALSE 1 !(i= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L121] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L122] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L122] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L123] 2 return a + b; [L62] RET, EXPR 2 plus(res2, A[i]) [L62] 2 int tmp = plus(res2, A[i]); [L73] 3 int i=M; VAL [A={3:0}, M=2, N=3, i=2, res1=1, res2=0] [L73] COND TRUE 3 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L121] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L122] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L122] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L123] 3 return a + b; [L75] RET, EXPR 3 plus(res2, A[i]) [L75] 3 int tmp = plus(res2, A[i]); [L65] 2 res2 = tmp VAL [A={3:0}, M=2, N=3, i=0, res1=1, res2=9, tmp=9] [L60] 2 i++ VAL [A={3:0}, M=2, N=3, i=1, res1=1, res2=9, tmp=9] [L60] COND TRUE 2 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L121] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L122] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L122] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L123] 2 return a + b; [L62] RET, EXPR 2 plus(res2, A[i]) [L62] 2 int tmp = plus(res2, A[i]); [L65] 2 res2 = tmp VAL [A={3:0}, M=2, N=3, i=1, res1=1, res2=-8, tmp=-8] [L60] 2 i++ VAL [A={3:0}, M=2, N=3, i=2, res1=1, res2=-8, tmp=-8] [L60] COND FALSE 2 !(i