/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/mix036_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:07:38,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:07:38,207 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:07:38,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:07:38,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:07:38,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:07:38,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:07:38,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:07:38,227 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:07:38,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:07:38,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:07:38,230 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:07:38,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:07:38,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:07:38,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:07:38,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:07:38,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:07:38,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:07:38,232 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:07:38,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:07:38,232 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:07:38,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:07:38,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:07:38,233 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:07:38,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:07:38,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:07:38,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:07:38,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:07:38,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:07:38,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:07:38,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:07:38,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:07:38,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:07:38,235 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:07:38,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:07:38,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:07:38,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:07:38,452 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:07:38,452 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:07:38,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2023-12-05 21:07:39,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:07:39,589 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:07:39,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2023-12-05 21:07:39,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2724a8f/bb456ac490584c6fa5b806d31bfa9b92/FLAG69ac15536 [2023-12-05 21:07:39,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2724a8f/bb456ac490584c6fa5b806d31bfa9b92 [2023-12-05 21:07:39,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:07:39,618 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:07:39,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:07:39,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:07:39,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:07:39,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:07:39" (1/1) ... [2023-12-05 21:07:39,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3b346a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:39, skipping insertion in model container [2023-12-05 21:07:39,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:07:39" (1/1) ... [2023-12-05 21:07:39,658 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:07:39,967 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:07:39,979 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:07:40,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:07:40,032 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:07:40,033 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:07:40,037 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:07:40,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40 WrapperNode [2023-12-05 21:07:40,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:07:40,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:07:40,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:07:40,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:07:40,045 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:07:40" (1/1) ... [2023-12-05 21:07:40,070 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:07:40" (1/1) ... [2023-12-05 21:07:40,087 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-12-05 21:07:40,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:07:40,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:07:40,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:07:40,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:07:40,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40" (1/1) ... [2023-12-05 21:07:40,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40" (1/1) ... [2023-12-05 21:07:40,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40" (1/1) ... [2023-12-05 21:07:40,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40" (1/1) ... [2023-12-05 21:07:40,116 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40" (1/1) ... [2023-12-05 21:07:40,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40" (1/1) ... [2023-12-05 21:07:40,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40" (1/1) ... [2023-12-05 21:07:40,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40" (1/1) ... [2023-12-05 21:07:40,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:07:40,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:07:40,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:07:40,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:07:40,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40" (1/1) ... [2023-12-05 21:07:40,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:07:40,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:07:40,159 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:07:40,177 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:07:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:07:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:07:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:07:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:07:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:07:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:07:40,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:07:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:07:40,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:07:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:07:40,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:07:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:07:40,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:07:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:07:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:07:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:07:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:07:40,185 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:07:40,350 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:07:40,353 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:07:40,606 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:07:40,691 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:07:40,691 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:07:40,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:07:40 BoogieIcfgContainer [2023-12-05 21:07:40,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:07:40,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:07:40,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:07:40,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:07:40,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:07:39" (1/3) ... [2023-12-05 21:07:40,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689599aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:07:40, skipping insertion in model container [2023-12-05 21:07:40,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:40" (2/3) ... [2023-12-05 21:07:40,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689599aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:07:40, skipping insertion in model container [2023-12-05 21:07:40,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:07:40" (3/3) ... [2023-12-05 21:07:40,698 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_power.opt_rmo.opt.i [2023-12-05 21:07:40,711 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:07:40,711 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-05 21:07:40,711 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:07:40,764 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:07:40,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 148 transitions, 312 flow [2023-12-05 21:07:40,842 INFO L124 PetriNetUnfolderBase]: 3/144 cut-off events. [2023-12-05 21:07:40,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:07:40,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 3/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-12-05 21:07:40,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 148 transitions, 312 flow [2023-12-05 21:07:40,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 94 transitions, 197 flow [2023-12-05 21:07:40,883 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:07:40,888 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;@320068f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:07:40,888 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-12-05 21:07:40,899 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:07:40,899 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2023-12-05 21:07:40,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:07:40,899 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:40,900 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] [2023-12-05 21:07:40,900 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:07:40,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash -216408585, now seen corresponding path program 1 times [2023-12-05 21:07:40,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:40,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844164370] [2023-12-05 21:07:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:41,138 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:07:41,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:41,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844164370] [2023-12-05 21:07:41,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844164370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:41,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:41,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:41,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579598436] [2023-12-05 21:07:41,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:41,148 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:41,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:41,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:41,174 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 148 [2023-12-05 21:07:41,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:41,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:41,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 148 [2023-12-05 21:07:41,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:41,281 INFO L124 PetriNetUnfolderBase]: 20/158 cut-off events. [2023-12-05 21:07:41,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:07:41,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 158 events. 20/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 350 event pairs, 20 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 166. Up to 53 conditions per place. [2023-12-05 21:07:41,283 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 20 selfloop transitions, 1 changer transitions 0/93 dead transitions. [2023-12-05 21:07:41,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 237 flow [2023-12-05 21:07:41,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-12-05 21:07:41,295 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8063063063063063 [2023-12-05 21:07:41,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-12-05 21:07:41,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-12-05 21:07:41,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:41,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-12-05 21:07:41,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:41,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:41,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:41,306 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2023-12-05 21:07:41,307 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 237 flow [2023-12-05 21:07:41,307 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:41,307 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:41,307 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] [2023-12-05 21:07:41,307 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:07:41,308 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:07:41,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:41,308 INFO L85 PathProgramCache]: Analyzing trace with hash -216408584, now seen corresponding path program 1 times [2023-12-05 21:07:41,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:41,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491604895] [2023-12-05 21:07:41,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:41,454 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:07:41,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:41,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491604895] [2023-12-05 21:07:41,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491604895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:41,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:41,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:41,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134948438] [2023-12-05 21:07:41,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:41,457 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:41,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:41,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:41,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:41,458 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2023-12-05 21:07:41,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 93 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:07:41,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:41,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2023-12-05 21:07:41,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:41,530 INFO L124 PetriNetUnfolderBase]: 28/191 cut-off events. [2023-12-05 21:07:41,531 INFO L125 PetriNetUnfolderBase]: For 32/36 co-relation queries the response was YES. [2023-12-05 21:07:41,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 191 events. 28/191 cut-off events. For 32/36 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 563 event pairs, 28 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 265. Up to 60 conditions per place. [2023-12-05 21:07:41,532 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 18 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2023-12-05 21:07:41,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 92 transitions, 271 flow [2023-12-05 21:07:41,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-12-05 21:07:41,535 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8288288288288288 [2023-12-05 21:07:41,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-12-05 21:07:41,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-12-05 21:07:41,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:41,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-12-05 21:07:41,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:41,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:41,539 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:41,539 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 2 predicate places. [2023-12-05 21:07:41,539 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 92 transitions, 271 flow [2023-12-05 21:07:41,540 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:07:41,540 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:41,540 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] [2023-12-05 21:07:41,540 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:07:41,540 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:41,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash 565949094, now seen corresponding path program 1 times [2023-12-05 21:07:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241874659] [2023-12-05 21:07:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:41,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:41,618 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:07:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241874659] [2023-12-05 21:07:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241874659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:41,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801025755] [2023-12-05 21:07:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:41,620 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:41,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:41,622 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 148 [2023-12-05 21:07:41,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 92 transitions, 271 flow. Second operand has 3 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:07:41,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:41,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 148 [2023-12-05 21:07:41,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:41,688 INFO L124 PetriNetUnfolderBase]: 28/190 cut-off events. [2023-12-05 21:07:41,689 INFO L125 PetriNetUnfolderBase]: For 93/105 co-relation queries the response was YES. [2023-12-05 21:07:41,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 190 events. 28/190 cut-off events. For 93/105 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 551 event pairs, 28 based on Foata normal form. 1/185 useless extension candidates. Maximal degree in co-relation 320. Up to 60 conditions per place. [2023-12-05 21:07:41,693 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 19 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-12-05 21:07:41,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 91 transitions, 307 flow [2023-12-05 21:07:41,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-12-05 21:07:41,697 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8040540540540541 [2023-12-05 21:07:41,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-12-05 21:07:41,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-12-05 21:07:41,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:41,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-12-05 21:07:41,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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:07:41,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:41,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:41,703 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 3 predicate places. [2023-12-05 21:07:41,704 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 307 flow [2023-12-05 21:07:41,704 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:07:41,704 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:41,705 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] [2023-12-05 21:07:41,705 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:07:41,705 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:41,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash 565949095, now seen corresponding path program 1 times [2023-12-05 21:07:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:41,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124925613] [2023-12-05 21:07:41,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:41,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:41,783 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:07:41,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:41,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124925613] [2023-12-05 21:07:41,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124925613] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:41,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:41,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:41,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840834079] [2023-12-05 21:07:41,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:41,785 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:41,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:41,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:41,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:41,786 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2023-12-05 21:07:41,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:41,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:41,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2023-12-05 21:07:41,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:41,839 INFO L124 PetriNetUnfolderBase]: 28/189 cut-off events. [2023-12-05 21:07:41,839 INFO L125 PetriNetUnfolderBase]: For 176/196 co-relation queries the response was YES. [2023-12-05 21:07:41,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 189 events. 28/189 cut-off events. For 176/196 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 553 event pairs, 28 based on Foata normal form. 1/184 useless extension candidates. Maximal degree in co-relation 373. Up to 59 conditions per place. [2023-12-05 21:07:41,841 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 17 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-12-05 21:07:41,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 90 transitions, 337 flow [2023-12-05 21:07:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-12-05 21:07:41,843 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8265765765765766 [2023-12-05 21:07:41,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-12-05 21:07:41,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-12-05 21:07:41,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:41,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-12-05 21:07:41,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:41,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:41,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:41,847 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 4 predicate places. [2023-12-05 21:07:41,847 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 337 flow [2023-12-05 21:07:41,848 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:41,848 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:41,848 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:41,848 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:07:41,848 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:41,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash -397134159, now seen corresponding path program 1 times [2023-12-05 21:07:41,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:41,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679727357] [2023-12-05 21:07:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:41,946 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:07:41,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:41,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679727357] [2023-12-05 21:07:41,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679727357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:41,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:41,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:41,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306610018] [2023-12-05 21:07:41,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:41,948 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:41,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:41,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:41,949 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2023-12-05 21:07:41,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:41,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:41,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2023-12-05 21:07:41,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:42,004 INFO L124 PetriNetUnfolderBase]: 27/172 cut-off events. [2023-12-05 21:07:42,005 INFO L125 PetriNetUnfolderBase]: For 298/326 co-relation queries the response was YES. [2023-12-05 21:07:42,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 172 events. 27/172 cut-off events. For 298/326 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 440 event pairs, 12 based on Foata normal form. 2/168 useless extension candidates. Maximal degree in co-relation 403. Up to 58 conditions per place. [2023-12-05 21:07:42,006 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 18 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-12-05 21:07:42,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 90 transitions, 379 flow [2023-12-05 21:07:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-12-05 21:07:42,007 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8288288288288288 [2023-12-05 21:07:42,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-12-05 21:07:42,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-12-05 21:07:42,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:42,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-12-05 21:07:42,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:42,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:42,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:42,011 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 5 predicate places. [2023-12-05 21:07:42,012 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 90 transitions, 379 flow [2023-12-05 21:07:42,012 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:42,012 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:42,012 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:42,013 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:07:42,013 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:42,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:42,016 INFO L85 PathProgramCache]: Analyzing trace with hash -397134160, now seen corresponding path program 1 times [2023-12-05 21:07:42,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:42,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872268373] [2023-12-05 21:07:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:42,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:42,104 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:07:42,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:42,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872268373] [2023-12-05 21:07:42,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872268373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:42,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:42,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:42,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485887656] [2023-12-05 21:07:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:42,105 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:42,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:42,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:42,106 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 148 [2023-12-05 21:07:42,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 90 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:07:42,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:42,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 148 [2023-12-05 21:07:42,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:42,150 INFO L124 PetriNetUnfolderBase]: 26/169 cut-off events. [2023-12-05 21:07:42,150 INFO L125 PetriNetUnfolderBase]: For 432/468 co-relation queries the response was YES. [2023-12-05 21:07:42,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 169 events. 26/169 cut-off events. For 432/468 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 421 event pairs, 12 based on Foata normal form. 2/165 useless extension candidates. Maximal degree in co-relation 441. Up to 55 conditions per place. [2023-12-05 21:07:42,152 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 18 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:07:42,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 89 transitions, 409 flow [2023-12-05 21:07:42,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:42,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-12-05 21:07:42,153 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8018018018018018 [2023-12-05 21:07:42,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-12-05 21:07:42,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-12-05 21:07:42,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:42,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-12-05 21:07:42,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:42,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:42,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:42,157 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 6 predicate places. [2023-12-05 21:07:42,157 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 409 flow [2023-12-05 21:07:42,158 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:07:42,158 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:42,158 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:42,158 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:07:42,158 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:42,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash 842110164, now seen corresponding path program 1 times [2023-12-05 21:07:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974297423] [2023-12-05 21:07:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:42,237 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:07:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:42,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974297423] [2023-12-05 21:07:42,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974297423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:42,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:42,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680425058] [2023-12-05 21:07:42,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:42,241 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:42,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:42,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:42,243 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2023-12-05 21:07:42,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:07:42,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:42,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2023-12-05 21:07:42,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:42,290 INFO L124 PetriNetUnfolderBase]: 19/140 cut-off events. [2023-12-05 21:07:42,291 INFO L125 PetriNetUnfolderBase]: For 492/516 co-relation queries the response was YES. [2023-12-05 21:07:42,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 140 events. 19/140 cut-off events. For 492/516 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 272 event pairs, 0 based on Foata normal form. 6/144 useless extension candidates. Maximal degree in co-relation 397. Up to 48 conditions per place. [2023-12-05 21:07:42,292 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 20 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-12-05 21:07:42,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 91 transitions, 485 flow [2023-12-05 21:07:42,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-12-05 21:07:42,294 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.831081081081081 [2023-12-05 21:07:42,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-12-05 21:07:42,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-12-05 21:07:42,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:42,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-12-05 21:07:42,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:07:42,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:42,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:42,296 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 7 predicate places. [2023-12-05 21:07:42,297 INFO L500 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 485 flow [2023-12-05 21:07:42,297 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:07:42,297 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:42,297 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:42,297 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:07:42,297 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:42,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:42,298 INFO L85 PathProgramCache]: Analyzing trace with hash 842110163, now seen corresponding path program 1 times [2023-12-05 21:07:42,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:42,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559826449] [2023-12-05 21:07:42,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:42,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:42,348 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:07:42,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559826449] [2023-12-05 21:07:42,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559826449] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:42,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:42,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:42,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884519752] [2023-12-05 21:07:42,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:42,350 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:42,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:42,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:42,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:42,352 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 148 [2023-12-05 21:07:42,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:07:42,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:42,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 148 [2023-12-05 21:07:42,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:42,389 INFO L124 PetriNetUnfolderBase]: 12/127 cut-off events. [2023-12-05 21:07:42,389 INFO L125 PetriNetUnfolderBase]: For 564/592 co-relation queries the response was YES. [2023-12-05 21:07:42,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 127 events. 12/127 cut-off events. For 564/592 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 216 event pairs, 0 based on Foata normal form. 6/131 useless extension candidates. Maximal degree in co-relation 343. Up to 35 conditions per place. [2023-12-05 21:07:42,390 INFO L140 encePairwiseOnDemand]: 146/148 looper letters, 0 selfloop transitions, 0 changer transitions 90/90 dead transitions. [2023-12-05 21:07:42,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 90 transitions, 517 flow [2023-12-05 21:07:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-12-05 21:07:42,392 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8040540540540541 [2023-12-05 21:07:42,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-12-05 21:07:42,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-12-05 21:07:42,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:42,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-12-05 21:07:42,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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:07:42,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:42,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:07:42,397 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 8 predicate places. [2023-12-05 21:07:42,397 INFO L500 AbstractCegarLoop]: Abstraction has has 112 places, 90 transitions, 517 flow [2023-12-05 21:07:42,400 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:07:42,407 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix036_power.opt_rmo.opt.i_BEv2_AllErrorsAtOnce [2023-12-05 21:07:42,432 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-12-05 21:07:42,432 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-12-05 21:07:42,434 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-12-05 21:07:42,434 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-12-05 21:07:42,434 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-12-05 21:07:42,435 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-12-05 21:07:42,437 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-12-05 21:07:42,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-12-05 21:07:42,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-12-05 21:07:42,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-12-05 21:07:42,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-12-05 21:07:42,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-12-05 21:07:42,438 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:07:42,438 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:42,441 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:07:42,441 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:07:42,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:07:42 BasicIcfg [2023-12-05 21:07:42,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:07:42,448 INFO L158 Benchmark]: Toolchain (without parser) took 2829.92ms. Allocated memory was 208.7MB in the beginning and 415.2MB in the end (delta: 206.6MB). Free memory was 154.5MB in the beginning and 277.2MB in the end (delta: -122.7MB). Peak memory consumption was 85.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:42,448 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 208.7MB. Free memory is still 156.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:07:42,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.52ms. Allocated memory is still 208.7MB. Free memory was 154.5MB in the beginning and 130.0MB in the end (delta: 24.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:42,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.03ms. Allocated memory is still 208.7MB. Free memory was 130.0MB in the beginning and 127.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:42,449 INFO L158 Benchmark]: Boogie Preprocessor took 34.64ms. Allocated memory is still 208.7MB. Free memory was 127.6MB in the beginning and 125.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:42,449 INFO L158 Benchmark]: RCFGBuilder took 569.79ms. Allocated memory was 208.7MB in the beginning and 415.2MB in the end (delta: 206.6MB). Free memory was 125.5MB in the beginning and 352.1MB in the end (delta: -226.6MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2023-12-05 21:07:42,449 INFO L158 Benchmark]: TraceAbstraction took 1753.90ms. Allocated memory is still 415.2MB. Free memory was 351.1MB in the beginning and 277.2MB in the end (delta: 73.9MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. [2023-12-05 21:07:42,450 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 208.7MB. Free memory is still 156.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.52ms. Allocated memory is still 208.7MB. Free memory was 154.5MB in the beginning and 130.0MB in the end (delta: 24.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.03ms. Allocated memory is still 208.7MB. Free memory was 130.0MB in the beginning and 127.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.64ms. Allocated memory is still 208.7MB. Free memory was 127.6MB in the beginning and 125.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 569.79ms. Allocated memory was 208.7MB in the beginning and 415.2MB in the end (delta: 206.6MB). Free memory was 125.5MB in the beginning and 352.1MB in the end (delta: -226.6MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * TraceAbstraction took 1753.90ms. Allocated memory is still 415.2MB. Free memory was 351.1MB in the beginning and 277.2MB in the end (delta: 73.9MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 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: 1.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 168 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=517occurred 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, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 580 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:07:42,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...