/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:45:09,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:45:09,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:45:09,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:45:09,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:45:09,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:45:09,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:45:09,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:45:09,907 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:45:09,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:45:09,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:45:09,910 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:45:09,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:45:09,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:45:09,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:45:09,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:45:09,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:45:09,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:45:09,912 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:45:09,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:45:09,912 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:45:09,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:45:09,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:45:09,913 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:45:09,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:45:09,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:09,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:45:09,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:45:09,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:45:09,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:45:09,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:45:09,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:45:09,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:45:09,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:45:10,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:45:10,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:45:10,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:45:10,120 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:45:10,120 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:45:10,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2023-11-30 04:45:11,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:45:11,487 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:45:11,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2023-11-30 04:45:11,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f78618c/045610b265384629bbfd98bd815561f9/FLAGeaf24aa04 [2023-11-30 04:45:11,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f78618c/045610b265384629bbfd98bd815561f9 [2023-11-30 04:45:11,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:45:11,512 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:45:11,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:45:11,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:45:11,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:45:11,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:11,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d733fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11, skipping insertion in model container [2023-11-30 04:45:11,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:11,572 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:45:11,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:45:11,892 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:45:11,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:45:11,985 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:45:11,985 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:45:11,989 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:45:11,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11 WrapperNode [2023-11-30 04:45:11,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:45:11,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:45:11,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:45:11,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:45:11,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,050 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2023-11-30 04:45:12,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:45:12,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:45:12,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:45:12,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:45:12,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:45:12,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:45:12,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:45:12,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:45:12,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (1/1) ... [2023-11-30 04:45:12,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:45:12,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:45:12,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:45:12,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:45:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:45:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:45:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:45:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:45:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:45:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:45:12,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:45:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:45:12,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:45:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:45:12,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:45:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:45:12,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:45:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:45:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:45:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:45:12,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:45:12,148 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:45:12,284 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:45:12,286 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:45:12,609 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:45:12,679 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:45:12,679 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:45:12,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:45:12 BoogieIcfgContainer [2023-11-30 04:45:12,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:45:12,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:45:12,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:45:12,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:45:12,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:45:11" (1/3) ... [2023-11-30 04:45:12,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b177a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:45:12, skipping insertion in model container [2023-11-30 04:45:12,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:45:11" (2/3) ... [2023-11-30 04:45:12,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b177a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:45:12, skipping insertion in model container [2023-11-30 04:45:12,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:45:12" (3/3) ... [2023-11-30 04:45:12,685 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2023-11-30 04:45:12,695 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:45:12,695 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:45:12,695 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:45:12,738 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:45:12,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 144 transitions, 304 flow [2023-11-30 04:45:12,813 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-11-30 04:45:12,814 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:12,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-11-30 04:45:12,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 144 transitions, 304 flow [2023-11-30 04:45:12,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 91 transitions, 191 flow [2023-11-30 04:45:12,830 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:45:12,834 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;@574d75cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:45:12,834 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:45:12,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:45:12,839 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2023-11-30 04:45:12,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:45:12,840 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:12,840 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:12,840 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-11-30 04:45:12,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2060111409, now seen corresponding path program 1 times [2023-11-30 04:45:12,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:12,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501853884] [2023-11-30 04:45:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:12,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:13,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:13,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501853884] [2023-11-30 04:45:13,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501853884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:13,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:13,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:13,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464333081] [2023-11-30 04:45:13,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:13,037 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:13,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:13,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:13,084 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 144 [2023-11-30 04:45:13,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:13,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 144 [2023-11-30 04:45:13,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:13,293 INFO L124 PetriNetUnfolderBase]: 81/334 cut-off events. [2023-11-30 04:45:13,293 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 04:45:13,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 334 events. 81/334 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1589 event pairs, 81 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 454. Up to 152 conditions per place. [2023-11-30 04:45:13,298 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 21 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:45:13,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 90 transitions, 233 flow [2023-11-30 04:45:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-11-30 04:45:13,311 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7893518518518519 [2023-11-30 04:45:13,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-11-30 04:45:13,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-11-30 04:45:13,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:13,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-11-30 04:45:13,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,328 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 1 predicate places. [2023-11-30 04:45:13,328 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 90 transitions, 233 flow [2023-11-30 04:45:13,328 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,328 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:13,329 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:13,329 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:45:13,329 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-11-30 04:45:13,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2060111410, now seen corresponding path program 1 times [2023-11-30 04:45:13,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:13,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506305094] [2023-11-30 04:45:13,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:13,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:13,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:13,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506305094] [2023-11-30 04:45:13,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506305094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:13,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:13,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:13,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004954826] [2023-11-30 04:45:13,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:13,641 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:13,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:13,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:13,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:13,642 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2023-11-30 04:45:13,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 90 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:13,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2023-11-30 04:45:13,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:13,736 INFO L124 PetriNetUnfolderBase]: 109/373 cut-off events. [2023-11-30 04:45:13,737 INFO L125 PetriNetUnfolderBase]: For 90/94 co-relation queries the response was YES. [2023-11-30 04:45:13,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 373 events. 109/373 cut-off events. For 90/94 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1865 event pairs, 109 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 698. Up to 179 conditions per place. [2023-11-30 04:45:13,741 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 19 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:45:13,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 89 transitions, 269 flow [2023-11-30 04:45:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-11-30 04:45:13,743 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8125 [2023-11-30 04:45:13,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-11-30 04:45:13,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-11-30 04:45:13,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:13,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-11-30 04:45:13,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-11-30 04:45:13,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,747 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2023-11-30 04:45:13,748 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 269 flow [2023-11-30 04:45:13,748 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,748 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:13,748 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:13,749 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:45:13,749 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:13,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2130495868, now seen corresponding path program 1 times [2023-11-30 04:45:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:13,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19894952] [2023-11-30 04:45:13,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:13,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:13,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19894952] [2023-11-30 04:45:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19894952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:13,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117207412] [2023-11-30 04:45:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:13,866 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:13,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:13,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:13,867 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2023-11-30 04:45:13,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:13,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2023-11-30 04:45:13,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:13,935 INFO L124 PetriNetUnfolderBase]: 108/370 cut-off events. [2023-11-30 04:45:13,936 INFO L125 PetriNetUnfolderBase]: For 231/243 co-relation queries the response was YES. [2023-11-30 04:45:13,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 370 events. 108/370 cut-off events. For 231/243 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1841 event pairs, 66 based on Foata normal form. 2/366 useless extension candidates. Maximal degree in co-relation 866. Up to 178 conditions per place. [2023-11-30 04:45:13,939 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 20 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:45:13,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 313 flow [2023-11-30 04:45:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-30 04:45:13,940 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2023-11-30 04:45:13,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-30 04:45:13,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-30 04:45:13,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:13,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-30 04:45:13,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,943 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2023-11-30 04:45:13,943 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 89 transitions, 313 flow [2023-11-30 04:45:13,944 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:13,944 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:13,944 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:13,944 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:45:13,944 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:13,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2130495867, now seen corresponding path program 1 times [2023-11-30 04:45:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914485925] [2023-11-30 04:45:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:13,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914485925] [2023-11-30 04:45:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914485925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:13,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:13,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590059448] [2023-11-30 04:45:13,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:14,000 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:14,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:14,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:14,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:14,004 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 144 [2023-11-30 04:45:14,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 89 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:14,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 144 [2023-11-30 04:45:14,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:14,080 INFO L124 PetriNetUnfolderBase]: 107/367 cut-off events. [2023-11-30 04:45:14,080 INFO L125 PetriNetUnfolderBase]: For 408/428 co-relation queries the response was YES. [2023-11-30 04:45:14,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 367 events. 107/367 cut-off events. For 408/428 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1824 event pairs, 66 based on Foata normal form. 2/363 useless extension candidates. Maximal degree in co-relation 1028. Up to 175 conditions per place. [2023-11-30 04:45:14,083 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 20 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-11-30 04:45:14,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 88 transitions, 349 flow [2023-11-30 04:45:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-11-30 04:45:14,084 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7870370370370371 [2023-11-30 04:45:14,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-11-30 04:45:14,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-11-30 04:45:14,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:14,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-11-30 04:45:14,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,088 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 4 predicate places. [2023-11-30 04:45:14,089 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 349 flow [2023-11-30 04:45:14,089 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,089 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:14,089 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:14,089 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:45:14,089 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-11-30 04:45:14,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash 642123129, now seen corresponding path program 1 times [2023-11-30 04:45:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:14,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328832095] [2023-11-30 04:45:14,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:14,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328832095] [2023-11-30 04:45:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328832095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:14,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:14,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:14,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452600338] [2023-11-30 04:45:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:14,182 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:14,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:14,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:14,183 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2023-11-30 04:45:14,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:14,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2023-11-30 04:45:14,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:14,243 INFO L124 PetriNetUnfolderBase]: 100/330 cut-off events. [2023-11-30 04:45:14,243 INFO L125 PetriNetUnfolderBase]: For 605/605 co-relation queries the response was YES. [2023-11-30 04:45:14,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 330 events. 100/330 cut-off events. For 605/605 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1504 event pairs, 18 based on Foata normal form. 6/336 useless extension candidates. Maximal degree in co-relation 1116. Up to 168 conditions per place. [2023-11-30 04:45:14,246 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 22 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:45:14,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 90 transitions, 419 flow [2023-11-30 04:45:14,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-30 04:45:14,247 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8171296296296297 [2023-11-30 04:45:14,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-30 04:45:14,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-30 04:45:14,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:14,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-30 04:45:14,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-11-30 04:45:14,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,250 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2023-11-30 04:45:14,251 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 419 flow [2023-11-30 04:45:14,251 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,251 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:14,251 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:14,252 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:45:14,253 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-11-30 04:45:14,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash 642123128, now seen corresponding path program 1 times [2023-11-30 04:45:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995538511] [2023-11-30 04:45:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:14,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995538511] [2023-11-30 04:45:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995538511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:14,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794284624] [2023-11-30 04:45:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:14,326 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:14,327 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 144 [2023-11-30 04:45:14,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 90 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:14,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 144 [2023-11-30 04:45:14,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:14,393 INFO L124 PetriNetUnfolderBase]: 93/317 cut-off events. [2023-11-30 04:45:14,393 INFO L125 PetriNetUnfolderBase]: For 828/828 co-relation queries the response was YES. [2023-11-30 04:45:14,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 317 events. 93/317 cut-off events. For 828/828 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1382 event pairs, 18 based on Foata normal form. 6/323 useless extension candidates. Maximal degree in co-relation 1202. Up to 155 conditions per place. [2023-11-30 04:45:14,396 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 22 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:45:14,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 89 transitions, 457 flow [2023-11-30 04:45:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-11-30 04:45:14,397 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7893518518518519 [2023-11-30 04:45:14,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-11-30 04:45:14,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-11-30 04:45:14,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:14,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-11-30 04:45:14,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,401 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 6 predicate places. [2023-11-30 04:45:14,401 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 457 flow [2023-11-30 04:45:14,402 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,402 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:14,402 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:14,402 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:45:14,403 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:14,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:14,403 INFO L85 PathProgramCache]: Analyzing trace with hash 266939726, now seen corresponding path program 1 times [2023-11-30 04:45:14,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:14,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391597071] [2023-11-30 04:45:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391597071] [2023-11-30 04:45:14,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391597071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:14,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:14,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:14,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769050558] [2023-11-30 04:45:14,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:14,445 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:14,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:14,446 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 144 [2023-11-30 04:45:14,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:14,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 144 [2023-11-30 04:45:14,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:14,502 INFO L124 PetriNetUnfolderBase]: 73/285 cut-off events. [2023-11-30 04:45:14,502 INFO L125 PetriNetUnfolderBase]: For 936/936 co-relation queries the response was YES. [2023-11-30 04:45:14,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 285 events. 73/285 cut-off events. For 936/936 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1200 event pairs, 0 based on Foata normal form. 12/297 useless extension candidates. Maximal degree in co-relation 1146. Up to 135 conditions per place. [2023-11-30 04:45:14,506 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 26 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2023-11-30 04:45:14,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 92 transitions, 559 flow [2023-11-30 04:45:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-11-30 04:45:14,507 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2023-11-30 04:45:14,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-11-30 04:45:14,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-11-30 04:45:14,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:14,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-11-30 04:45:14,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-11-30 04:45:14,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,510 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2023-11-30 04:45:14,510 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 92 transitions, 559 flow [2023-11-30 04:45:14,510 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,510 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:45:14,510 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:14,510 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:45:14,511 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:45:14,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:45:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash 266939727, now seen corresponding path program 1 times [2023-11-30 04:45:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:45:14,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842957632] [2023-11-30 04:45:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:45:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:45:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:45:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:45:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:45:14,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842957632] [2023-11-30 04:45:14,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842957632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:45:14,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:45:14,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:45:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943598597] [2023-11-30 04:45:14,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:45:14,585 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:45:14,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:45:14,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:45:14,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:45:14,586 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2023-11-30 04:45:14,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 92 transitions, 559 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:45:14,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2023-11-30 04:45:14,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:45:14,639 INFO L124 PetriNetUnfolderBase]: 53/253 cut-off events. [2023-11-30 04:45:14,639 INFO L125 PetriNetUnfolderBase]: For 1016/1016 co-relation queries the response was YES. [2023-11-30 04:45:14,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 253 events. 53/253 cut-off events. For 1016/1016 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1020 event pairs, 0 based on Foata normal form. 12/265 useless extension candidates. Maximal degree in co-relation 1026. Up to 103 conditions per place. [2023-11-30 04:45:14,640 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 0 selfloop transitions, 0 changer transitions 91/91 dead transitions. [2023-11-30 04:45:14,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 91 transitions, 599 flow [2023-11-30 04:45:14,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:45:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:45:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-30 04:45:14,642 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2023-11-30 04:45:14,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-30 04:45:14,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-30 04:45:14,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:45:14,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-30 04:45:14,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,648 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 8 predicate places. [2023-11-30 04:45:14,649 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 91 transitions, 599 flow [2023-11-30 04:45:14,649 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:45:14,656 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix027_tso.i_BEv2_AllErrorsAtOnce [2023-11-30 04:45:14,688 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:45:14,688 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:45:14,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:45:14,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:45:14,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:45:14,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:45:14,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:45:14,691 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:45:14,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:45:14,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:45:14,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:45:14,692 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:45:14,692 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:45:14,692 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:45:14,695 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:45:14,695 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:45:14,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:45:14 BasicIcfg [2023-11-30 04:45:14,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:45:14,700 INFO L158 Benchmark]: Toolchain (without parser) took 3188.70ms. Allocated memory is still 455.1MB. Free memory was 398.0MB in the beginning and 230.7MB in the end (delta: 167.3MB). Peak memory consumption was 169.3MB. Max. memory is 16.0GB. [2023-11-30 04:45:14,700 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 320.9MB. Free memory was 269.1MB in the beginning and 269.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:45:14,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.87ms. Allocated memory is still 455.1MB. Free memory was 398.0MB in the beginning and 372.7MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:45:14,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.67ms. Allocated memory is still 455.1MB. Free memory was 372.7MB in the beginning and 369.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:14,701 INFO L158 Benchmark]: Boogie Preprocessor took 34.34ms. Allocated memory is still 455.1MB. Free memory was 369.8MB in the beginning and 367.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:45:14,701 INFO L158 Benchmark]: RCFGBuilder took 594.67ms. Allocated memory is still 455.1MB. Free memory was 367.6MB in the beginning and 385.4MB in the end (delta: -17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-11-30 04:45:14,701 INFO L158 Benchmark]: TraceAbstraction took 2018.36ms. Allocated memory is still 455.1MB. Free memory was 384.5MB in the beginning and 230.7MB in the end (delta: 153.7MB). Peak memory consumption was 154.6MB. Max. memory is 16.0GB. [2023-11-30 04:45:14,702 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 320.9MB. Free memory was 269.1MB in the beginning and 269.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 477.87ms. Allocated memory is still 455.1MB. Free memory was 398.0MB in the beginning and 372.7MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.67ms. Allocated memory is still 455.1MB. Free memory was 372.7MB in the beginning and 369.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.34ms. Allocated memory is still 455.1MB. Free memory was 369.8MB in the beginning and 367.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 594.67ms. Allocated memory is still 455.1MB. Free memory was 367.6MB in the beginning and 385.4MB in the end (delta: -17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 2018.36ms. Allocated memory is still 455.1MB. Free memory was 384.5MB in the beginning and 230.7MB in the end (delta: 153.7MB). Peak memory consumption was 154.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 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.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 192 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=599occurred 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.7s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 556 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-11-30 04:45:14,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...