/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:19:25,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:19:25,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:19:25,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:19:25,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:19:25,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:19:25,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:19:25,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:19:25,194 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:19:25,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:19:25,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:19:25,198 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:19:25,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:19:25,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:19:25,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:19:25,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:19:25,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:19:25,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:19:25,199 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:19:25,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:19:25,200 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:19:25,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:19:25,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:19:25,201 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:19:25,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:19:25,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:19:25,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:19:25,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:19:25,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:19:25,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:19:25,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:19:25,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:19:25,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:19:25,203 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/UAutomizer-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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:19:25,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:19:25,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:19:25,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:19:25,558 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:19:25,564 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:19:25,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2023-12-05 21:19:26,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:19:26,991 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:19:26,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2023-12-05 21:19:26,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cfed6a7e/bf0072c3e08a4ca697c2d488e6b8ef9f/FLAGab4a95962 [2023-12-05 21:19:27,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cfed6a7e/bf0072c3e08a4ca697c2d488e6b8ef9f [2023-12-05 21:19:27,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:19:27,009 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:19:27,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:19:27,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:19:27,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:19:27,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58261fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27, skipping insertion in model container [2023-12-05 21:19:27,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,038 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:19:27,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:19:27,155 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:19:27,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:19:27,193 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:19:27,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27 WrapperNode [2023-12-05 21:19:27,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:19:27,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:19:27,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:19:27,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:19:27,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,219 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2023-12-05 21:19:27,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:19:27,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:19:27,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:19:27,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:19:27,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:19:27,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:19:27,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:19:27,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:19:27,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (1/1) ... [2023-12-05 21:19:27,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:19:27,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:19:27,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:19:27,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:19:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:19:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-05 21:19:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-05 21:19:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-05 21:19:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-05 21:19:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-05 21:19:27,301 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-05 21:19:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-12-05 21:19:27,301 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-12-05 21:19:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:19:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:19:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:19:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:19:27,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:19:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:19:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:19:27,303 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:19:27,371 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:19:27,373 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:19:27,685 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:19:27,694 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:19:27,694 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-05 21:19:27,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:19:27 BoogieIcfgContainer [2023-12-05 21:19:27,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:19:27,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:19:27,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:19:27,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:19:27,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:19:27" (1/3) ... [2023-12-05 21:19:27,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45982782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:19:27, skipping insertion in model container [2023-12-05 21:19:27,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:27" (2/3) ... [2023-12-05 21:19:27,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45982782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:19:27, skipping insertion in model container [2023-12-05 21:19:27,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:19:27" (3/3) ... [2023-12-05 21:19:27,703 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2023-12-05 21:19:27,715 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:19:27,715 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-12-05 21:19:27,716 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:19:27,795 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:19:27,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 172 transitions, 372 flow [2023-12-05 21:19:27,900 INFO L124 PetriNetUnfolderBase]: 10/168 cut-off events. [2023-12-05 21:19:27,900 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-12-05 21:19:27,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 168 events. 10/168 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 206 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-12-05 21:19:27,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 172 transitions, 372 flow [2023-12-05 21:19:27,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 142 transitions, 305 flow [2023-12-05 21:19:27,917 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:19:27,921 INFO L362 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=PETRI_NET, 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;@717b2dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:19:27,921 INFO L363 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-12-05 21:19:27,928 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:19:27,929 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-12-05 21:19:27,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:19:27,929 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:27,929 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:27,930 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:27,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash 545791985, now seen corresponding path program 1 times [2023-12-05 21:19:27,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:27,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261311107] [2023-12-05 21:19:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:27,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:28,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:28,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261311107] [2023-12-05 21:19:28,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261311107] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:28,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:28,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:28,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444118263] [2023-12-05 21:19:28,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:28,445 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:28,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:28,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:28,474 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 172 [2023-12-05 21:19:28,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 142 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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) [2023-12-05 21:19:28,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:28,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 172 [2023-12-05 21:19:28,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:28,542 INFO L124 PetriNetUnfolderBase]: 4/135 cut-off events. [2023-12-05 21:19:28,542 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:19:28,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 135 events. 4/135 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 177 event pairs, 0 based on Foata normal form. 49/171 useless extension candidates. Maximal degree in co-relation 128. Up to 27 conditions per place. [2023-12-05 21:19:28,545 INFO L140 encePairwiseOnDemand]: 164/172 looper letters, 30 selfloop transitions, 1 changer transitions 1/135 dead transitions. [2023-12-05 21:19:28,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 135 transitions, 353 flow [2023-12-05 21:19:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-12-05 21:19:28,555 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8003875968992248 [2023-12-05 21:19:28,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-12-05 21:19:28,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-12-05 21:19:28,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:28,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-12-05 21:19:28,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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) [2023-12-05 21:19:28,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:28,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:28,581 INFO L308 CegarLoopForPetriNet]: 146 programPoint places, 0 predicate places. [2023-12-05 21:19:28,582 INFO L500 AbstractCegarLoop]: Abstraction has has 146 places, 135 transitions, 353 flow [2023-12-05 21:19:28,582 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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) [2023-12-05 21:19:28,582 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:28,582 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:28,582 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:19:28,583 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:28,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash 545791986, now seen corresponding path program 1 times [2023-12-05 21:19:28,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:28,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148044378] [2023-12-05 21:19:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:28,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148044378] [2023-12-05 21:19:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148044378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:28,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:28,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:19:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66976333] [2023-12-05 21:19:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:28,875 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:19:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:28,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:19:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:19:28,877 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 172 [2023-12-05 21:19:28,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 135 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 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) [2023-12-05 21:19:28,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:28,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 172 [2023-12-05 21:19:28,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:28,956 INFO L124 PetriNetUnfolderBase]: 4/133 cut-off events. [2023-12-05 21:19:28,957 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-12-05 21:19:28,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 133 events. 4/133 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 172 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 147. Up to 31 conditions per place. [2023-12-05 21:19:28,960 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 34 selfloop transitions, 1 changer transitions 1/133 dead transitions. [2023-12-05 21:19:28,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 133 transitions, 415 flow [2023-12-05 21:19:28,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-12-05 21:19:28,964 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7635658914728682 [2023-12-05 21:19:28,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-12-05 21:19:28,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-12-05 21:19:28,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:28,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-12-05 21:19:28,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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) [2023-12-05 21:19:28,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:28,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:28,968 INFO L308 CegarLoopForPetriNet]: 146 programPoint places, 0 predicate places. [2023-12-05 21:19:28,969 INFO L500 AbstractCegarLoop]: Abstraction has has 146 places, 133 transitions, 415 flow [2023-12-05 21:19:28,969 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 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) [2023-12-05 21:19:28,969 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:28,969 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:28,970 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:19:28,970 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:28,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:28,971 INFO L85 PathProgramCache]: Analyzing trace with hash 136690102, now seen corresponding path program 1 times [2023-12-05 21:19:28,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:28,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846926629] [2023-12-05 21:19:28,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:28,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:29,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:29,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846926629] [2023-12-05 21:19:29,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846926629] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:29,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:29,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:19:29,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159339104] [2023-12-05 21:19:29,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:29,124 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:19:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:19:29,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:19:29,129 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 172 [2023-12-05 21:19:29,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 133 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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) [2023-12-05 21:19:29,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:29,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 172 [2023-12-05 21:19:29,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:29,194 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2023-12-05 21:19:29,195 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-12-05 21:19:29,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 129 events. 4/129 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 157 event pairs, 0 based on Foata normal form. 2/122 useless extension candidates. Maximal degree in co-relation 161. Up to 27 conditions per place. [2023-12-05 21:19:29,196 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 30 selfloop transitions, 1 changer transitions 1/129 dead transitions. [2023-12-05 21:19:29,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 129 transitions, 457 flow [2023-12-05 21:19:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-12-05 21:19:29,197 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7596899224806202 [2023-12-05 21:19:29,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-12-05 21:19:29,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-12-05 21:19:29,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:29,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-12-05 21:19:29,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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) [2023-12-05 21:19:29,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:29,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:29,201 INFO L308 CegarLoopForPetriNet]: 146 programPoint places, -2 predicate places. [2023-12-05 21:19:29,201 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 129 transitions, 457 flow [2023-12-05 21:19:29,201 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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) [2023-12-05 21:19:29,201 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:29,201 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:29,202 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:19:29,202 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:29,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash 722123904, now seen corresponding path program 1 times [2023-12-05 21:19:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:29,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478337545] [2023-12-05 21:19:29,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:29,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:29,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:29,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478337545] [2023-12-05 21:19:29,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478337545] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:29,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:29,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730510381] [2023-12-05 21:19:29,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:29,278 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:29,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:29,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:29,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:29,282 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 172 [2023-12-05 21:19:29,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 129 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-12-05 21:19:29,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:29,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 172 [2023-12-05 21:19:29,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:29,331 INFO L124 PetriNetUnfolderBase]: 4/127 cut-off events. [2023-12-05 21:19:29,331 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-05 21:19:29,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 127 events. 4/127 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 148 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 174. Up to 25 conditions per place. [2023-12-05 21:19:29,333 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 26 selfloop transitions, 1 changer transitions 1/127 dead transitions. [2023-12-05 21:19:29,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 127 transitions, 495 flow [2023-12-05 21:19:29,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-12-05 21:19:29,334 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7829457364341085 [2023-12-05 21:19:29,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-12-05 21:19:29,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-12-05 21:19:29,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:29,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-12-05 21:19:29,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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) [2023-12-05 21:19:29,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:29,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:29,338 INFO L308 CegarLoopForPetriNet]: 146 programPoint places, -2 predicate places. [2023-12-05 21:19:29,339 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 127 transitions, 495 flow [2023-12-05 21:19:29,339 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-12-05 21:19:29,339 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:29,339 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:29,339 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:19:29,340 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:29,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:29,340 INFO L85 PathProgramCache]: Analyzing trace with hash 722123905, now seen corresponding path program 1 times [2023-12-05 21:19:29,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:29,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927186846] [2023-12-05 21:19:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:29,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:29,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:29,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927186846] [2023-12-05 21:19:29,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927186846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:29,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:29,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:29,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144038269] [2023-12-05 21:19:29,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:29,460 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:29,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:29,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:29,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:29,461 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 172 [2023-12-05 21:19:29,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 127 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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) [2023-12-05 21:19:29,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:29,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 172 [2023-12-05 21:19:29,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:29,507 INFO L124 PetriNetUnfolderBase]: 4/125 cut-off events. [2023-12-05 21:19:29,507 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2023-12-05 21:19:29,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 125 events. 4/125 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 2/122 useless extension candidates. Maximal degree in co-relation 185. Up to 23 conditions per place. [2023-12-05 21:19:29,509 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 23 selfloop transitions, 1 changer transitions 1/125 dead transitions. [2023-12-05 21:19:29,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 125 transitions, 527 flow [2023-12-05 21:19:29,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-12-05 21:19:29,510 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8003875968992248 [2023-12-05 21:19:29,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-12-05 21:19:29,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-12-05 21:19:29,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:29,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-12-05 21:19:29,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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) [2023-12-05 21:19:29,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:29,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:29,515 INFO L308 CegarLoopForPetriNet]: 146 programPoint places, -2 predicate places. [2023-12-05 21:19:29,515 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 125 transitions, 527 flow [2023-12-05 21:19:29,515 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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) [2023-12-05 21:19:29,516 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:29,516 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:29,516 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:19:29,516 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:29,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:29,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1951193440, now seen corresponding path program 1 times [2023-12-05 21:19:29,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:29,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341950535] [2023-12-05 21:19:29,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:29,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341950535] [2023-12-05 21:19:29,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341950535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:29,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762798832] [2023-12-05 21:19:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:29,652 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:29,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:29,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:29,654 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 172 [2023-12-05 21:19:29,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 125 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-12-05 21:19:29,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:29,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 172 [2023-12-05 21:19:29,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:29,735 INFO L124 PetriNetUnfolderBase]: 4/123 cut-off events. [2023-12-05 21:19:29,736 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2023-12-05 21:19:29,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 123 events. 4/123 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 135 event pairs, 0 based on Foata normal form. 2/120 useless extension candidates. Maximal degree in co-relation 196. Up to 21 conditions per place. [2023-12-05 21:19:29,737 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 23 selfloop transitions, 1 changer transitions 1/123 dead transitions. [2023-12-05 21:19:29,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 123 transitions, 559 flow [2023-12-05 21:19:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-12-05 21:19:29,738 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8003875968992248 [2023-12-05 21:19:29,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-12-05 21:19:29,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-12-05 21:19:29,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:29,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-12-05 21:19:29,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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) [2023-12-05 21:19:29,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:29,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:29,743 INFO L308 CegarLoopForPetriNet]: 146 programPoint places, -2 predicate places. [2023-12-05 21:19:29,743 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 123 transitions, 559 flow [2023-12-05 21:19:29,743 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-12-05 21:19:29,743 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:29,743 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:29,743 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:19:29,744 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:29,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1951193441, now seen corresponding path program 1 times [2023-12-05 21:19:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:29,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783573661] [2023-12-05 21:19:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:29,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:29,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:29,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783573661] [2023-12-05 21:19:29,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783573661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:29,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:29,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:29,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025121985] [2023-12-05 21:19:29,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:29,812 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:29,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:29,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:29,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:29,814 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 172 [2023-12-05 21:19:29,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 123 transitions, 559 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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) [2023-12-05 21:19:29,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:29,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 172 [2023-12-05 21:19:29,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:29,849 INFO L124 PetriNetUnfolderBase]: 4/121 cut-off events. [2023-12-05 21:19:29,849 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2023-12-05 21:19:29,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 121 events. 4/121 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 132 event pairs, 0 based on Foata normal form. 2/118 useless extension candidates. Maximal degree in co-relation 205. Up to 19 conditions per place. [2023-12-05 21:19:29,850 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 0 selfloop transitions, 0 changer transitions 121/121 dead transitions. [2023-12-05 21:19:29,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 121 transitions, 581 flow [2023-12-05 21:19:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-12-05 21:19:29,851 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7751937984496124 [2023-12-05 21:19:29,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-12-05 21:19:29,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-12-05 21:19:29,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:29,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-12-05 21:19:29,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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) [2023-12-05 21:19:29,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:29,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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) [2023-12-05 21:19:29,855 INFO L308 CegarLoopForPetriNet]: 146 programPoint places, -2 predicate places. [2023-12-05 21:19:29,855 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 121 transitions, 581 flow [2023-12-05 21:19:29,856 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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) [2023-12-05 21:19:29,864 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bench-exp2x9.wvr.c_BEv2_AllErrorsAtOnce [2023-12-05 21:19:29,888 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 20 remaining) [2023-12-05 21:19:29,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-12-05 21:19:29,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-12-05 21:19:29,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-12-05 21:19:29,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-12-05 21:19:29,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-12-05 21:19:29,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-12-05 21:19:29,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-12-05 21:19:29,889 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-12-05 21:19:29,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-12-05 21:19:29,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-12-05 21:19:29,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-12-05 21:19:29,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-12-05 21:19:29,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-12-05 21:19:29,890 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-12-05 21:19:29,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-12-05 21:19:29,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 20 remaining) [2023-12-05 21:19:29,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 20 remaining) [2023-12-05 21:19:29,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 20 remaining) [2023-12-05 21:19:29,891 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 20 remaining) [2023-12-05 21:19:29,892 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:19:29,892 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:29,895 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:19:29,895 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:19:29,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:19:29 BasicIcfg [2023-12-05 21:19:29,903 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:19:29,903 INFO L158 Benchmark]: Toolchain (without parser) took 2894.02ms. Allocated memory is still 346.0MB. Free memory was 294.5MB in the beginning and 264.6MB in the end (delta: 29.9MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. [2023-12-05 21:19:29,903 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 220.2MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:19:29,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.61ms. Allocated memory is still 346.0MB. Free memory was 294.2MB in the beginning and 282.5MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-05 21:19:29,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.81ms. Allocated memory is still 346.0MB. Free memory was 282.5MB in the beginning and 280.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:19:29,904 INFO L158 Benchmark]: Boogie Preprocessor took 28.71ms. Allocated memory is still 346.0MB. Free memory was 280.8MB in the beginning and 279.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:19:29,904 INFO L158 Benchmark]: RCFGBuilder took 445.29ms. Allocated memory is still 346.0MB. Free memory was 279.1MB in the beginning and 260.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-05 21:19:29,904 INFO L158 Benchmark]: TraceAbstraction took 2206.21ms. Allocated memory is still 346.0MB. Free memory was 259.5MB in the beginning and 264.6MB in the end (delta: -5.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:19:29,906 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 220.2MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.61ms. Allocated memory is still 346.0MB. Free memory was 294.2MB in the beginning and 282.5MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.81ms. Allocated memory is still 346.0MB. Free memory was 282.5MB in the beginning and 280.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.71ms. Allocated memory is still 346.0MB. Free memory was 280.8MB in the beginning and 279.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 445.29ms. Allocated memory is still 346.0MB. Free memory was 279.1MB in the beginning and 260.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2206.21ms. Allocated memory is still 346.0MB. Free memory was 259.5MB in the beginning and 264.6MB in the end (delta: -5.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 215 locations, 20 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 44 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=581occurred in iteration=7, InterpolantAutomatonStates: 21, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 1889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:19:29,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...