/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -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/safe020_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:50:35,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:50:35,738 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-11-30 04:50:35,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:50:35,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:50:35,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:50:35,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:50:35,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:50:35,814 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:50:35,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:50:35,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:50:35,818 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:50:35,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:50:35,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:50:35,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:50:35,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:50:35,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:50:35,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:50:35,820 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:50:35,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:50:35,820 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:50:35,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:50:35,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:50:35,821 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:50:35,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:50:35,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:50:35,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:50:35,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:50:35,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:50:35,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:50:35,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:50:35,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:50:35,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:50:35,823 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-11-30 04:50:36,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:50:36,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:50:36,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:50:36,135 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:50:36,135 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:50:36,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2023-11-30 04:50:37,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:50:37,340 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:50:37,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2023-11-30 04:50:37,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bee1a114/172ce0063c5c4b11b6cb0ae5b52a00ca/FLAG74036345c [2023-11-30 04:50:37,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bee1a114/172ce0063c5c4b11b6cb0ae5b52a00ca [2023-11-30 04:50:37,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:50:37,366 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:50:37,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:50:37,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:50:37,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:50:37,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f959c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37, skipping insertion in model container [2023-11-30 04:50:37,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,423 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:50:37,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:50:37,639 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:50:37,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:50:37,718 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:50:37,718 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:50:37,723 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:50:37,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37 WrapperNode [2023-11-30 04:50:37,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:50:37,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:50:37,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:50:37,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:50:37,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,754 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2023-11-30 04:50:37,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:50:37,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:50:37,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:50:37,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:50:37,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:50:37,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:50:37,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:50:37,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:50:37,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (1/1) ... [2023-11-30 04:50:37,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:50:37,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:50:37,816 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-11-30 04:50:37,827 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-11-30 04:50:37,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:50:37,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:50:37,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:50:37,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:50:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:50:37,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:50:37,850 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:50:37,975 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:50:37,977 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:50:38,397 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:50:38,672 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:50:38,672 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:50:38,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:50:38 BoogieIcfgContainer [2023-11-30 04:50:38,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:50:38,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:50:38,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:50:38,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:50:38,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:50:37" (1/3) ... [2023-11-30 04:50:38,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9148aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:50:38, skipping insertion in model container [2023-11-30 04:50:38,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:50:37" (2/3) ... [2023-11-30 04:50:38,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9148aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:50:38, skipping insertion in model container [2023-11-30 04:50:38,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:50:38" (3/3) ... [2023-11-30 04:50:38,680 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2023-11-30 04:50:38,693 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:50:38,693 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2023-11-30 04:50:38,693 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:50:38,783 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:50:38,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 178 transitions, 368 flow [2023-11-30 04:50:38,889 INFO L124 PetriNetUnfolderBase]: 3/175 cut-off events. [2023-11-30 04:50:38,889 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:50:38,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 3/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 262 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-11-30 04:50:38,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 178 transitions, 368 flow [2023-11-30 04:50:38,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 175 transitions, 359 flow [2023-11-30 04:50:38,914 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:50:38,919 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;@5c0b369d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:50:38,920 INFO L363 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-11-30 04:50:38,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:50:38,929 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2023-11-30 04:50:38,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:50:38,930 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:38,930 INFO L232 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] [2023-11-30 04:50:38,930 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:38,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1917715356, now seen corresponding path program 1 times [2023-11-30 04:50:38,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:38,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786596732] [2023-11-30 04:50:38,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:38,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:39,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:39,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786596732] [2023-11-30 04:50:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786596732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:39,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:39,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:39,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970110547] [2023-11-30 04:50:39,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:39,258 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:39,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:39,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:39,284 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 178 [2023-11-30 04:50:39,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 175 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-11-30 04:50:39,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:39,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 178 [2023-11-30 04:50:39,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:42,252 INFO L124 PetriNetUnfolderBase]: 11391/22033 cut-off events. [2023-11-30 04:50:42,253 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-30 04:50:42,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38215 conditions, 22033 events. 11391/22033 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 1817. Compared 220385 event pairs, 7296 based on Foata normal form. 684/11568 useless extension candidates. Maximal degree in co-relation 38141. Up to 10375 conditions per place. [2023-11-30 04:50:42,367 INFO L140 encePairwiseOnDemand]: 152/178 looper letters, 66 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2023-11-30 04:50:42,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 167 transitions, 479 flow [2023-11-30 04:50:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-11-30 04:50:42,376 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7940074906367042 [2023-11-30 04:50:42,376 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-11-30 04:50:42,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-11-30 04:50:42,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:42,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-11-30 04:50:42,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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-11-30 04:50:42,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:42,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:42,386 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -22 predicate places. [2023-11-30 04:50:42,386 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 167 transitions, 479 flow [2023-11-30 04:50:42,387 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-11-30 04:50:42,387 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:42,387 INFO L232 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] [2023-11-30 04:50:42,387 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:50:42,387 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:42,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1917715355, now seen corresponding path program 1 times [2023-11-30 04:50:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:42,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629633289] [2023-11-30 04:50:42,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:42,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629633289] [2023-11-30 04:50:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629633289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:42,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:42,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:42,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938122893] [2023-11-30 04:50:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:42,475 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:42,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:42,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:42,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:42,476 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 178 [2023-11-30 04:50:42,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 167 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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-11-30 04:50:42,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:42,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 178 [2023-11-30 04:50:42,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:44,882 INFO L124 PetriNetUnfolderBase]: 11453/22138 cut-off events. [2023-11-30 04:50:44,882 INFO L125 PetriNetUnfolderBase]: For 1765/4453 co-relation queries the response was YES. [2023-11-30 04:50:44,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53889 conditions, 22138 events. 11453/22138 cut-off events. For 1765/4453 co-relation queries the response was YES. Maximal size of possible extension queue 1836. Compared 221963 event pairs, 7358 based on Foata normal form. 0/10962 useless extension candidates. Maximal degree in co-relation 53809. Up to 11579 conditions per place. [2023-11-30 04:50:45,099 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 81 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2023-11-30 04:50:45,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 185 transitions, 717 flow [2023-11-30 04:50:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-11-30 04:50:45,102 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7228464419475655 [2023-11-30 04:50:45,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-11-30 04:50:45,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-11-30 04:50:45,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:45,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-11-30 04:50:45,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-11-30 04:50:45,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:45,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:45,106 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -21 predicate places. [2023-11-30 04:50:45,107 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 185 transitions, 717 flow [2023-11-30 04:50:45,107 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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-11-30 04:50:45,107 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:45,107 INFO L232 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] [2023-11-30 04:50:45,107 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:50:45,108 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:45,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash 930450643, now seen corresponding path program 1 times [2023-11-30 04:50:45,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:45,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123426726] [2023-11-30 04:50:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:45,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:45,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123426726] [2023-11-30 04:50:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123426726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:45,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:45,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:50:45,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399480497] [2023-11-30 04:50:45,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:45,295 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:50:45,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:45,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:50:45,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:50:45,298 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 178 [2023-11-30 04:50:45,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 185 transitions, 717 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 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-11-30 04:50:45,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:45,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 178 [2023-11-30 04:50:45,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:47,320 INFO L124 PetriNetUnfolderBase]: 7492/15600 cut-off events. [2023-11-30 04:50:47,321 INFO L125 PetriNetUnfolderBase]: For 3464/5114 co-relation queries the response was YES. [2023-11-30 04:50:47,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48118 conditions, 15600 events. 7492/15600 cut-off events. For 3464/5114 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 155832 event pairs, 1995 based on Foata normal form. 0/9652 useless extension candidates. Maximal degree in co-relation 48027. Up to 8561 conditions per place. [2023-11-30 04:50:47,463 INFO L140 encePairwiseOnDemand]: 158/178 looper letters, 90 selfloop transitions, 17 changer transitions 0/204 dead transitions. [2023-11-30 04:50:47,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 204 transitions, 1041 flow [2023-11-30 04:50:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:50:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:50:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2023-11-30 04:50:47,465 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6773675762439807 [2023-11-30 04:50:47,465 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2023-11-30 04:50:47,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2023-11-30 04:50:47,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:47,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2023-11-30 04:50:47,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 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-11-30 04:50:47,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 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-11-30 04:50:47,469 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 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-11-30 04:50:47,470 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -17 predicate places. [2023-11-30 04:50:47,470 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 204 transitions, 1041 flow [2023-11-30 04:50:47,471 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 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-11-30 04:50:47,471 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:47,471 INFO L232 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] [2023-11-30 04:50:47,471 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:50:47,471 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:47,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash 930450644, now seen corresponding path program 1 times [2023-11-30 04:50:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066601135] [2023-11-30 04:50:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:47,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066601135] [2023-11-30 04:50:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066601135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:47,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:47,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:50:47,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363661665] [2023-11-30 04:50:47,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:47,621 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:50:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:47,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:50:47,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:50:47,626 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 178 [2023-11-30 04:50:47,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 204 transitions, 1041 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-11-30 04:50:47,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:47,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 178 [2023-11-30 04:50:47,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:48,148 INFO L124 PetriNetUnfolderBase]: 1662/4229 cut-off events. [2023-11-30 04:50:48,148 INFO L125 PetriNetUnfolderBase]: For 2387/2791 co-relation queries the response was YES. [2023-11-30 04:50:48,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13978 conditions, 4229 events. 1662/4229 cut-off events. For 2387/2791 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 38078 event pairs, 242 based on Foata normal form. 0/3423 useless extension candidates. Maximal degree in co-relation 13878. Up to 2400 conditions per place. [2023-11-30 04:50:48,167 INFO L140 encePairwiseOnDemand]: 167/178 looper letters, 57 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2023-11-30 04:50:48,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 167 transitions, 863 flow [2023-11-30 04:50:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:50:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:50:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-11-30 04:50:48,169 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.675561797752809 [2023-11-30 04:50:48,169 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-11-30 04:50:48,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-11-30 04:50:48,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:48,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-11-30 04:50:48,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 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-11-30 04:50:48,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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-11-30 04:50:48,171 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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-11-30 04:50:48,172 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -23 predicate places. [2023-11-30 04:50:48,172 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 167 transitions, 863 flow [2023-11-30 04:50:48,172 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-11-30 04:50:48,172 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:48,172 INFO L232 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] [2023-11-30 04:50:48,172 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:50:48,172 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:48,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:48,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2091655652, now seen corresponding path program 1 times [2023-11-30 04:50:48,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:48,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484808130] [2023-11-30 04:50:48,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:48,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:48,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:48,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484808130] [2023-11-30 04:50:48,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484808130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:48,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:48,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:48,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193111832] [2023-11-30 04:50:48,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:48,218 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:48,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:48,219 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 178 [2023-11-30 04:50:48,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 167 transitions, 863 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-11-30 04:50:48,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:48,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 178 [2023-11-30 04:50:48,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:48,769 INFO L124 PetriNetUnfolderBase]: 1989/4630 cut-off events. [2023-11-30 04:50:48,769 INFO L125 PetriNetUnfolderBase]: For 5984/6568 co-relation queries the response was YES. [2023-11-30 04:50:48,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18519 conditions, 4630 events. 1989/4630 cut-off events. For 5984/6568 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 40546 event pairs, 178 based on Foata normal form. 2/3682 useless extension candidates. Maximal degree in co-relation 18411. Up to 2728 conditions per place. [2023-11-30 04:50:48,798 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 79 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2023-11-30 04:50:48,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 184 transitions, 1199 flow [2023-11-30 04:50:48,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-30 04:50:48,803 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6891385767790262 [2023-11-30 04:50:48,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-30 04:50:48,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-30 04:50:48,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:48,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-30 04:50:48,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-11-30 04:50:48,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:48,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:48,815 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -22 predicate places. [2023-11-30 04:50:48,815 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 184 transitions, 1199 flow [2023-11-30 04:50:48,815 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-11-30 04:50:48,815 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:48,815 INFO L232 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] [2023-11-30 04:50:48,816 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:50:48,816 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:48,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2091655653, now seen corresponding path program 1 times [2023-11-30 04:50:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464028592] [2023-11-30 04:50:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:48,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464028592] [2023-11-30 04:50:48,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464028592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:48,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:48,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148456188] [2023-11-30 04:50:48,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:48,852 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:48,853 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 178 [2023-11-30 04:50:48,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 184 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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-11-30 04:50:48,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:48,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 178 [2023-11-30 04:50:48,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:49,547 INFO L124 PetriNetUnfolderBase]: 1988/4691 cut-off events. [2023-11-30 04:50:49,547 INFO L125 PetriNetUnfolderBase]: For 7841/8737 co-relation queries the response was YES. [2023-11-30 04:50:49,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21605 conditions, 4691 events. 1988/4691 cut-off events. For 7841/8737 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 41589 event pairs, 178 based on Foata normal form. 2/3743 useless extension candidates. Maximal degree in co-relation 21488. Up to 2732 conditions per place. [2023-11-30 04:50:49,574 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 82 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2023-11-30 04:50:49,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 183 transitions, 1359 flow [2023-11-30 04:50:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-30 04:50:49,576 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6629213483146067 [2023-11-30 04:50:49,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-30 04:50:49,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-30 04:50:49,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:49,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-30 04:50:49,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-11-30 04:50:49,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:49,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:49,578 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -21 predicate places. [2023-11-30 04:50:49,578 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 183 transitions, 1359 flow [2023-11-30 04:50:49,579 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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-11-30 04:50:49,579 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:49,579 INFO L232 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] [2023-11-30 04:50:49,579 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:50:49,579 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:49,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2089140938, now seen corresponding path program 1 times [2023-11-30 04:50:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:49,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506676415] [2023-11-30 04:50:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:49,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:49,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506676415] [2023-11-30 04:50:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506676415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:49,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:49,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342253282] [2023-11-30 04:50:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:49,651 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:49,653 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 178 [2023-11-30 04:50:49,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 183 transitions, 1359 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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-11-30 04:50:49,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:49,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 178 [2023-11-30 04:50:49,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:50,270 INFO L124 PetriNetUnfolderBase]: 2309/5234 cut-off events. [2023-11-30 04:50:50,270 INFO L125 PetriNetUnfolderBase]: For 15401/15809 co-relation queries the response was YES. [2023-11-30 04:50:50,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27413 conditions, 5234 events. 2309/5234 cut-off events. For 15401/15809 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 46123 event pairs, 178 based on Foata normal form. 6/4158 useless extension candidates. Maximal degree in co-relation 27287. Up to 3075 conditions per place. [2023-11-30 04:50:50,311 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 85 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2023-11-30 04:50:50,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 185 transitions, 1567 flow [2023-11-30 04:50:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-30 04:50:50,313 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6629213483146067 [2023-11-30 04:50:50,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-30 04:50:50,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-30 04:50:50,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:50,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-30 04:50:50,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-11-30 04:50:50,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:50,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:50,315 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -20 predicate places. [2023-11-30 04:50:50,315 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 185 transitions, 1567 flow [2023-11-30 04:50:50,315 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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-11-30 04:50:50,315 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:50,315 INFO L232 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] [2023-11-30 04:50:50,316 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:50:50,316 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:50,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2089140937, now seen corresponding path program 1 times [2023-11-30 04:50:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:50,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962761704] [2023-11-30 04:50:50,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962761704] [2023-11-30 04:50:50,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962761704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:50,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:50,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:50,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167979700] [2023-11-30 04:50:50,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:50,366 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:50,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:50,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:50,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:50,366 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 178 [2023-11-30 04:50:50,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 185 transitions, 1567 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-11-30 04:50:50,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:50,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 178 [2023-11-30 04:50:50,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:51,146 INFO L124 PetriNetUnfolderBase]: 2302/5065 cut-off events. [2023-11-30 04:50:51,156 INFO L125 PetriNetUnfolderBase]: For 20331/20611 co-relation queries the response was YES. [2023-11-30 04:50:51,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30312 conditions, 5065 events. 2302/5065 cut-off events. For 20331/20611 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 44160 event pairs, 102 based on Foata normal form. 6/3989 useless extension candidates. Maximal degree in co-relation 30178. Up to 3075 conditions per place. [2023-11-30 04:50:51,231 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 97 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2023-11-30 04:50:51,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 201 transitions, 2027 flow [2023-11-30 04:50:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-11-30 04:50:51,233 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6853932584269663 [2023-11-30 04:50:51,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-11-30 04:50:51,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-11-30 04:50:51,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:51,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-11-30 04:50:51,235 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-11-30 04:50:51,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:51,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:51,247 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -19 predicate places. [2023-11-30 04:50:51,247 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 201 transitions, 2027 flow [2023-11-30 04:50:51,247 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-11-30 04:50:51,247 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:51,247 INFO L232 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] [2023-11-30 04:50:51,247 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:50:51,248 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:51,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash -596599479, now seen corresponding path program 1 times [2023-11-30 04:50:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:51,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42198787] [2023-11-30 04:50:51,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:51,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:51,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42198787] [2023-11-30 04:50:51,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42198787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:51,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:51,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:51,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572086346] [2023-11-30 04:50:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:51,363 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:51,365 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 178 [2023-11-30 04:50:51,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 201 transitions, 2027 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-11-30 04:50:51,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:51,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 178 [2023-11-30 04:50:51,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:52,130 INFO L124 PetriNetUnfolderBase]: 2276/5083 cut-off events. [2023-11-30 04:50:52,130 INFO L125 PetriNetUnfolderBase]: For 25781/26097 co-relation queries the response was YES. [2023-11-30 04:50:52,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32556 conditions, 5083 events. 2276/5083 cut-off events. For 25781/26097 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 44869 event pairs, 78 based on Foata normal form. 0/4019 useless extension candidates. Maximal degree in co-relation 32419. Up to 3075 conditions per place. [2023-11-30 04:50:52,173 INFO L140 encePairwiseOnDemand]: 174/178 looper letters, 120 selfloop transitions, 10 changer transitions 0/246 dead transitions. [2023-11-30 04:50:52,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 246 transitions, 3097 flow [2023-11-30 04:50:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-11-30 04:50:52,175 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7490636704119851 [2023-11-30 04:50:52,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-11-30 04:50:52,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-11-30 04:50:52,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:52,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-11-30 04:50:52,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:52,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:52,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:52,177 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -17 predicate places. [2023-11-30 04:50:52,178 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 246 transitions, 3097 flow [2023-11-30 04:50:52,178 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-11-30 04:50:52,178 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:52,178 INFO L232 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] [2023-11-30 04:50:52,178 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:50:52,178 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:52,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2099971050, now seen corresponding path program 1 times [2023-11-30 04:50:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:52,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168138618] [2023-11-30 04:50:52,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:52,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:52,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:52,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168138618] [2023-11-30 04:50:52,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168138618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:52,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:52,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:50:52,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403081534] [2023-11-30 04:50:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:52,313 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:50:52,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:52,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:50:52,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:50:52,314 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 178 [2023-11-30 04:50:52,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 246 transitions, 3097 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 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-11-30 04:50:52,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:52,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 178 [2023-11-30 04:50:52,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:53,182 INFO L124 PetriNetUnfolderBase]: 2424/5825 cut-off events. [2023-11-30 04:50:53,183 INFO L125 PetriNetUnfolderBase]: For 34888/35244 co-relation queries the response was YES. [2023-11-30 04:50:53,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38606 conditions, 5825 events. 2424/5825 cut-off events. For 34888/35244 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 56115 event pairs, 72 based on Foata normal form. 12/4785 useless extension candidates. Maximal degree in co-relation 38458. Up to 3383 conditions per place. [2023-11-30 04:50:53,229 INFO L140 encePairwiseOnDemand]: 173/178 looper letters, 153 selfloop transitions, 12 changer transitions 0/264 dead transitions. [2023-11-30 04:50:53,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 264 transitions, 3763 flow [2023-11-30 04:50:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-11-30 04:50:53,231 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6722846441947565 [2023-11-30 04:50:53,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-11-30 04:50:53,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-11-30 04:50:53,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:53,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-11-30 04:50:53,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-11-30 04:50:53,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:53,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-11-30 04:50:53,233 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -16 predicate places. [2023-11-30 04:50:53,233 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 264 transitions, 3763 flow [2023-11-30 04:50:53,234 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 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-11-30 04:50:53,234 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:53,234 INFO L232 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] [2023-11-30 04:50:53,234 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:50:53,234 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:53,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2127083229, now seen corresponding path program 1 times [2023-11-30 04:50:53,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:53,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257807470] [2023-11-30 04:50:53,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:53,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:53,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:53,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257807470] [2023-11-30 04:50:53,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257807470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:53,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:53,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:50:53,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647257925] [2023-11-30 04:50:53,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:53,387 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:50:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:53,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:50:53,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:50:53,388 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 178 [2023-11-30 04:50:53,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 264 transitions, 3763 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 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-11-30 04:50:53,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:53,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 178 [2023-11-30 04:50:53,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:54,341 INFO L124 PetriNetUnfolderBase]: 2404/5671 cut-off events. [2023-11-30 04:50:54,341 INFO L125 PetriNetUnfolderBase]: For 44199/44751 co-relation queries the response was YES. [2023-11-30 04:50:54,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40817 conditions, 5671 events. 2404/5671 cut-off events. For 44199/44751 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 54273 event pairs, 54 based on Foata normal form. 12/4649 useless extension candidates. Maximal degree in co-relation 40659. Up to 3383 conditions per place. [2023-11-30 04:50:54,391 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 145 selfloop transitions, 10 changer transitions 0/263 dead transitions. [2023-11-30 04:50:54,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 263 transitions, 4051 flow [2023-11-30 04:50:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:50:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:50:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-11-30 04:50:54,393 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6671348314606742 [2023-11-30 04:50:54,393 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-11-30 04:50:54,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-11-30 04:50:54,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:54,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-11-30 04:50:54,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 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-11-30 04:50:54,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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-11-30 04:50:54,395 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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-11-30 04:50:54,395 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -14 predicate places. [2023-11-30 04:50:54,395 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 263 transitions, 4051 flow [2023-11-30 04:50:54,396 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 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-11-30 04:50:54,396 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:54,396 INFO L232 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] [2023-11-30 04:50:54,396 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:50:54,396 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:54,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:54,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1458452591, now seen corresponding path program 1 times [2023-11-30 04:50:54,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:54,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279744849] [2023-11-30 04:50:54,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:54,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279744849] [2023-11-30 04:50:54,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279744849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:54,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:54,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:50:54,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901411133] [2023-11-30 04:50:54,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:54,513 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:50:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:54,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:50:54,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:50:54,514 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 178 [2023-11-30 04:50:54,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 263 transitions, 4051 flow. Second operand has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 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-11-30 04:50:54,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:54,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 178 [2023-11-30 04:50:54,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:55,338 INFO L124 PetriNetUnfolderBase]: 1852/4503 cut-off events. [2023-11-30 04:50:55,338 INFO L125 PetriNetUnfolderBase]: For 45592/45980 co-relation queries the response was YES. [2023-11-30 04:50:55,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34751 conditions, 4503 events. 1852/4503 cut-off events. For 45592/45980 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 41157 event pairs, 66 based on Foata normal form. 0/3751 useless extension candidates. Maximal degree in co-relation 34582. Up to 2665 conditions per place. [2023-11-30 04:50:55,370 INFO L140 encePairwiseOnDemand]: 160/178 looper letters, 143 selfloop transitions, 34 changer transitions 0/272 dead transitions. [2023-11-30 04:50:55,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 272 transitions, 4621 flow [2023-11-30 04:50:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:50:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:50:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2023-11-30 04:50:55,372 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6348314606741573 [2023-11-30 04:50:55,372 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 678 transitions. [2023-11-30 04:50:55,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 678 transitions. [2023-11-30 04:50:55,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:55,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 678 transitions. [2023-11-30 04:50:55,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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-11-30 04:50:55,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 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-11-30 04:50:55,375 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 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-11-30 04:50:55,375 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -9 predicate places. [2023-11-30 04:50:55,375 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 272 transitions, 4621 flow [2023-11-30 04:50:55,375 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 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-11-30 04:50:55,375 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:55,376 INFO L232 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] [2023-11-30 04:50:55,376 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:50:55,376 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:55,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1407821078, now seen corresponding path program 1 times [2023-11-30 04:50:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:55,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545948831] [2023-11-30 04:50:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545948831] [2023-11-30 04:50:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545948831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:55,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:55,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:50:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115204791] [2023-11-30 04:50:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:55,553 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:50:55,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:55,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:50:55,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:50:55,554 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 178 [2023-11-30 04:50:55,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 272 transitions, 4621 flow. Second operand has 9 states, 9 states have (on average 102.44444444444444) internal successors, (922), 9 states have internal predecessors, (922), 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-11-30 04:50:55,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:55,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 178 [2023-11-30 04:50:55,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:56,136 INFO L124 PetriNetUnfolderBase]: 1300/3458 cut-off events. [2023-11-30 04:50:56,136 INFO L125 PetriNetUnfolderBase]: For 38838/39302 co-relation queries the response was YES. [2023-11-30 04:50:56,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27584 conditions, 3458 events. 1300/3458 cut-off events. For 38838/39302 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 30602 event pairs, 66 based on Foata normal form. 0/2994 useless extension candidates. Maximal degree in co-relation 27404. Up to 1947 conditions per place. [2023-11-30 04:50:56,167 INFO L140 encePairwiseOnDemand]: 159/178 looper letters, 161 selfloop transitions, 26 changer transitions 0/281 dead transitions. [2023-11-30 04:50:56,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 281 transitions, 5229 flow [2023-11-30 04:50:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:50:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:50:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 872 transitions. [2023-11-30 04:50:56,169 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6123595505617978 [2023-11-30 04:50:56,169 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 872 transitions. [2023-11-30 04:50:56,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 872 transitions. [2023-11-30 04:50:56,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:56,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 872 transitions. [2023-11-30 04:50:56,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 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-11-30 04:50:56,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 178.0) internal successors, (1602), 9 states have internal predecessors, (1602), 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-11-30 04:50:56,173 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 178.0) internal successors, (1602), 9 states have internal predecessors, (1602), 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-11-30 04:50:56,173 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -2 predicate places. [2023-11-30 04:50:56,173 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 281 transitions, 5229 flow [2023-11-30 04:50:56,174 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.44444444444444) internal successors, (922), 9 states have internal predecessors, (922), 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-11-30 04:50:56,174 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:56,174 INFO L232 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] [2023-11-30 04:50:56,174 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:50:56,174 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:56,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:56,174 INFO L85 PathProgramCache]: Analyzing trace with hash -4441879, now seen corresponding path program 1 times [2023-11-30 04:50:56,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:56,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074128222] [2023-11-30 04:50:56,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:56,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:56,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074128222] [2023-11-30 04:50:56,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074128222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:56,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:56,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:50:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130706202] [2023-11-30 04:50:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:56,512 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:50:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:56,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:50:56,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:50:56,514 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 178 [2023-11-30 04:50:56,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 281 transitions, 5229 flow. Second operand has 11 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 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-11-30 04:50:56,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:56,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 178 [2023-11-30 04:50:56,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:56,989 INFO L124 PetriNetUnfolderBase]: 638/1669 cut-off events. [2023-11-30 04:50:56,989 INFO L125 PetriNetUnfolderBase]: For 24696/25596 co-relation queries the response was YES. [2023-11-30 04:50:56,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14253 conditions, 1669 events. 638/1669 cut-off events. For 24696/25596 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11076 event pairs, 0 based on Foata normal form. 0/1643 useless extension candidates. Maximal degree in co-relation 14062. Up to 787 conditions per place. [2023-11-30 04:50:56,998 INFO L140 encePairwiseOnDemand]: 163/178 looper letters, 0 selfloop transitions, 0 changer transitions 259/259 dead transitions. [2023-11-30 04:50:56,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 259 transitions, 4945 flow [2023-11-30 04:50:56,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:50:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:50:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 945 transitions. [2023-11-30 04:50:57,001 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5898876404494382 [2023-11-30 04:50:57,001 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 945 transitions. [2023-11-30 04:50:57,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 945 transitions. [2023-11-30 04:50:57,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:57,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 945 transitions. [2023-11-30 04:50:57,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.0) internal successors, (945), 9 states have internal predecessors, (945), 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-11-30 04:50:57,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 178.0) internal successors, (1780), 10 states have internal predecessors, (1780), 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-11-30 04:50:57,005 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 178.0) internal successors, (1780), 10 states have internal predecessors, (1780), 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-11-30 04:50:57,005 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -1 predicate places. [2023-11-30 04:50:57,005 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 259 transitions, 4945 flow [2023-11-30 04:50:57,006 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 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-11-30 04:50:57,015 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe020_rmo.i_BEv2_AllErrorsAtOnce [2023-11-30 04:50:57,042 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 83 remaining) [2023-11-30 04:50:57,042 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 83 remaining) [2023-11-30 04:50:57,042 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 83 remaining) [2023-11-30 04:50:57,042 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 83 remaining) [2023-11-30 04:50:57,043 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 83 remaining) [2023-11-30 04:50:57,043 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 83 remaining) [2023-11-30 04:50:57,043 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 83 remaining) [2023-11-30 04:50:57,043 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 83 remaining) [2023-11-30 04:50:57,043 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 83 remaining) [2023-11-30 04:50:57,043 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 83 remaining) [2023-11-30 04:50:57,043 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 83 remaining) [2023-11-30 04:50:57,044 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 83 remaining) [2023-11-30 04:50:57,044 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 83 remaining) [2023-11-30 04:50:57,044 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 83 remaining) [2023-11-30 04:50:57,044 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 83 remaining) [2023-11-30 04:50:57,044 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 83 remaining) [2023-11-30 04:50:57,044 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 83 remaining) [2023-11-30 04:50:57,044 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 83 remaining) [2023-11-30 04:50:57,045 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 83 remaining) [2023-11-30 04:50:57,045 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 83 remaining) [2023-11-30 04:50:57,045 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 83 remaining) [2023-11-30 04:50:57,045 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 83 remaining) [2023-11-30 04:50:57,045 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 83 remaining) [2023-11-30 04:50:57,045 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 83 remaining) [2023-11-30 04:50:57,045 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 83 remaining) [2023-11-30 04:50:57,045 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 83 remaining) [2023-11-30 04:50:57,045 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 83 remaining) [2023-11-30 04:50:57,046 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 83 remaining) [2023-11-30 04:50:57,046 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 83 remaining) [2023-11-30 04:50:57,046 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 83 remaining) [2023-11-30 04:50:57,046 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 83 remaining) [2023-11-30 04:50:57,046 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 83 remaining) [2023-11-30 04:50:57,046 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 83 remaining) [2023-11-30 04:50:57,046 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 83 remaining) [2023-11-30 04:50:57,046 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 83 remaining) [2023-11-30 04:50:57,046 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 83 remaining) [2023-11-30 04:50:57,047 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 83 remaining) [2023-11-30 04:50:57,047 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 83 remaining) [2023-11-30 04:50:57,047 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 83 remaining) [2023-11-30 04:50:57,047 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 83 remaining) [2023-11-30 04:50:57,047 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 83 remaining) [2023-11-30 04:50:57,047 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 83 remaining) [2023-11-30 04:50:57,047 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 83 remaining) [2023-11-30 04:50:57,047 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 83 remaining) [2023-11-30 04:50:57,047 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 83 remaining) [2023-11-30 04:50:57,047 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 83 remaining) [2023-11-30 04:50:57,048 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 83 remaining) [2023-11-30 04:50:57,048 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2023-11-30 04:50:57,048 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2023-11-30 04:50:57,048 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 83 remaining) [2023-11-30 04:50:57,048 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 83 remaining) [2023-11-30 04:50:57,048 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 83 remaining) [2023-11-30 04:50:57,048 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 83 remaining) [2023-11-30 04:50:57,048 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 83 remaining) [2023-11-30 04:50:57,048 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 83 remaining) [2023-11-30 04:50:57,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 83 remaining) [2023-11-30 04:50:57,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 83 remaining) [2023-11-30 04:50:57,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 83 remaining) [2023-11-30 04:50:57,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 83 remaining) [2023-11-30 04:50:57,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 83 remaining) [2023-11-30 04:50:57,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 83 remaining) [2023-11-30 04:50:57,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 83 remaining) [2023-11-30 04:50:57,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 83 remaining) [2023-11-30 04:50:57,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 83 remaining) [2023-11-30 04:50:57,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 83 remaining) [2023-11-30 04:50:57,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 83 remaining) [2023-11-30 04:50:57,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 83 remaining) [2023-11-30 04:50:57,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 83 remaining) [2023-11-30 04:50:57,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 83 remaining) [2023-11-30 04:50:57,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 83 remaining) [2023-11-30 04:50:57,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 83 remaining) [2023-11-30 04:50:57,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 83 remaining) [2023-11-30 04:50:57,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 83 remaining) [2023-11-30 04:50:57,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 83 remaining) [2023-11-30 04:50:57,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 83 remaining) [2023-11-30 04:50:57,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 83 remaining) [2023-11-30 04:50:57,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 83 remaining) [2023-11-30 04:50:57,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 83 remaining) [2023-11-30 04:50:57,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 83 remaining) [2023-11-30 04:50:57,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 83 remaining) [2023-11-30 04:50:57,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 83 remaining) [2023-11-30 04:50:57,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 83 remaining) [2023-11-30 04:50:57,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 83 remaining) [2023-11-30 04:50:57,051 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:50:57,052 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:57,056 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:50:57,056 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:50:57,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:50:57 BasicIcfg [2023-11-30 04:50:57,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:50:57,061 INFO L158 Benchmark]: Toolchain (without parser) took 19694.97ms. Allocated memory was 346.0MB in the beginning and 7.3GB in the end (delta: 6.9GB). Free memory was 298.0MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-11-30 04:50:57,061 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 346.0MB. Free memory is still 302.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:50:57,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.15ms. Allocated memory is still 346.0MB. Free memory was 297.6MB in the beginning and 273.3MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:50:57,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.34ms. Allocated memory is still 346.0MB. Free memory was 273.3MB in the beginning and 270.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:50:57,062 INFO L158 Benchmark]: Boogie Preprocessor took 24.34ms. Allocated memory is still 346.0MB. Free memory was 270.8MB in the beginning and 268.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:50:57,062 INFO L158 Benchmark]: RCFGBuilder took 894.57ms. Allocated memory was 346.0MB in the beginning and 421.5MB in the end (delta: 75.5MB). Free memory was 268.4MB in the beginning and 296.3MB in the end (delta: -28.0MB). Peak memory consumption was 53.3MB. Max. memory is 16.0GB. [2023-11-30 04:50:57,062 INFO L158 Benchmark]: TraceAbstraction took 18385.27ms. Allocated memory was 421.5MB in the beginning and 7.3GB in the end (delta: 6.8GB). Free memory was 295.3MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-11-30 04:50:57,063 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 346.0MB. Free memory is still 302.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 355.15ms. Allocated memory is still 346.0MB. Free memory was 297.6MB in the beginning and 273.3MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.34ms. Allocated memory is still 346.0MB. Free memory was 273.3MB in the beginning and 270.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.34ms. Allocated memory is still 346.0MB. Free memory was 270.8MB in the beginning and 268.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 894.57ms. Allocated memory was 346.0MB in the beginning and 421.5MB in the end (delta: 75.5MB). Free memory was 268.4MB in the beginning and 296.3MB in the end (delta: -28.0MB). Peak memory consumption was 53.3MB. Max. memory is 16.0GB. * TraceAbstraction took 18385.27ms. Allocated memory was 421.5MB in the beginning and 7.3GB in the end (delta: 6.8GB). Free memory was 295.3MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.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 - 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, 237 locations, 83 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: 18.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 588 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 588 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1050 IncrementalHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 136 mSDtfsCounter, 1050 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5229occurred in iteration=13, InterpolantAutomatonStates: 62, 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.6s InterpolantComputationTime, 1032 NumberOfCodeBlocks, 1032 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1018 ConstructedInterpolants, 0 QuantifiedInterpolants, 4063 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 46 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:50:57,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...