/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:08:25,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:08:25,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:08:25,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:08:25,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:08:25,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:08:25,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:08:25,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:08:25,689 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:08:25,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:08:25,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:08:25,692 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:08:25,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:08:25,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:08:25,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:08:25,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:08:25,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:08:25,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:08:25,694 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:08:25,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:08:25,694 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:08:25,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:08:25,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:08:25,695 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:08:25,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:08:25,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:25,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:08:25,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:08:25,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:08:25,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:08:25,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:08:25,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:08:25,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:08:25,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:08:25,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:08:25,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:08:25,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:08:25,918 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:08:25,919 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:08:25,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i [2023-12-05 21:08:27,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:08:27,311 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:08:27,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i [2023-12-05 21:08:27,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb3a5800/3eec270ffa9046b492fd9d8519f7b225/FLAGd699093a1 [2023-12-05 21:08:27,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb3a5800/3eec270ffa9046b492fd9d8519f7b225 [2023-12-05 21:08:27,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:08:27,348 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:08:27,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:27,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:08:27,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:08:27,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:27,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec5dba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27, skipping insertion in model container [2023-12-05 21:08:27,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:27,409 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:08:27,755 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:27,768 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:08:27,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:27,865 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:27,865 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:27,870 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:08:27,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27 WrapperNode [2023-12-05 21:08:27,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:27,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:27,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:08:27,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:08:27,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:27,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:27,950 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-12-05 21:08:27,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:27,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:08:27,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:08:27,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:08:27,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:27,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:27,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:27,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:27,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:28,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:28,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:28,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:28,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:08:28,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:08:28,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:08:28,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:08:28,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (1/1) ... [2023-12-05 21:08:28,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:28,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:08:28,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:08:28,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:08:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:08:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:08:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:08:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:08:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:08:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:08:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:08:28,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:08:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:08:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:08:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:08:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:08:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:08:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:08:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:08:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:08:28,085 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:08:28,228 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:08:28,230 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:08:28,608 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:08:28,946 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:08:28,946 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:08:28,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:28 BoogieIcfgContainer [2023-12-05 21:08:28,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:08:28,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:08:28,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:08:28,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:08:28,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:08:27" (1/3) ... [2023-12-05 21:08:28,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eeedb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:28, skipping insertion in model container [2023-12-05 21:08:28,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:27" (2/3) ... [2023-12-05 21:08:28,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eeedb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:28, skipping insertion in model container [2023-12-05 21:08:28,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:28" (3/3) ... [2023-12-05 21:08:28,953 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.oepc.i [2023-12-05 21:08:28,966 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:08:28,967 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2023-12-05 21:08:28,967 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:08:29,065 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:08:29,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 180 transitions, 372 flow [2023-12-05 21:08:29,190 INFO L124 PetriNetUnfolderBase]: 3/177 cut-off events. [2023-12-05 21:08:29,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:29,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 3/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 286 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-12-05 21:08:29,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 180 transitions, 372 flow [2023-12-05 21:08:29,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 177 transitions, 363 flow [2023-12-05 21:08:29,242 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:08:29,248 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;@145b9801, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:08:29,248 INFO L363 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-12-05 21:08:29,258 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:08:29,258 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2023-12-05 21:08:29,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:29,258 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:29,259 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:29,259 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:29,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash 111008763, now seen corresponding path program 1 times [2023-12-05 21:08:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:29,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058168040] [2023-12-05 21:08:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:29,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:29,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:29,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058168040] [2023-12-05 21:08:29,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058168040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:29,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:29,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733855779] [2023-12-05 21:08:29,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:29,589 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:29,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:29,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:29,619 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 180 [2023-12-05 21:08:29,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 177 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:29,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:29,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 180 [2023-12-05 21:08:29,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:31,520 INFO L124 PetriNetUnfolderBase]: 4781/9526 cut-off events. [2023-12-05 21:08:31,520 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:08:31,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16458 conditions, 9526 events. 4781/9526 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 84190 event pairs, 3061 based on Foata normal form. 304/5222 useless extension candidates. Maximal degree in co-relation 16382. Up to 4440 conditions per place. [2023-12-05 21:08:31,675 INFO L140 encePairwiseOnDemand]: 150/180 looper letters, 56 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2023-12-05 21:08:31,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 160 transitions, 445 flow [2023-12-05 21:08:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-12-05 21:08:31,703 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7981481481481482 [2023-12-05 21:08:31,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-12-05 21:08:31,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-12-05 21:08:31,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:31,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-12-05 21:08:31,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,718 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -26 predicate places. [2023-12-05 21:08:31,718 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 160 transitions, 445 flow [2023-12-05 21:08:31,718 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,718 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:31,719 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:31,719 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:08:31,719 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:31,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:31,719 INFO L85 PathProgramCache]: Analyzing trace with hash 111008764, now seen corresponding path program 1 times [2023-12-05 21:08:31,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:31,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921715279] [2023-12-05 21:08:31,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:31,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:31,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:31,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921715279] [2023-12-05 21:08:31,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921715279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:31,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:31,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:31,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731652286] [2023-12-05 21:08:31,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:31,812 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:31,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:31,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:31,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:31,813 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 180 [2023-12-05 21:08:31,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 160 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:31,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 180 [2023-12-05 21:08:31,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:33,312 INFO L124 PetriNetUnfolderBase]: 4808/9560 cut-off events. [2023-12-05 21:08:33,313 INFO L125 PetriNetUnfolderBase]: For 712/1876 co-relation queries the response was YES. [2023-12-05 21:08:33,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23141 conditions, 9560 events. 4808/9560 cut-off events. For 712/1876 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 84543 event pairs, 3088 based on Foata normal form. 0/4949 useless extension candidates. Maximal degree in co-relation 23059. Up to 4954 conditions per place. [2023-12-05 21:08:33,372 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 66 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2023-12-05 21:08:33,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 173 transitions, 633 flow [2023-12-05 21:08:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-12-05 21:08:33,378 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7129629629629629 [2023-12-05 21:08:33,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-12-05 21:08:33,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-12-05 21:08:33,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:33,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-12-05 21:08:33,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,384 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2023-12-05 21:08:33,384 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 173 transitions, 633 flow [2023-12-05 21:08:33,385 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,385 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:33,385 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:33,385 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:08:33,385 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:33,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash -61873500, now seen corresponding path program 1 times [2023-12-05 21:08:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:33,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548232303] [2023-12-05 21:08:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:33,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:33,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:33,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548232303] [2023-12-05 21:08:33,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548232303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:33,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:33,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:08:33,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034499044] [2023-12-05 21:08:33,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:33,588 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:08:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:08:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:08:33,591 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 180 [2023-12-05 21:08:33,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 173 transitions, 633 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:33,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 180 [2023-12-05 21:08:33,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:33,976 INFO L124 PetriNetUnfolderBase]: 463/1089 cut-off events. [2023-12-05 21:08:33,977 INFO L125 PetriNetUnfolderBase]: For 300/468 co-relation queries the response was YES. [2023-12-05 21:08:33,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 1089 events. 463/1089 cut-off events. For 300/468 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6070 event pairs, 261 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 3178. Up to 541 conditions per place. [2023-12-05 21:08:33,982 INFO L140 encePairwiseOnDemand]: 161/180 looper letters, 45 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2023-12-05 21:08:33,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 148 transitions, 583 flow [2023-12-05 21:08:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:08:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:08:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions. [2023-12-05 21:08:33,984 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2023-12-05 21:08:33,985 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 693 transitions. [2023-12-05 21:08:33,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 693 transitions. [2023-12-05 21:08:33,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:33,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 693 transitions. [2023-12-05 21:08:33,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,988 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,989 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -29 predicate places. [2023-12-05 21:08:33,989 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 148 transitions, 583 flow [2023-12-05 21:08:33,990 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,990 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:33,990 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:33,990 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:08:33,990 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:33,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2002634164, now seen corresponding path program 1 times [2023-12-05 21:08:33,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845907862] [2023-12-05 21:08:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845907862] [2023-12-05 21:08:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845907862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:34,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:34,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:34,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859972854] [2023-12-05 21:08:34,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:34,054 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:34,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:34,055 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 180 [2023-12-05 21:08:34,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 148 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:34,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 180 [2023-12-05 21:08:34,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:34,371 INFO L124 PetriNetUnfolderBase]: 579/1353 cut-off events. [2023-12-05 21:08:34,372 INFO L125 PetriNetUnfolderBase]: For 1203/1275 co-relation queries the response was YES. [2023-12-05 21:08:34,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4711 conditions, 1353 events. 579/1353 cut-off events. For 1203/1275 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8402 event pairs, 91 based on Foata normal form. 2/1055 useless extension candidates. Maximal degree in co-relation 4610. Up to 658 conditions per place. [2023-12-05 21:08:34,383 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 51 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2023-12-05 21:08:34,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 157 transitions, 763 flow [2023-12-05 21:08:34,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-12-05 21:08:34,385 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.687037037037037 [2023-12-05 21:08:34,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-12-05 21:08:34,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-12-05 21:08:34,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:34,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-12-05 21:08:34,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,390 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -28 predicate places. [2023-12-05 21:08:34,390 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 157 transitions, 763 flow [2023-12-05 21:08:34,390 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,390 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:34,391 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:34,391 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:08:34,391 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:34,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:34,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2002634165, now seen corresponding path program 1 times [2023-12-05 21:08:34,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:34,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346465600] [2023-12-05 21:08:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:34,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:34,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:34,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346465600] [2023-12-05 21:08:34,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346465600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:34,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:34,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885709884] [2023-12-05 21:08:34,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:34,457 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:34,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:34,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:34,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:34,458 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 180 [2023-12-05 21:08:34,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 157 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:34,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 180 [2023-12-05 21:08:34,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:34,839 INFO L124 PetriNetUnfolderBase]: 578/1350 cut-off events. [2023-12-05 21:08:34,839 INFO L125 PetriNetUnfolderBase]: For 1654/1750 co-relation queries the response was YES. [2023-12-05 21:08:34,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5594 conditions, 1350 events. 578/1350 cut-off events. For 1654/1750 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8326 event pairs, 91 based on Foata normal form. 2/1052 useless extension candidates. Maximal degree in co-relation 5484. Up to 704 conditions per place. [2023-12-05 21:08:34,847 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 53 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2023-12-05 21:08:34,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 865 flow [2023-12-05 21:08:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-12-05 21:08:34,849 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6648148148148149 [2023-12-05 21:08:34,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-12-05 21:08:34,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-12-05 21:08:34,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:34,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-12-05 21:08:34,850 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-12-05 21:08:34,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,851 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -27 predicate places. [2023-12-05 21:08:34,851 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 865 flow [2023-12-05 21:08:34,852 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,852 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:34,852 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:34,852 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:08:34,852 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:34,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:34,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1604667992, now seen corresponding path program 1 times [2023-12-05 21:08:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488067299] [2023-12-05 21:08:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:34,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488067299] [2023-12-05 21:08:34,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488067299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:34,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:34,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:34,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789995487] [2023-12-05 21:08:34,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:34,912 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:34,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:34,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:34,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:34,913 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 180 [2023-12-05 21:08:34,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 156 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:34,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 180 [2023-12-05 21:08:34,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:35,190 INFO L124 PetriNetUnfolderBase]: 691/1459 cut-off events. [2023-12-05 21:08:35,190 INFO L125 PetriNetUnfolderBase]: For 3363/3483 co-relation queries the response was YES. [2023-12-05 21:08:35,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7240 conditions, 1459 events. 691/1459 cut-off events. For 3363/3483 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 8790 event pairs, 53 based on Foata normal form. 4/1100 useless extension candidates. Maximal degree in co-relation 7122. Up to 821 conditions per place. [2023-12-05 21:08:35,202 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 61 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2023-12-05 21:08:35,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 166 transitions, 1115 flow [2023-12-05 21:08:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-12-05 21:08:35,204 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-12-05 21:08:35,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-12-05 21:08:35,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-12-05 21:08:35,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:35,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-12-05 21:08:35,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,207 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -26 predicate places. [2023-12-05 21:08:35,207 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 166 transitions, 1115 flow [2023-12-05 21:08:35,208 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,208 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:35,208 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:35,208 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:08:35,208 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:35,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:35,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1604667993, now seen corresponding path program 1 times [2023-12-05 21:08:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870488722] [2023-12-05 21:08:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:35,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:35,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870488722] [2023-12-05 21:08:35,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870488722] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:35,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:35,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406486916] [2023-12-05 21:08:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:35,244 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:35,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:35,245 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 180 [2023-12-05 21:08:35,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 166 transitions, 1115 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:35,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 180 [2023-12-05 21:08:35,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:35,650 INFO L124 PetriNetUnfolderBase]: 687/1451 cut-off events. [2023-12-05 21:08:35,651 INFO L125 PetriNetUnfolderBase]: For 4449/4593 co-relation queries the response was YES. [2023-12-05 21:08:35,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8193 conditions, 1451 events. 687/1451 cut-off events. For 4449/4593 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 8853 event pairs, 53 based on Foata normal form. 4/1092 useless extension candidates. Maximal degree in co-relation 8066. Up to 833 conditions per place. [2023-12-05 21:08:35,665 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 63 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2023-12-05 21:08:35,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 165 transitions, 1235 flow [2023-12-05 21:08:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-12-05 21:08:35,667 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2023-12-05 21:08:35,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-12-05 21:08:35,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-12-05 21:08:35,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:35,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-12-05 21:08:35,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,669 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2023-12-05 21:08:35,670 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 165 transitions, 1235 flow [2023-12-05 21:08:35,670 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,670 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:35,670 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:35,670 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:08:35,670 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:35,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1264945831, now seen corresponding path program 1 times [2023-12-05 21:08:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:35,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107102630] [2023-12-05 21:08:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:35,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:35,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107102630] [2023-12-05 21:08:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107102630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:35,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:35,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:35,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880358113] [2023-12-05 21:08:35,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:35,766 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:35,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:35,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:35,767 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 180 [2023-12-05 21:08:35,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 165 transitions, 1235 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:35,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 180 [2023-12-05 21:08:35,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:36,146 INFO L124 PetriNetUnfolderBase]: 661/1413 cut-off events. [2023-12-05 21:08:36,146 INFO L125 PetriNetUnfolderBase]: For 5643/5811 co-relation queries the response was YES. [2023-12-05 21:08:36,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8648 conditions, 1413 events. 661/1413 cut-off events. For 5643/5811 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 8594 event pairs, 45 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 8518. Up to 833 conditions per place. [2023-12-05 21:08:36,171 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 76 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2023-12-05 21:08:36,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 200 transitions, 1971 flow [2023-12-05 21:08:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-12-05 21:08:36,173 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2023-12-05 21:08:36,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-12-05 21:08:36,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-12-05 21:08:36,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:36,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-12-05 21:08:36,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,177 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2023-12-05 21:08:36,178 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 200 transitions, 1971 flow [2023-12-05 21:08:36,178 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,178 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:36,178 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:36,178 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:08:36,178 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:36,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash 977106600, now seen corresponding path program 1 times [2023-12-05 21:08:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:36,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555193855] [2023-12-05 21:08:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:36,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:36,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555193855] [2023-12-05 21:08:36,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555193855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:36,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:36,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:08:36,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97038487] [2023-12-05 21:08:36,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:36,279 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:08:36,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:36,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:08:36,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:08:36,280 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 180 [2023-12-05 21:08:36,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 200 transitions, 1971 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:36,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 180 [2023-12-05 21:08:36,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:36,652 INFO L124 PetriNetUnfolderBase]: 710/1739 cut-off events. [2023-12-05 21:08:36,653 INFO L125 PetriNetUnfolderBase]: For 8631/8823 co-relation queries the response was YES. [2023-12-05 21:08:36,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10740 conditions, 1739 events. 710/1739 cut-off events. For 8631/8823 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 12214 event pairs, 41 based on Foata normal form. 0/1394 useless extension candidates. Maximal degree in co-relation 10599. Up to 967 conditions per place. [2023-12-05 21:08:36,664 INFO L140 encePairwiseOnDemand]: 168/180 looper letters, 97 selfloop transitions, 26 changer transitions 0/223 dead transitions. [2023-12-05 21:08:36,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 223 transitions, 2593 flow [2023-12-05 21:08:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:08:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:08:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-12-05 21:08:36,665 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6819444444444445 [2023-12-05 21:08:36,666 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-12-05 21:08:36,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-12-05 21:08:36,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:36,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-12-05 21:08:36,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,668 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,669 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2023-12-05 21:08:36,669 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 223 transitions, 2593 flow [2023-12-05 21:08:36,669 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,669 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:36,669 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:36,669 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:08:36,669 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:36,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash 977106601, now seen corresponding path program 1 times [2023-12-05 21:08:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:36,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317738819] [2023-12-05 21:08:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:36,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:36,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317738819] [2023-12-05 21:08:36,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317738819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:36,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:36,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:08:36,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565635760] [2023-12-05 21:08:36,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:36,855 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:08:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:36,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:08:36,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:08:36,856 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 180 [2023-12-05 21:08:36,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 223 transitions, 2593 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:36,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 180 [2023-12-05 21:08:36,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:37,195 INFO L124 PetriNetUnfolderBase]: 703/1726 cut-off events. [2023-12-05 21:08:37,195 INFO L125 PetriNetUnfolderBase]: For 10727/10943 co-relation queries the response was YES. [2023-12-05 21:08:37,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11436 conditions, 1726 events. 703/1726 cut-off events. For 10727/10943 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 12115 event pairs, 37 based on Foata normal form. 0/1387 useless extension candidates. Maximal degree in co-relation 11285. Up to 967 conditions per place. [2023-12-05 21:08:37,212 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 104 selfloop transitions, 9 changer transitions 0/222 dead transitions. [2023-12-05 21:08:37,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 222 transitions, 2799 flow [2023-12-05 21:08:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:08:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:08:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2023-12-05 21:08:37,213 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6805555555555556 [2023-12-05 21:08:37,213 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2023-12-05 21:08:37,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2023-12-05 21:08:37,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:37,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2023-12-05 21:08:37,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,216 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,216 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -19 predicate places. [2023-12-05 21:08:37,216 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 222 transitions, 2799 flow [2023-12-05 21:08:37,217 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,217 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:37,217 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:37,217 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:08:37,217 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:37,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:37,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1435629293, now seen corresponding path program 1 times [2023-12-05 21:08:37,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:37,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932008568] [2023-12-05 21:08:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:37,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:37,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:37,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932008568] [2023-12-05 21:08:37,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932008568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:37,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:37,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:08:37,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260070110] [2023-12-05 21:08:37,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:37,477 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:08:37,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:37,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:08:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:08:37,478 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 180 [2023-12-05 21:08:37,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 222 transitions, 2799 flow. Second operand has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:37,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 180 [2023-12-05 21:08:37,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:37,864 INFO L124 PetriNetUnfolderBase]: 545/1566 cut-off events. [2023-12-05 21:08:37,864 INFO L125 PetriNetUnfolderBase]: For 11603/11843 co-relation queries the response was YES. [2023-12-05 21:08:37,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10509 conditions, 1566 events. 545/1566 cut-off events. For 11603/11843 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11311 event pairs, 37 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 10347. Up to 815 conditions per place. [2023-12-05 21:08:37,876 INFO L140 encePairwiseOnDemand]: 164/180 looper letters, 111 selfloop transitions, 24 changer transitions 0/232 dead transitions. [2023-12-05 21:08:37,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 232 transitions, 3283 flow [2023-12-05 21:08:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:08:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:08:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 890 transitions. [2023-12-05 21:08:37,878 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2023-12-05 21:08:37,878 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 890 transitions. [2023-12-05 21:08:37,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 890 transitions. [2023-12-05 21:08:37,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:37,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 890 transitions. [2023-12-05 21:08:37,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.25) internal successors, (890), 8 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-12-05 21:08:37,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,882 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,883 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2023-12-05 21:08:37,883 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 232 transitions, 3283 flow [2023-12-05 21:08:37,883 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,883 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:37,883 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:37,884 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:08:37,884 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-12-05 21:08:37,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash -591811901, now seen corresponding path program 1 times [2023-12-05 21:08:37,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:37,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61386517] [2023-12-05 21:08:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:37,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:38,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61386517] [2023-12-05 21:08:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61386517] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:38,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:38,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:08:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756063384] [2023-12-05 21:08:38,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:38,235 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:08:38,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:38,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:08:38,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:08:38,237 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 180 [2023-12-05 21:08:38,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 232 transitions, 3283 flow. Second operand has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:38,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:38,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 180 [2023-12-05 21:08:38,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:38,533 INFO L124 PetriNetUnfolderBase]: 272/856 cut-off events. [2023-12-05 21:08:38,533 INFO L125 PetriNetUnfolderBase]: For 7685/7949 co-relation queries the response was YES. [2023-12-05 21:08:38,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5824 conditions, 856 events. 272/856 cut-off events. For 7685/7949 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4549 event pairs, 16 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 5651. Up to 335 conditions per place. [2023-12-05 21:08:38,537 INFO L140 encePairwiseOnDemand]: 167/180 looper letters, 0 selfloop transitions, 0 changer transitions 214/214 dead transitions. [2023-12-05 21:08:38,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 214 transitions, 3087 flow [2023-12-05 21:08:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:08:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:08:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 963 transitions. [2023-12-05 21:08:38,540 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2023-12-05 21:08:38,540 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 963 transitions. [2023-12-05 21:08:38,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 963 transitions. [2023-12-05 21:08:38,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:38,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 963 transitions. [2023-12-05 21:08:38,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:38,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:38,544 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:38,544 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, -9 predicate places. [2023-12-05 21:08:38,544 INFO L500 AbstractCegarLoop]: Abstraction has has 175 places, 214 transitions, 3087 flow [2023-12-05 21:08:38,545 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:38,557 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/rfi009_power.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:08:38,599 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 83 remaining) [2023-12-05 21:08:38,600 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 83 remaining) [2023-12-05 21:08:38,601 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 83 remaining) [2023-12-05 21:08:38,601 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 83 remaining) [2023-12-05 21:08:38,601 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 83 remaining) [2023-12-05 21:08:38,601 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 83 remaining) [2023-12-05 21:08:38,601 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 83 remaining) [2023-12-05 21:08:38,601 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 83 remaining) [2023-12-05 21:08:38,601 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 83 remaining) [2023-12-05 21:08:38,601 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 83 remaining) [2023-12-05 21:08:38,602 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 83 remaining) [2023-12-05 21:08:38,602 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 83 remaining) [2023-12-05 21:08:38,602 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 83 remaining) [2023-12-05 21:08:38,603 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 83 remaining) [2023-12-05 21:08:38,603 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 83 remaining) [2023-12-05 21:08:38,603 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 83 remaining) [2023-12-05 21:08:38,603 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 83 remaining) [2023-12-05 21:08:38,603 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 83 remaining) [2023-12-05 21:08:38,603 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 83 remaining) [2023-12-05 21:08:38,603 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 83 remaining) [2023-12-05 21:08:38,603 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 83 remaining) [2023-12-05 21:08:38,604 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 83 remaining) [2023-12-05 21:08:38,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 83 remaining) [2023-12-05 21:08:38,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 83 remaining) [2023-12-05 21:08:38,607 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 83 remaining) [2023-12-05 21:08:38,607 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 83 remaining) [2023-12-05 21:08:38,607 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 83 remaining) [2023-12-05 21:08:38,607 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 83 remaining) [2023-12-05 21:08:38,607 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 83 remaining) [2023-12-05 21:08:38,607 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:08:38,608 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:38,612 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:08:38,612 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:08:38,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:08:38 BasicIcfg [2023-12-05 21:08:38,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:08:38,619 INFO L158 Benchmark]: Toolchain (without parser) took 11271.19ms. Allocated memory was 189.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 130.4MB in the beginning and 440.2MB in the end (delta: -309.8MB). Peak memory consumption was 817.0MB. Max. memory is 8.0GB. [2023-12-05 21:08:38,619 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:08:38,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.01ms. Allocated memory is still 189.8MB. Free memory was 130.4MB in the beginning and 105.4MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-05 21:08:38,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.29ms. Allocated memory was 189.8MB in the beginning and 292.6MB in the end (delta: 102.8MB). Free memory was 105.4MB in the beginning and 259.1MB in the end (delta: -153.7MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2023-12-05 21:08:38,621 INFO L158 Benchmark]: Boogie Preprocessor took 65.57ms. Allocated memory is still 292.6MB. Free memory was 259.1MB in the beginning and 256.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:08:38,621 INFO L158 Benchmark]: RCFGBuilder took 929.98ms. Allocated memory is still 292.6MB. Free memory was 256.5MB in the beginning and 188.8MB in the end (delta: 67.6MB). Peak memory consumption was 86.0MB. Max. memory is 8.0GB. [2023-12-05 21:08:38,621 INFO L158 Benchmark]: TraceAbstraction took 9669.63ms. Allocated memory was 292.6MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 188.3MB in the beginning and 440.2MB in the end (delta: -251.9MB). Peak memory consumption was 771.5MB. Max. memory is 8.0GB. [2023-12-05 21:08:38,622 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 521.01ms. Allocated memory is still 189.8MB. Free memory was 130.4MB in the beginning and 105.4MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.29ms. Allocated memory was 189.8MB in the beginning and 292.6MB in the end (delta: 102.8MB). Free memory was 105.4MB in the beginning and 259.1MB in the end (delta: -153.7MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.57ms. Allocated memory is still 292.6MB. Free memory was 259.1MB in the beginning and 256.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 929.98ms. Allocated memory is still 292.6MB. Free memory was 256.5MB in the beginning and 188.8MB in the end (delta: 67.6MB). Peak memory consumption was 86.0MB. Max. memory is 8.0GB. * TraceAbstraction took 9669.63ms. Allocated memory was 292.6MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 188.3MB in the beginning and 440.2MB in the end (delta: -251.9MB). Peak memory consumption was 771.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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, 239 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: 9.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 871 IncrementalHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 122 mSDtfsCounter, 871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3283occurred in iteration=11, InterpolantAutomatonStates: 52, 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.5s InterpolantComputationTime, 901 NumberOfCodeBlocks, 901 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 889 ConstructedInterpolants, 0 QuantifiedInterpolants, 3586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-12-05 21:08:38,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...