/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/mix055_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:08:09,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:08:09,798 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:09,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:08:09,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:08:09,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:08:09,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:08:09,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:08:09,829 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:08:09,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:08:09,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:08:09,832 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:08:09,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:08:09,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:08:09,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:08:09,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:08:09,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:08:09,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:08:09,834 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:08:09,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:08:09,834 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:08:09,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:08:09,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:08:09,835 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:08:09,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:08:09,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:09,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:08:09,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:08:09,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:08:09,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:08:09,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:08:09,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:08:09,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:08:09,837 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:10,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:08:10,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:08:10,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:08:10,057 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:08:10,057 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:08:10,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-12-05 21:08:11,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:08:11,271 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:08:11,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-12-05 21:08:11,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f541ffc8/1d185042d4804aa7984d7b6bf2429850/FLAG10f430fd1 [2023-12-05 21:08:11,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f541ffc8/1d185042d4804aa7984d7b6bf2429850 [2023-12-05 21:08:11,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:08:11,310 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:08:11,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:11,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:08:11,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:08:11,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:11" (1/1) ... [2023-12-05 21:08:11,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17308f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:11, skipping insertion in model container [2023-12-05 21:08:11,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:11" (1/1) ... [2023-12-05 21:08:11,366 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:08:11,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:11,677 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:08:11,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:11,771 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:11,771 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:11,776 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:08:11,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:11 WrapperNode [2023-12-05 21:08:11,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:11,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:11,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:08:11,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:08:11,783 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:11" (1/1) ... [2023-12-05 21:08:11,812 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:11" (1/1) ... [2023-12-05 21:08:11,843 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2023-12-05 21:08:11,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:11,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:08:11,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:08:11,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:08:11,851 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:11" (1/1) ... [2023-12-05 21:08:11,852 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:11" (1/1) ... [2023-12-05 21:08:11,863 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:11" (1/1) ... [2023-12-05 21:08:11,864 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:11" (1/1) ... [2023-12-05 21:08:11,872 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:11" (1/1) ... [2023-12-05 21:08:11,874 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:11" (1/1) ... [2023-12-05 21:08:11,875 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:11" (1/1) ... [2023-12-05 21:08:11,876 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:11" (1/1) ... [2023-12-05 21:08:11,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:08:11,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:08:11,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:08:11,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:08:11,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:11" (1/1) ... [2023-12-05 21:08:11,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:11,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:08:11,915 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:11,926 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:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:08:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:08:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:08:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:08:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:08:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:08:11,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:08:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:08:11,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:08:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:08:11,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:08:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:08:11,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:08:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:08:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:08:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:08:11,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:08:11,941 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:12,043 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:08:12,045 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:08:12,354 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:08:12,440 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:08:12,441 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:08:12,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:12 BoogieIcfgContainer [2023-12-05 21:08:12,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:08:12,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:08:12,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:08:12,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:08:12,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:08:11" (1/3) ... [2023-12-05 21:08:12,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3542cb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:12, skipping insertion in model container [2023-12-05 21:08:12,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:11" (2/3) ... [2023-12-05 21:08:12,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3542cb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:12, skipping insertion in model container [2023-12-05 21:08:12,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:12" (3/3) ... [2023-12-05 21:08:12,447 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-12-05 21:08:12,459 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:08:12,459 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-05 21:08:12,459 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:08:12,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:08:12,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 300 flow [2023-12-05 21:08:12,621 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-12-05 21:08:12,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:12,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2023-12-05 21:08:12,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 300 flow [2023-12-05 21:08:12,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 90 transitions, 189 flow [2023-12-05 21:08:12,648 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:08:12,656 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;@41cd0b59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:08:12,657 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-12-05 21:08:12,662 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:08:12,662 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2023-12-05 21:08:12,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:12,662 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:12,663 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:12,663 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:08:12,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash -593501291, now seen corresponding path program 1 times [2023-12-05 21:08:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970960684] [2023-12-05 21:08:12,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:12,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:12,878 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:12,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:12,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970960684] [2023-12-05 21:08:12,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970960684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:12,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:12,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891198346] [2023-12-05 21:08:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:12,889 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:12,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:12,918 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 142 [2023-12-05 21:08:12,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:12,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:12,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 142 [2023-12-05 21:08:12,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:13,068 INFO L124 PetriNetUnfolderBase]: 85/347 cut-off events. [2023-12-05 21:08:13,068 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:08:13,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 347 events. 85/347 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1616 event pairs, 85 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 478. Up to 160 conditions per place. [2023-12-05 21:08:13,071 INFO L140 encePairwiseOnDemand]: 140/142 looper letters, 21 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:08:13,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 231 flow [2023-12-05 21:08:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-12-05 21:08:13,086 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7863849765258216 [2023-12-05 21:08:13,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-12-05 21:08:13,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-12-05 21:08:13,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:13,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-12-05 21:08:13,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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:13,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:13,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:13,100 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2023-12-05 21:08:13,101 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 89 transitions, 231 flow [2023-12-05 21:08:13,101 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:13,101 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:13,101 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:13,101 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:08:13,102 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:08:13,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash -593501290, now seen corresponding path program 1 times [2023-12-05 21:08:13,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:13,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468893321] [2023-12-05 21:08:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:13,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:13,265 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:13,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:13,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468893321] [2023-12-05 21:08:13,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468893321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:13,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:13,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:13,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048052127] [2023-12-05 21:08:13,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:13,267 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:13,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:13,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:13,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:13,269 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 142 [2023-12-05 21:08:13,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 89 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:13,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:13,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 142 [2023-12-05 21:08:13,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:13,392 INFO L124 PetriNetUnfolderBase]: 114/381 cut-off events. [2023-12-05 21:08:13,393 INFO L125 PetriNetUnfolderBase]: For 95/97 co-relation queries the response was YES. [2023-12-05 21:08:13,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 381 events. 114/381 cut-off events. For 95/97 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1811 event pairs, 114 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 727. Up to 188 conditions per place. [2023-12-05 21:08:13,399 INFO L140 encePairwiseOnDemand]: 140/142 looper letters, 19 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-12-05 21:08:13,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 267 flow [2023-12-05 21:08:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-12-05 21:08:13,402 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8098591549295775 [2023-12-05 21:08:13,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-12-05 21:08:13,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-12-05 21:08:13,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:13,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-12-05 21:08:13,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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:13,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:13,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:13,407 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 2 predicate places. [2023-12-05 21:08:13,408 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 88 transitions, 267 flow [2023-12-05 21:08:13,409 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:13,409 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:13,409 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] [2023-12-05 21:08:13,409 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:08:13,409 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:08:13,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash 429761292, now seen corresponding path program 1 times [2023-12-05 21:08:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:13,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157180249] [2023-12-05 21:08:13,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:13,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:13,547 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:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:13,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157180249] [2023-12-05 21:08:13,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157180249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:13,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:13,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:13,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255915222] [2023-12-05 21:08:13,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:13,553 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:13,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:13,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:13,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:13,556 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 142 [2023-12-05 21:08:13,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 88 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:13,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:13,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 142 [2023-12-05 21:08:13,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:13,652 INFO L124 PetriNetUnfolderBase]: 112/364 cut-off events. [2023-12-05 21:08:13,652 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-12-05 21:08:13,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 364 events. 112/364 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1664 event pairs, 54 based on Foata normal form. 3/367 useless extension candidates. Maximal degree in co-relation 886. Up to 186 conditions per place. [2023-12-05 21:08:13,656 INFO L140 encePairwiseOnDemand]: 140/142 looper letters, 21 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:08:13,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 89 transitions, 319 flow [2023-12-05 21:08:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-12-05 21:08:13,658 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8145539906103286 [2023-12-05 21:08:13,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-12-05 21:08:13,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-12-05 21:08:13,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:13,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-12-05 21:08:13,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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:13,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:13,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:13,661 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 3 predicate places. [2023-12-05 21:08:13,661 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 319 flow [2023-12-05 21:08:13,662 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:13,662 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:13,662 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] [2023-12-05 21:08:13,662 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:08:13,662 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:08:13,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:13,663 INFO L85 PathProgramCache]: Analyzing trace with hash 429761291, now seen corresponding path program 1 times [2023-12-05 21:08:13,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:13,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961357294] [2023-12-05 21:08:13,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:13,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:13,735 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:13,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:13,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961357294] [2023-12-05 21:08:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961357294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:13,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:13,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343408381] [2023-12-05 21:08:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:13,737 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:13,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:13,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:13,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:13,738 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 142 [2023-12-05 21:08:13,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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:13,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:13,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 142 [2023-12-05 21:08:13,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:13,827 INFO L124 PetriNetUnfolderBase]: 110/359 cut-off events. [2023-12-05 21:08:13,827 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2023-12-05 21:08:13,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 359 events. 110/359 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1629 event pairs, 54 based on Foata normal form. 3/362 useless extension candidates. Maximal degree in co-relation 1047. Up to 181 conditions per place. [2023-12-05 21:08:13,830 INFO L140 encePairwiseOnDemand]: 140/142 looper letters, 21 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-12-05 21:08:13,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 357 flow [2023-12-05 21:08:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-12-05 21:08:13,832 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7863849765258216 [2023-12-05 21:08:13,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-12-05 21:08:13,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-12-05 21:08:13,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:13,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-12-05 21:08:13,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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:13,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:13,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:13,836 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 4 predicate places. [2023-12-05 21:08:13,836 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 88 transitions, 357 flow [2023-12-05 21:08:13,836 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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:13,836 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:13,836 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] [2023-12-05 21:08:13,836 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:08:13,836 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:08:13,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1769939479, now seen corresponding path program 1 times [2023-12-05 21:08:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89276933] [2023-12-05 21:08:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:13,889 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:13,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:13,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89276933] [2023-12-05 21:08:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89276933] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:13,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562782325] [2023-12-05 21:08:13,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:13,891 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:13,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:13,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:13,922 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 142 [2023-12-05 21:08:13,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 88 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:13,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:13,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 142 [2023-12-05 21:08:13,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:13,992 INFO L124 PetriNetUnfolderBase]: 103/346 cut-off events. [2023-12-05 21:08:13,992 INFO L125 PetriNetUnfolderBase]: For 625/625 co-relation queries the response was YES. [2023-12-05 21:08:13,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 346 events. 103/346 cut-off events. For 625/625 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1534 event pairs, 18 based on Foata normal form. 6/352 useless extension candidates. Maximal degree in co-relation 1165. Up to 174 conditions per place. [2023-12-05 21:08:13,995 INFO L140 encePairwiseOnDemand]: 140/142 looper letters, 24 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-12-05 21:08:13,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 90 transitions, 431 flow [2023-12-05 21:08:13,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-12-05 21:08:13,997 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7887323943661971 [2023-12-05 21:08:13,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-12-05 21:08:13,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-12-05 21:08:13,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:13,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-12-05 21:08:13,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:13,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:13,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:14,001 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2023-12-05 21:08:14,001 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 90 transitions, 431 flow [2023-12-05 21:08:14,001 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:14,001 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:14,002 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] [2023-12-05 21:08:14,002 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:08:14,005 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:08:14,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1769939480, now seen corresponding path program 1 times [2023-12-05 21:08:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334583896] [2023-12-05 21:08:14,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:14,095 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:14,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334583896] [2023-12-05 21:08:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334583896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:14,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964424221] [2023-12-05 21:08:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:14,097 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:14,099 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 142 [2023-12-05 21:08:14,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 90 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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:14,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:14,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 142 [2023-12-05 21:08:14,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:14,165 INFO L124 PetriNetUnfolderBase]: 96/333 cut-off events. [2023-12-05 21:08:14,165 INFO L125 PetriNetUnfolderBase]: For 858/858 co-relation queries the response was YES. [2023-12-05 21:08:14,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 333 events. 96/333 cut-off events. For 858/858 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1448 event pairs, 18 based on Foata normal form. 6/339 useless extension candidates. Maximal degree in co-relation 1257. Up to 161 conditions per place. [2023-12-05 21:08:14,168 INFO L140 encePairwiseOnDemand]: 140/142 looper letters, 22 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:08:14,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 89 transitions, 469 flow [2023-12-05 21:08:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-12-05 21:08:14,169 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.812206572769953 [2023-12-05 21:08:14,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-12-05 21:08:14,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-12-05 21:08:14,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:14,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-12-05 21:08:14,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:14,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:14,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:14,173 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 6 predicate places. [2023-12-05 21:08:14,174 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 469 flow [2023-12-05 21:08:14,174 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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:14,174 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:14,174 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] [2023-12-05 21:08:14,174 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:08:14,174 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:08:14,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:14,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1002208633, now seen corresponding path program 1 times [2023-12-05 21:08:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:14,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192278031] [2023-12-05 21:08:14,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:14,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:14,216 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:14,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:14,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192278031] [2023-12-05 21:08:14,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192278031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:14,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:14,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882201552] [2023-12-05 21:08:14,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:14,220 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:14,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:14,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:14,221 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 142 [2023-12-05 21:08:14,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 469 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:14,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:14,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 142 [2023-12-05 21:08:14,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:14,285 INFO L124 PetriNetUnfolderBase]: 76/301 cut-off events. [2023-12-05 21:08:14,285 INFO L125 PetriNetUnfolderBase]: For 978/978 co-relation queries the response was YES. [2023-12-05 21:08:14,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 301 events. 76/301 cut-off events. For 978/978 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1254 event pairs, 0 based on Foata normal form. 12/313 useless extension candidates. Maximal degree in co-relation 1207. Up to 141 conditions per place. [2023-12-05 21:08:14,287 INFO L140 encePairwiseOnDemand]: 140/142 looper letters, 27 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2023-12-05 21:08:14,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 92 transitions, 573 flow [2023-12-05 21:08:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-12-05 21:08:14,289 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7887323943661971 [2023-12-05 21:08:14,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-12-05 21:08:14,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-12-05 21:08:14,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:14,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-12-05 21:08:14,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:14,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:14,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:14,292 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 7 predicate places. [2023-12-05 21:08:14,292 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 92 transitions, 573 flow [2023-12-05 21:08:14,292 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:14,293 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:14,293 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] [2023-12-05 21:08:14,293 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:08:14,293 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:08:14,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1002208634, now seen corresponding path program 1 times [2023-12-05 21:08:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:14,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834211575] [2023-12-05 21:08:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:14,376 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:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834211575] [2023-12-05 21:08:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834211575] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050807850] [2023-12-05 21:08:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:14,378 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:14,379 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 142 [2023-12-05 21:08:14,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 92 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:14,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:14,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 142 [2023-12-05 21:08:14,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:14,440 INFO L124 PetriNetUnfolderBase]: 56/269 cut-off events. [2023-12-05 21:08:14,440 INFO L125 PetriNetUnfolderBase]: For 1072/1072 co-relation queries the response was YES. [2023-12-05 21:08:14,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 269 events. 56/269 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1089 event pairs, 0 based on Foata normal form. 12/281 useless extension candidates. Maximal degree in co-relation 1093. Up to 109 conditions per place. [2023-12-05 21:08:14,442 INFO L140 encePairwiseOnDemand]: 140/142 looper letters, 0 selfloop transitions, 0 changer transitions 91/91 dead transitions. [2023-12-05 21:08:14,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 91 transitions, 615 flow [2023-12-05 21:08:14,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-12-05 21:08:14,444 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.812206572769953 [2023-12-05 21:08:14,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-12-05 21:08:14,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-12-05 21:08:14,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:14,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-12-05 21:08:14,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:14,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:14,447 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:14,448 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 8 predicate places. [2023-12-05 21:08:14,448 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 91 transitions, 615 flow [2023-12-05 21:08:14,448 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:14,455 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix055_power.oepc_pso.oepc_rmo.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:08:14,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-12-05 21:08:14,509 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-12-05 21:08:14,511 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-12-05 21:08:14,512 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-12-05 21:08:14,512 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-12-05 21:08:14,512 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-12-05 21:08:14,516 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-12-05 21:08:14,516 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-12-05 21:08:14,516 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-12-05 21:08:14,516 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-12-05 21:08:14,516 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-12-05 21:08:14,517 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-12-05 21:08:14,517 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:08:14,517 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:14,520 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:08:14,520 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:08:14,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:08:14 BasicIcfg [2023-12-05 21:08:14,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:08:14,527 INFO L158 Benchmark]: Toolchain (without parser) took 3217.22ms. Allocated memory was 213.9MB in the beginning and 317.7MB in the end (delta: 103.8MB). Free memory was 165.2MB in the beginning and 273.6MB in the end (delta: -108.3MB). Peak memory consumption was 174.6MB. Max. memory is 8.0GB. [2023-12-05 21:08:14,527 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:08:14,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.25ms. Allocated memory is still 213.9MB. Free memory was 164.9MB in the beginning and 140.8MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-05 21:08:14,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.11ms. Allocated memory is still 213.9MB. Free memory was 140.8MB in the beginning and 138.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:08:14,528 INFO L158 Benchmark]: Boogie Preprocessor took 34.40ms. Allocated memory is still 213.9MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:08:14,528 INFO L158 Benchmark]: RCFGBuilder took 562.60ms. Allocated memory is still 213.9MB. Free memory was 135.9MB in the beginning and 155.2MB in the end (delta: -19.3MB). Peak memory consumption was 31.4MB. Max. memory is 8.0GB. [2023-12-05 21:08:14,528 INFO L158 Benchmark]: TraceAbstraction took 2083.46ms. Allocated memory was 213.9MB in the beginning and 317.7MB in the end (delta: 103.8MB). Free memory was 154.2MB in the beginning and 273.6MB in the end (delta: -119.4MB). Peak memory consumption was 163.2MB. Max. memory is 8.0GB. [2023-12-05 21:08:14,529 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.25ms. Allocated memory is still 213.9MB. Free memory was 164.9MB in the beginning and 140.8MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.11ms. Allocated memory is still 213.9MB. Free memory was 140.8MB in the beginning and 138.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.40ms. Allocated memory is still 213.9MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 562.60ms. Allocated memory is still 213.9MB. Free memory was 135.9MB in the beginning and 155.2MB in the end (delta: -19.3MB). Peak memory consumption was 31.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2083.46ms. Allocated memory was 213.9MB in the beginning and 317.7MB in the end (delta: 103.8MB). Free memory was 154.2MB in the beginning and 273.6MB in the end (delta: -119.4MB). Peak memory consumption was 163.2MB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 176 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 196 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=615occurred in iteration=8, InterpolantAutomatonStates: 24, 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, 0.6s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:08:14,561 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...