/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/pthread-wmm/safe014_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:09:25,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:09:25,610 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:09:25,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:09:25,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:09:25,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:09:25,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:09:25,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:09:25,643 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:09:25,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:09:25,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:09:25,647 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:09:25,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:09:25,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:09:25,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:09:25,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:09:25,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:09:25,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:09:25,649 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:09:25,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:09:25,649 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:09:25,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:09:25,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:09:25,650 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:09:25,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:09:25,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:25,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:09:25,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:09:25,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:09:25,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:09:25,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:09:25,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:09:25,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:09:25,652 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:09:25,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:09:25,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:09:25,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:09:25,869 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:09:25,869 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:09:25,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2023-12-05 21:09:26,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:09:27,241 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:09:27,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2023-12-05 21:09:27,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b4ab0a0/f6cc76eeb075423f8c1c48c8eee34523/FLAG8b66aec08 [2023-12-05 21:09:27,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b4ab0a0/f6cc76eeb075423f8c1c48c8eee34523 [2023-12-05 21:09:27,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:09:27,271 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:09:27,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:27,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:09:27,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:09:27,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3737df33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27, skipping insertion in model container [2023-12-05 21:09:27,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,337 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:09:27,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:27,667 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:09:27,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:27,764 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:27,764 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:27,769 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:09:27,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27 WrapperNode [2023-12-05 21:09:27,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:27,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:27,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:09:27,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:09:27,776 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:09:27" (1/1) ... [2023-12-05 21:09:27,806 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:09:27" (1/1) ... [2023-12-05 21:09:27,837 INFO L138 Inliner]: procedures = 176, calls = 68, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-12-05 21:09:27,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:27,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:09:27,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:09:27,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:09:27,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:09:27,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:09:27,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:09:27,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:09:27,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27" (1/1) ... [2023-12-05 21:09:27,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:27,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:09:27,903 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:09:27,907 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:09:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:09:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:09:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:09:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:09:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:09:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:09:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:09:27,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:09:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:09:27,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:09:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:09:27,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:09:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:09:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:09:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:09:27,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:09:27,926 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:09:28,021 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:09:28,023 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:09:28,331 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:09:28,565 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:09:28,565 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:09:28,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:28 BoogieIcfgContainer [2023-12-05 21:09:28,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:09:28,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:09:28,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:09:28,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:09:28,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:09:27" (1/3) ... [2023-12-05 21:09:28,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5885da19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:28, skipping insertion in model container [2023-12-05 21:09:28,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:27" (2/3) ... [2023-12-05 21:09:28,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5885da19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:28, skipping insertion in model container [2023-12-05 21:09:28,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:28" (3/3) ... [2023-12-05 21:09:28,576 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2023-12-05 21:09:28,591 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:09:28,591 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-12-05 21:09:28,591 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:09:28,671 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:09:28,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 163 transitions, 338 flow [2023-12-05 21:09:28,765 INFO L124 PetriNetUnfolderBase]: 3/160 cut-off events. [2023-12-05 21:09:28,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:28,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 160 events. 3/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 193 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-12-05 21:09:28,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 163 transitions, 338 flow [2023-12-05 21:09:28,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 160 transitions, 329 flow [2023-12-05 21:09:28,791 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:09:28,797 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;@246fb71e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:09:28,797 INFO L363 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-12-05 21:09:28,809 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:09:28,809 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-12-05 21:09:28,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:28,810 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:28,810 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] [2023-12-05 21:09:28,810 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:28,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:28,814 INFO L85 PathProgramCache]: Analyzing trace with hash 744394401, now seen corresponding path program 1 times [2023-12-05 21:09:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:28,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953919804] [2023-12-05 21:09:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:28,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:29,125 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:09:29,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:29,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953919804] [2023-12-05 21:09:29,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953919804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:29,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:29,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:29,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903208986] [2023-12-05 21:09:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:29,136 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:29,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:29,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:29,165 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 163 [2023-12-05 21:09:29,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 160 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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:09:29,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:29,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 163 [2023-12-05 21:09:29,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:29,759 INFO L124 PetriNetUnfolderBase]: 815/2107 cut-off events. [2023-12-05 21:09:29,759 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:09:29,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3489 conditions, 2107 events. 815/2107 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15185 event pairs, 520 based on Foata normal form. 76/1279 useless extension candidates. Maximal degree in co-relation 3414. Up to 879 conditions per place. [2023-12-05 21:09:29,777 INFO L140 encePairwiseOnDemand]: 147/163 looper letters, 50 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2023-12-05 21:09:29,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 421 flow [2023-12-05 21:09:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-12-05 21:09:29,793 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8118609406952966 [2023-12-05 21:09:29,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-12-05 21:09:29,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-12-05 21:09:29,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:29,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-12-05 21:09:29,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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:09:29,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:29,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:29,811 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -12 predicate places. [2023-12-05 21:09:29,812 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 421 flow [2023-12-05 21:09:29,812 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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:09:29,812 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:29,812 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] [2023-12-05 21:09:29,813 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:09:29,813 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:29,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:29,813 INFO L85 PathProgramCache]: Analyzing trace with hash 744394402, now seen corresponding path program 1 times [2023-12-05 21:09:29,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:29,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864143649] [2023-12-05 21:09:29,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:29,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:29,972 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:09:29,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:29,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864143649] [2023-12-05 21:09:29,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864143649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:29,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213034160] [2023-12-05 21:09:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:29,974 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:29,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:29,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:29,976 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 163 [2023-12-05 21:09:29,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:09:29,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:29,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 163 [2023-12-05 21:09:29,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:30,334 INFO L124 PetriNetUnfolderBase]: 821/2120 cut-off events. [2023-12-05 21:09:30,335 INFO L125 PetriNetUnfolderBase]: For 172/472 co-relation queries the response was YES. [2023-12-05 21:09:30,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 2120 events. 821/2120 cut-off events. For 172/472 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15223 event pairs, 526 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 4718. Up to 979 conditions per place. [2023-12-05 21:09:30,349 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 57 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2023-12-05 21:09:30,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 164 transitions, 579 flow [2023-12-05 21:09:30,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-12-05 21:09:30,351 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7750511247443763 [2023-12-05 21:09:30,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-12-05 21:09:30,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-12-05 21:09:30,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:30,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-12-05 21:09:30,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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:09:30,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:30,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:30,355 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -11 predicate places. [2023-12-05 21:09:30,355 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 164 transitions, 579 flow [2023-12-05 21:09:30,355 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:09:30,355 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:30,356 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, 1] [2023-12-05 21:09:30,356 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:09:30,356 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:30,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1338061287, now seen corresponding path program 1 times [2023-12-05 21:09:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:30,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502999782] [2023-12-05 21:09:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:30,533 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:09:30,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:30,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502999782] [2023-12-05 21:09:30,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502999782] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:30,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:30,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:30,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890473134] [2023-12-05 21:09:30,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:30,538 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:30,541 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 163 [2023-12-05 21:09:30,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 164 transitions, 579 flow. Second operand has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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:09:30,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:30,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 163 [2023-12-05 21:09:30,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:30,911 INFO L124 PetriNetUnfolderBase]: 558/1675 cut-off events. [2023-12-05 21:09:30,911 INFO L125 PetriNetUnfolderBase]: For 386/620 co-relation queries the response was YES. [2023-12-05 21:09:30,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4583 conditions, 1675 events. 558/1675 cut-off events. For 386/620 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11805 event pairs, 195 based on Foata normal form. 0/1171 useless extension candidates. Maximal degree in co-relation 4491. Up to 657 conditions per place. [2023-12-05 21:09:30,922 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 63 selfloop transitions, 13 changer transitions 0/176 dead transitions. [2023-12-05 21:09:30,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 176 transitions, 799 flow [2023-12-05 21:09:30,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:09:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:09:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 825 transitions. [2023-12-05 21:09:30,924 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7230499561787905 [2023-12-05 21:09:30,924 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 825 transitions. [2023-12-05 21:09:30,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 825 transitions. [2023-12-05 21:09:30,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:30,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 825 transitions. [2023-12-05 21:09:30,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 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:09:30,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 163.0) internal successors, (1304), 8 states have internal predecessors, (1304), 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:09:30,927 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 163.0) internal successors, (1304), 8 states have internal predecessors, (1304), 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:09:30,928 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -7 predicate places. [2023-12-05 21:09:30,928 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 176 transitions, 799 flow [2023-12-05 21:09:30,928 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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:09:30,929 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:30,929 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:09:30,929 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:30,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1338061288, now seen corresponding path program 1 times [2023-12-05 21:09:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:30,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802131671] [2023-12-05 21:09:30,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,042 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:09:31,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802131671] [2023-12-05 21:09:31,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802131671] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:31,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925602971] [2023-12-05 21:09:31,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,043 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:31,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:31,047 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 163 [2023-12-05 21:09:31,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 176 transitions, 799 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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:09:31,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 163 [2023-12-05 21:09:31,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:31,163 INFO L124 PetriNetUnfolderBase]: 183/776 cut-off events. [2023-12-05 21:09:31,163 INFO L125 PetriNetUnfolderBase]: For 364/438 co-relation queries the response was YES. [2023-12-05 21:09:31,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 776 events. 183/776 cut-off events. For 364/438 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4623 event pairs, 43 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 2024. Up to 289 conditions per place. [2023-12-05 21:09:31,168 INFO L140 encePairwiseOnDemand]: 155/163 looper letters, 41 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2023-12-05 21:09:31,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 154 transitions, 709 flow [2023-12-05 21:09:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-12-05 21:09:31,170 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7438650306748467 [2023-12-05 21:09:31,170 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-12-05 21:09:31,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-12-05 21:09:31,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:31,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-12-05 21:09:31,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:09:31,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 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:09:31,173 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 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:09:31,175 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -10 predicate places. [2023-12-05 21:09:31,175 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 154 transitions, 709 flow [2023-12-05 21:09:31,175 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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:09:31,176 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:31,176 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, 1, 1, 1, 1, 1] [2023-12-05 21:09:31,176 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:09:31,176 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:31,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash 659732016, now seen corresponding path program 1 times [2023-12-05 21:09:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:31,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4035216] [2023-12-05 21:09:31,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,261 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:09:31,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4035216] [2023-12-05 21:09:31,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4035216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580407809] [2023-12-05 21:09:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,262 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:31,263 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 163 [2023-12-05 21:09:31,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 154 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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:09:31,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 163 [2023-12-05 21:09:31,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:31,381 INFO L124 PetriNetUnfolderBase]: 215/798 cut-off events. [2023-12-05 21:09:31,381 INFO L125 PetriNetUnfolderBase]: For 809/899 co-relation queries the response was YES. [2023-12-05 21:09:31,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 798 events. 215/798 cut-off events. For 809/899 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4689 event pairs, 19 based on Foata normal form. 2/686 useless extension candidates. Maximal degree in co-relation 2536. Up to 322 conditions per place. [2023-12-05 21:09:31,386 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 56 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2023-12-05 21:09:31,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 164 transitions, 929 flow [2023-12-05 21:09:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-12-05 21:09:31,387 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7505112474437627 [2023-12-05 21:09:31,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-12-05 21:09:31,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-12-05 21:09:31,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:31,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-12-05 21:09:31,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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:09:31,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:31,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:31,390 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -9 predicate places. [2023-12-05 21:09:31,390 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 164 transitions, 929 flow [2023-12-05 21:09:31,390 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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:09:31,390 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:31,390 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, 1, 1, 1, 1, 1] [2023-12-05 21:09:31,391 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:09:31,391 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:31,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash 659732015, now seen corresponding path program 1 times [2023-12-05 21:09:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:31,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334946645] [2023-12-05 21:09:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,444 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:09:31,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334946645] [2023-12-05 21:09:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334946645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728350458] [2023-12-05 21:09:31,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,446 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:31,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:31,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:31,447 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 163 [2023-12-05 21:09:31,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 164 transitions, 929 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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:09:31,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 163 [2023-12-05 21:09:31,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:31,569 INFO L124 PetriNetUnfolderBase]: 214/814 cut-off events. [2023-12-05 21:09:31,569 INFO L125 PetriNetUnfolderBase]: For 1085/1215 co-relation queries the response was YES. [2023-12-05 21:09:31,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 814 events. 214/814 cut-off events. For 1085/1215 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4771 event pairs, 19 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 2938. Up to 326 conditions per place. [2023-12-05 21:09:31,577 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 59 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2023-12-05 21:09:31,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 163 transitions, 1043 flow [2023-12-05 21:09:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-12-05 21:09:31,579 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7280163599182005 [2023-12-05 21:09:31,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-12-05 21:09:31,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-12-05 21:09:31,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:31,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-12-05 21:09:31,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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:09:31,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:31,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:31,581 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -8 predicate places. [2023-12-05 21:09:31,581 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 1043 flow [2023-12-05 21:09:31,582 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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:09:31,582 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:31,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, 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:09:31,582 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:09:31,582 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:31,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:31,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1910568625, now seen corresponding path program 1 times [2023-12-05 21:09:31,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:31,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963705767] [2023-12-05 21:09:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:31,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,643 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:09:31,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963705767] [2023-12-05 21:09:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963705767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774902098] [2023-12-05 21:09:31,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,644 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:31,645 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 163 [2023-12-05 21:09:31,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 163 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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:09:31,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 163 [2023-12-05 21:09:31,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:31,773 INFO L124 PetriNetUnfolderBase]: 246/845 cut-off events. [2023-12-05 21:09:31,774 INFO L125 PetriNetUnfolderBase]: For 1995/2067 co-relation queries the response was YES. [2023-12-05 21:09:31,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3676 conditions, 845 events. 246/845 cut-off events. For 1995/2067 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5021 event pairs, 19 based on Foata normal form. 2/718 useless extension candidates. Maximal degree in co-relation 3550. Up to 359 conditions per place. [2023-12-05 21:09:31,779 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 64 selfloop transitions, 2 changer transitions 2/173 dead transitions. [2023-12-05 21:09:31,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 173 transitions, 1325 flow [2023-12-05 21:09:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-12-05 21:09:31,780 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7484662576687117 [2023-12-05 21:09:31,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-12-05 21:09:31,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-12-05 21:09:31,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:31,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-12-05 21:09:31,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:09:31,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:31,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:31,782 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -7 predicate places. [2023-12-05 21:09:31,783 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 173 transitions, 1325 flow [2023-12-05 21:09:31,783 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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:09:31,783 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:31,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:31,783 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:09:31,783 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:31,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1910568624, now seen corresponding path program 1 times [2023-12-05 21:09:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:31,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879287387] [2023-12-05 21:09:31,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:31,816 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:09:31,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:31,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879287387] [2023-12-05 21:09:31,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879287387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:31,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:31,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:31,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018372216] [2023-12-05 21:09:31,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:31,817 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:31,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:31,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:31,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:31,818 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 163 [2023-12-05 21:09:31,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 173 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:09:31,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:31,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 163 [2023-12-05 21:09:31,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:31,967 INFO L124 PetriNetUnfolderBase]: 245/842 cut-off events. [2023-12-05 21:09:31,968 INFO L125 PetriNetUnfolderBase]: For 2611/2695 co-relation queries the response was YES. [2023-12-05 21:09:31,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4093 conditions, 842 events. 245/842 cut-off events. For 2611/2695 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4984 event pairs, 19 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 3958. Up to 368 conditions per place. [2023-12-05 21:09:31,973 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 67 selfloop transitions, 2 changer transitions 2/172 dead transitions. [2023-12-05 21:09:31,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 172 transitions, 1457 flow [2023-12-05 21:09:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-12-05 21:09:31,974 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7259713701431493 [2023-12-05 21:09:31,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-12-05 21:09:31,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-12-05 21:09:31,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:31,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-12-05 21:09:31,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:09:31,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:31,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:31,976 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -6 predicate places. [2023-12-05 21:09:31,976 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 172 transitions, 1457 flow [2023-12-05 21:09:31,976 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:09:31,976 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:31,976 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, 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:09:31,977 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:09:31,977 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:31,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1860291889, now seen corresponding path program 1 times [2023-12-05 21:09:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:31,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350057288] [2023-12-05 21:09:31,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:32,055 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:09:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:32,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350057288] [2023-12-05 21:09:32,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350057288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:32,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:32,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:32,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622162850] [2023-12-05 21:09:32,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:32,056 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:32,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:32,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:32,057 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 163 [2023-12-05 21:09:32,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 172 transitions, 1457 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:09:32,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:32,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 163 [2023-12-05 21:09:32,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:32,178 INFO L124 PetriNetUnfolderBase]: 235/828 cut-off events. [2023-12-05 21:09:32,179 INFO L125 PetriNetUnfolderBase]: For 3156/3252 co-relation queries the response was YES. [2023-12-05 21:09:32,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4238 conditions, 828 events. 235/828 cut-off events. For 3156/3252 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4909 event pairs, 15 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 4100. Up to 368 conditions per place. [2023-12-05 21:09:32,185 INFO L140 encePairwiseOnDemand]: 159/163 looper letters, 61 selfloop transitions, 11 changer transitions 11/202 dead transitions. [2023-12-05 21:09:32,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 202 transitions, 2169 flow [2023-12-05 21:09:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-12-05 21:09:32,189 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8261758691206544 [2023-12-05 21:09:32,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-12-05 21:09:32,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-12-05 21:09:32,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:32,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-12-05 21:09:32,190 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:09:32,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:32,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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:09:32,191 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -4 predicate places. [2023-12-05 21:09:32,191 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 202 transitions, 2169 flow [2023-12-05 21:09:32,192 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:09:32,192 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:32,192 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, 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:09:32,192 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:09:32,192 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:32,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1027103684, now seen corresponding path program 1 times [2023-12-05 21:09:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:32,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097029362] [2023-12-05 21:09:32,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:32,271 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:09:32,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:32,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097029362] [2023-12-05 21:09:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097029362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:32,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434178320] [2023-12-05 21:09:32,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:32,273 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:32,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:32,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:32,275 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 163 [2023-12-05 21:09:32,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 202 transitions, 2169 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 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:09:32,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:32,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 163 [2023-12-05 21:09:32,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:32,489 INFO L124 PetriNetUnfolderBase]: 233/823 cut-off events. [2023-12-05 21:09:32,490 INFO L125 PetriNetUnfolderBase]: For 3948/4056 co-relation queries the response was YES. [2023-12-05 21:09:32,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4548 conditions, 823 events. 233/823 cut-off events. For 3948/4056 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4872 event pairs, 13 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 4399. Up to 368 conditions per place. [2023-12-05 21:09:32,495 INFO L140 encePairwiseOnDemand]: 156/163 looper letters, 81 selfloop transitions, 16 changer transitions 11/210 dead transitions. [2023-12-05 21:09:32,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 210 transitions, 2497 flow [2023-12-05 21:09:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-12-05 21:09:32,497 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7392638036809815 [2023-12-05 21:09:32,497 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-12-05 21:09:32,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-12-05 21:09:32,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:32,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-12-05 21:09:32,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:32,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 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:09:32,500 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 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:09:32,500 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -2 predicate places. [2023-12-05 21:09:32,500 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 210 transitions, 2497 flow [2023-12-05 21:09:32,501 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 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:09:32,501 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:32,501 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, 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:09:32,501 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:09:32,501 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:32,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:32,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1027103685, now seen corresponding path program 1 times [2023-12-05 21:09:32,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126172544] [2023-12-05 21:09:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:32,709 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:09:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:32,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126172544] [2023-12-05 21:09:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126172544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:32,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:32,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422706251] [2023-12-05 21:09:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:32,710 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:32,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:32,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:32,712 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 163 [2023-12-05 21:09:32,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 210 transitions, 2497 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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:09:32,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:32,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 163 [2023-12-05 21:09:32,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:32,902 INFO L124 PetriNetUnfolderBase]: 231/798 cut-off events. [2023-12-05 21:09:32,902 INFO L125 PetriNetUnfolderBase]: For 4847/4967 co-relation queries the response was YES. [2023-12-05 21:09:32,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4765 conditions, 798 events. 231/798 cut-off events. For 4847/4967 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4577 event pairs, 11 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 4606. Up to 368 conditions per place. [2023-12-05 21:09:32,910 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 73 selfloop transitions, 11 changer transitions 12/209 dead transitions. [2023-12-05 21:09:32,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 209 transitions, 2667 flow [2023-12-05 21:09:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-12-05 21:09:32,912 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.745398773006135 [2023-12-05 21:09:32,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-12-05 21:09:32,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-12-05 21:09:32,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:32,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-12-05 21:09:32,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 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:09:32,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 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:09:32,914 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 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:09:32,914 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, 0 predicate places. [2023-12-05 21:09:32,915 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 209 transitions, 2667 flow [2023-12-05 21:09:32,915 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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:09:32,915 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:32,915 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, 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:09:32,915 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:09:32,915 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:32,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1620343276, now seen corresponding path program 1 times [2023-12-05 21:09:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:32,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785686421] [2023-12-05 21:09:32,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:32,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:33,059 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:09:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:33,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785686421] [2023-12-05 21:09:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785686421] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:33,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:33,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:09:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691601919] [2023-12-05 21:09:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:33,060 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:09:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:09:33,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:09:33,061 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 163 [2023-12-05 21:09:33,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 209 transitions, 2667 flow. Second operand has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 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:09:33,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:33,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 163 [2023-12-05 21:09:33,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:33,223 INFO L124 PetriNetUnfolderBase]: 189/706 cut-off events. [2023-12-05 21:09:33,223 INFO L125 PetriNetUnfolderBase]: For 5486/5618 co-relation queries the response was YES. [2023-12-05 21:09:33,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4393 conditions, 706 events. 189/706 cut-off events. For 5486/5618 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3863 event pairs, 11 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 4223. Up to 309 conditions per place. [2023-12-05 21:09:33,229 INFO L140 encePairwiseOnDemand]: 150/163 looper letters, 77 selfloop transitions, 22 changer transitions 14/211 dead transitions. [2023-12-05 21:09:33,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 211 transitions, 2941 flow [2023-12-05 21:09:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:09:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:09:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions. [2023-12-05 21:09:33,231 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6942740286298569 [2023-12-05 21:09:33,231 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 679 transitions. [2023-12-05 21:09:33,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 679 transitions. [2023-12-05 21:09:33,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:33,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 679 transitions. [2023-12-05 21:09:33,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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:09:33,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 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:09:33,234 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 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:09:33,235 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, 5 predicate places. [2023-12-05 21:09:33,235 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 211 transitions, 2941 flow [2023-12-05 21:09:33,235 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 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:09:33,235 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:33,235 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, 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:09:33,236 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:09:33,236 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:33,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:33,236 INFO L85 PathProgramCache]: Analyzing trace with hash 681466624, now seen corresponding path program 1 times [2023-12-05 21:09:33,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:33,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417576085] [2023-12-05 21:09:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:33,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:33,485 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:09:33,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:33,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417576085] [2023-12-05 21:09:33,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417576085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:33,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:33,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:09:33,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33719449] [2023-12-05 21:09:33,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:33,486 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:09:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:33,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:09:33,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:09:33,488 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 163 [2023-12-05 21:09:33,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 211 transitions, 2941 flow. Second operand has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 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:09:33,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:33,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 163 [2023-12-05 21:09:33,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:33,663 INFO L124 PetriNetUnfolderBase]: 147/616 cut-off events. [2023-12-05 21:09:33,663 INFO L125 PetriNetUnfolderBase]: For 5517/5661 co-relation queries the response was YES. [2023-12-05 21:09:33,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3933 conditions, 616 events. 147/616 cut-off events. For 5517/5661 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3148 event pairs, 11 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 3752. Up to 250 conditions per place. [2023-12-05 21:09:33,668 INFO L140 encePairwiseOnDemand]: 149/163 looper letters, 79 selfloop transitions, 18 changer transitions 19/213 dead transitions. [2023-12-05 21:09:33,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 213 transitions, 3225 flow [2023-12-05 21:09:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:09:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:09:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 877 transitions. [2023-12-05 21:09:33,670 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6725460122699386 [2023-12-05 21:09:33,671 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 877 transitions. [2023-12-05 21:09:33,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 877 transitions. [2023-12-05 21:09:33,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:33,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 877 transitions. [2023-12-05 21:09:33,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 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:09:33,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 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:09:33,674 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 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:09:33,675 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, 12 predicate places. [2023-12-05 21:09:33,675 INFO L500 AbstractCegarLoop]: Abstraction has has 179 places, 213 transitions, 3225 flow [2023-12-05 21:09:33,675 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 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:09:33,675 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:33,675 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, 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:09:33,675 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:09:33,675 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-12-05 21:09:33,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2051678112, now seen corresponding path program 1 times [2023-12-05 21:09:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:33,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216412419] [2023-12-05 21:09:33,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:34,035 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:09:34,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:34,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216412419] [2023-12-05 21:09:34,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216412419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:34,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:34,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:09:34,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79796133] [2023-12-05 21:09:34,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:34,036 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:09:34,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:34,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:09:34,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:09:34,038 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 163 [2023-12-05 21:09:34,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 213 transitions, 3225 flow. Second operand has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 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:09:34,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:34,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 163 [2023-12-05 21:09:34,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:34,219 INFO L124 PetriNetUnfolderBase]: 101/465 cut-off events. [2023-12-05 21:09:34,219 INFO L125 PetriNetUnfolderBase]: For 4776/4932 co-relation queries the response was YES. [2023-12-05 21:09:34,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 465 events. 101/465 cut-off events. For 4776/4932 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1885 event pairs, 8 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 2802. Up to 153 conditions per place. [2023-12-05 21:09:34,222 INFO L140 encePairwiseOnDemand]: 151/163 looper letters, 0 selfloop transitions, 0 changer transitions 199/199 dead transitions. [2023-12-05 21:09:34,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 199 transitions, 3039 flow [2023-12-05 21:09:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:09:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:09:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 956 transitions. [2023-12-05 21:09:34,225 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6516700749829584 [2023-12-05 21:09:34,225 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 956 transitions. [2023-12-05 21:09:34,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 956 transitions. [2023-12-05 21:09:34,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:34,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 956 transitions. [2023-12-05 21:09:34,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 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:09:34,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 163.0) internal successors, (1630), 10 states have internal predecessors, (1630), 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:09:34,230 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 163.0) internal successors, (1630), 10 states have internal predecessors, (1630), 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:09:34,231 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, 16 predicate places. [2023-12-05 21:09:34,232 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 199 transitions, 3039 flow [2023-12-05 21:09:34,232 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 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:09:34,243 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe014_rmo.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:09:34,277 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 51 remaining) [2023-12-05 21:09:34,278 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 51 remaining) [2023-12-05 21:09:34,278 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 51 remaining) [2023-12-05 21:09:34,278 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 51 remaining) [2023-12-05 21:09:34,278 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 51 remaining) [2023-12-05 21:09:34,278 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 51 remaining) [2023-12-05 21:09:34,278 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 51 remaining) [2023-12-05 21:09:34,278 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 51 remaining) [2023-12-05 21:09:34,278 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 51 remaining) [2023-12-05 21:09:34,279 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 51 remaining) [2023-12-05 21:09:34,280 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 51 remaining) [2023-12-05 21:09:34,281 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 51 remaining) [2023-12-05 21:09:34,282 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 51 remaining) [2023-12-05 21:09:34,282 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 51 remaining) [2023-12-05 21:09:34,282 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 51 remaining) [2023-12-05 21:09:34,282 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:09:34,282 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:34,286 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:09:34,286 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:09:34,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:09:34 BasicIcfg [2023-12-05 21:09:34,290 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:09:34,291 INFO L158 Benchmark]: Toolchain (without parser) took 7019.91ms. Allocated memory was 315.6MB in the beginning and 688.9MB in the end (delta: 373.3MB). Free memory was 268.1MB in the beginning and 247.9MB in the end (delta: 20.2MB). Peak memory consumption was 394.4MB. Max. memory is 8.0GB. [2023-12-05 21:09:34,291 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 218.1MB. Free memory was 167.2MB in the beginning and 167.1MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:09:34,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.52ms. Allocated memory is still 315.6MB. Free memory was 267.9MB in the beginning and 244.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:34,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.11ms. Allocated memory is still 315.6MB. Free memory was 244.9MB in the beginning and 242.5MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:34,291 INFO L158 Benchmark]: Boogie Preprocessor took 22.85ms. Allocated memory is still 315.6MB. Free memory was 242.2MB in the beginning and 240.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:34,291 INFO L158 Benchmark]: RCFGBuilder took 705.42ms. Allocated memory is still 315.6MB. Free memory was 240.1MB in the beginning and 216.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2023-12-05 21:09:34,292 INFO L158 Benchmark]: TraceAbstraction took 5721.29ms. Allocated memory was 315.6MB in the beginning and 688.9MB in the end (delta: 373.3MB). Free memory was 215.4MB in the beginning and 247.9MB in the end (delta: -32.4MB). Peak memory consumption was 340.4MB. Max. memory is 8.0GB. [2023-12-05 21:09:34,293 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 218.1MB. Free memory was 167.2MB in the beginning and 167.1MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.52ms. Allocated memory is still 315.6MB. Free memory was 267.9MB in the beginning and 244.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.11ms. Allocated memory is still 315.6MB. Free memory was 244.9MB in the beginning and 242.5MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.85ms. Allocated memory is still 315.6MB. Free memory was 242.2MB in the beginning and 240.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 705.42ms. Allocated memory is still 315.6MB. Free memory was 240.1MB in the beginning and 216.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5721.29ms. Allocated memory was 315.6MB in the beginning and 688.9MB in the end (delta: 373.3MB). Free memory was 215.4MB in the beginning and 247.9MB in the end (delta: -32.4MB). Peak memory consumption was 340.4MB. 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 - 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 7 procedures, 206 locations, 51 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: 5.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 466 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 466 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 898 IncrementalHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 139 mSDtfsCounter, 898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3225occurred in iteration=13, InterpolantAutomatonStates: 63, 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.7s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1028 ConstructedInterpolants, 0 QuantifiedInterpolants, 4285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:09:34,319 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...