/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/safe018_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:49:50,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:49:50,072 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:49:50,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:49:50,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:49:50,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:49:50,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:49:50,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:49:50,096 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:49:50,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:49:50,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:49:50,100 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:49:50,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:49:50,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:49:50,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:49:50,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:49:50,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:49:50,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:49:50,101 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:49:50,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:49:50,102 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:49:50,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:49:50,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:49:50,102 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:49:50,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:49:50,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:49:50,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:49:50,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:49:50,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:49:50,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:49:50,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:49:50,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:49:50,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:49:50,105 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:49:50,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:49:50,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:49:50,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:49:50,272 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:49:50,272 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:49:50,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i [2023-11-30 04:49:51,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:49:51,591 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:49:51,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i [2023-11-30 04:49:51,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cd979d1/a7caf0ebccea4ecd8b59be8cd4634566/FLAG56538b242 [2023-11-30 04:49:51,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cd979d1/a7caf0ebccea4ecd8b59be8cd4634566 [2023-11-30 04:49:51,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:49:51,640 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:49:51,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:49:51,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:49:51,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:49:51,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:49:51" (1/1) ... [2023-11-30 04:49:51,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606deab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:51, skipping insertion in model container [2023-11-30 04:49:51,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:49:51" (1/1) ... [2023-11-30 04:49:51,699 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:49:52,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:49:52,103 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:49:52,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:49:52,160 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:49:52,161 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:49:52,167 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:49:52,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52 WrapperNode [2023-11-30 04:49:52,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:49:52,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:49:52,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:49:52,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:49:52,173 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:49:52" (1/1) ... [2023-11-30 04:49:52,186 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:49:52" (1/1) ... [2023-11-30 04:49:52,202 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-11-30 04:49:52,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:49:52,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:49:52,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:49:52,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:49:52,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52" (1/1) ... [2023-11-30 04:49:52,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52" (1/1) ... [2023-11-30 04:49:52,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52" (1/1) ... [2023-11-30 04:49:52,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52" (1/1) ... [2023-11-30 04:49:52,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52" (1/1) ... [2023-11-30 04:49:52,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52" (1/1) ... [2023-11-30 04:49:52,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52" (1/1) ... [2023-11-30 04:49:52,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52" (1/1) ... [2023-11-30 04:49:52,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:49:52,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:49:52,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:49:52,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:49:52,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52" (1/1) ... [2023-11-30 04:49:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:49:52,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:49:52,269 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:49:52,284 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:49:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:49:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:49:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:49:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:49:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:49:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:49:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:49:52,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:49:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:49:52,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:49:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:49:52,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:49:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:49:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:49:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:49:52,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:49:52,294 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:49:52,403 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:49:52,404 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:49:52,787 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:49:53,040 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:49:53,040 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:49:53,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:49:53 BoogieIcfgContainer [2023-11-30 04:49:53,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:49:53,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:49:53,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:49:53,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:49:53,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:49:51" (1/3) ... [2023-11-30 04:49:53,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c11bb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:49:53, skipping insertion in model container [2023-11-30 04:49:53,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:52" (2/3) ... [2023-11-30 04:49:53,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c11bb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:49:53, skipping insertion in model container [2023-11-30 04:49:53,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:49:53" (3/3) ... [2023-11-30 04:49:53,048 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2023-11-30 04:49:53,060 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:49:53,060 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2023-11-30 04:49:53,061 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:49:53,149 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:49:53,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 178 transitions, 368 flow [2023-11-30 04:49:53,235 INFO L124 PetriNetUnfolderBase]: 3/175 cut-off events. [2023-11-30 04:49:53,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:49:53,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 3/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 259 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2023-11-30 04:49:53,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 178 transitions, 368 flow [2023-11-30 04:49:53,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 175 transitions, 359 flow [2023-11-30 04:49:53,250 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:49:53,254 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;@292e6afa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:49:53,255 INFO L363 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-11-30 04:49:53,261 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:49:53,262 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-11-30 04:49:53,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:49:53,262 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:53,262 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] [2023-11-30 04:49:53,263 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:49:53,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:53,266 INFO L85 PathProgramCache]: Analyzing trace with hash -376458267, now seen corresponding path program 1 times [2023-11-30 04:49:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:53,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055792370] [2023-11-30 04:49:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:53,513 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:49:53,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055792370] [2023-11-30 04:49:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055792370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:53,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:53,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107210112] [2023-11-30 04:49:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:53,521 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:53,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:53,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:53,545 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 178 [2023-11-30 04:49:53,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 175 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:53,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 178 [2023-11-30 04:49:53,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:56,209 INFO L124 PetriNetUnfolderBase]: 11391/22033 cut-off events. [2023-11-30 04:49:56,210 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-30 04:49:56,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38215 conditions, 22033 events. 11391/22033 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 1700. Compared 214146 event pairs, 7296 based on Foata normal form. 684/11568 useless extension candidates. Maximal degree in co-relation 38140. Up to 10375 conditions per place. [2023-11-30 04:49:56,351 INFO L140 encePairwiseOnDemand]: 152/178 looper letters, 66 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2023-11-30 04:49:56,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 167 transitions, 479 flow [2023-11-30 04:49:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-11-30 04:49:56,361 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7940074906367042 [2023-11-30 04:49:56,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-11-30 04:49:56,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-11-30 04:49:56,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:56,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-11-30 04:49:56,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,373 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -22 predicate places. [2023-11-30 04:49:56,373 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 167 transitions, 479 flow [2023-11-30 04:49:56,373 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,373 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:56,374 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] [2023-11-30 04:49:56,374 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:49:56,374 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:49:56,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash -376458266, now seen corresponding path program 1 times [2023-11-30 04:49:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:56,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904284170] [2023-11-30 04:49:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:56,588 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:49:56,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904284170] [2023-11-30 04:49:56,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904284170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:56,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:56,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075714411] [2023-11-30 04:49:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:56,590 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:56,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:56,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:56,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:56,593 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 178 [2023-11-30 04:49:56,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 167 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:56,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 178 [2023-11-30 04:49:56,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:59,975 INFO L124 PetriNetUnfolderBase]: 11453/22138 cut-off events. [2023-11-30 04:49:59,975 INFO L125 PetriNetUnfolderBase]: For 1765/4453 co-relation queries the response was YES. [2023-11-30 04:50:00,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53889 conditions, 22138 events. 11453/22138 cut-off events. For 1765/4453 co-relation queries the response was YES. Maximal size of possible extension queue 1710. Compared 214961 event pairs, 7358 based on Foata normal form. 0/10962 useless extension candidates. Maximal degree in co-relation 53808. Up to 11579 conditions per place. [2023-11-30 04:50:00,140 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 81 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2023-11-30 04:50:00,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 185 transitions, 717 flow [2023-11-30 04:50:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-11-30 04:50:00,142 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7228464419475655 [2023-11-30 04:50:00,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-11-30 04:50:00,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-11-30 04:50:00,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:00,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-11-30 04:50:00,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,145 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -21 predicate places. [2023-11-30 04:50:00,146 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 185 transitions, 717 flow [2023-11-30 04:50:00,146 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,146 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:00,146 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:00,146 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:50:00,146 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:00,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1922693611, now seen corresponding path program 1 times [2023-11-30 04:50:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:00,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320044288] [2023-11-30 04:50:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:00,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320044288] [2023-11-30 04:50:00,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320044288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:00,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:00,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:50:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478704826] [2023-11-30 04:50:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:00,348 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:50:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:00,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:50:00,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:50:00,349 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 178 [2023-11-30 04:50:00,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 185 transitions, 717 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:00,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 178 [2023-11-30 04:50:00,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:00,763 INFO L124 PetriNetUnfolderBase]: 920/1885 cut-off events. [2023-11-30 04:50:00,763 INFO L125 PetriNetUnfolderBase]: For 489/849 co-relation queries the response was YES. [2023-11-30 04:50:00,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6020 conditions, 1885 events. 920/1885 cut-off events. For 489/849 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11151 event pairs, 530 based on Foata normal form. 0/1337 useless extension candidates. Maximal degree in co-relation 5928. Up to 1098 conditions per place. [2023-11-30 04:50:00,778 INFO L140 encePairwiseOnDemand]: 155/178 looper letters, 51 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2023-11-30 04:50:00,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 625 flow [2023-11-30 04:50:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:50:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:50:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-11-30 04:50:00,781 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6460674157303371 [2023-11-30 04:50:00,781 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-11-30 04:50:00,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-11-30 04:50:00,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:00,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-11-30 04:50:00,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,784 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,785 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -27 predicate places. [2023-11-30 04:50:00,785 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 151 transitions, 625 flow [2023-11-30 04:50:00,786 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,786 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:00,786 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:00,786 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:50:00,786 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:00,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1618334567, now seen corresponding path program 1 times [2023-11-30 04:50:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:00,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425022189] [2023-11-30 04:50:00,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:00,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:00,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:00,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425022189] [2023-11-30 04:50:00,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425022189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:00,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:00,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668486373] [2023-11-30 04:50:00,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:00,876 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:00,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:00,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:00,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:00,877 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 178 [2023-11-30 04:50:00,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 625 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:00,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 178 [2023-11-30 04:50:00,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:01,295 INFO L124 PetriNetUnfolderBase]: 1171/2494 cut-off events. [2023-11-30 04:50:01,295 INFO L125 PetriNetUnfolderBase]: For 2256/2400 co-relation queries the response was YES. [2023-11-30 04:50:01,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9002 conditions, 2494 events. 1171/2494 cut-off events. For 2256/2400 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17118 event pairs, 178 based on Foata normal form. 2/1840 useless extension candidates. Maximal degree in co-relation 8902. Up to 1350 conditions per place. [2023-11-30 04:50:01,308 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 60 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2023-11-30 04:50:01,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 163 transitions, 847 flow [2023-11-30 04:50:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-30 04:50:01,311 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6891385767790262 [2023-11-30 04:50:01,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-30 04:50:01,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-30 04:50:01,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:01,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-30 04:50:01,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,316 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -26 predicate places. [2023-11-30 04:50:01,316 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 163 transitions, 847 flow [2023-11-30 04:50:01,317 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,317 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:01,317 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:01,317 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:50:01,317 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:01,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1618334568, now seen corresponding path program 1 times [2023-11-30 04:50:01,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:01,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206463570] [2023-11-30 04:50:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:01,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:01,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206463570] [2023-11-30 04:50:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206463570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:01,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692772329] [2023-11-30 04:50:01,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:01,376 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:01,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:01,377 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 178 [2023-11-30 04:50:01,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 163 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:01,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 178 [2023-11-30 04:50:01,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:01,681 INFO L124 PetriNetUnfolderBase]: 1170/2491 cut-off events. [2023-11-30 04:50:01,681 INFO L125 PetriNetUnfolderBase]: For 3059/3251 co-relation queries the response was YES. [2023-11-30 04:50:01,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10737 conditions, 2491 events. 1170/2491 cut-off events. For 3059/3251 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16995 event pairs, 178 based on Foata normal form. 2/1837 useless extension candidates. Maximal degree in co-relation 10628. Up to 1444 conditions per place. [2023-11-30 04:50:01,699 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 62 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2023-11-30 04:50:01,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 162 transitions, 967 flow [2023-11-30 04:50:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-30 04:50:01,701 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6629213483146067 [2023-11-30 04:50:01,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-30 04:50:01,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-30 04:50:01,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:01,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-30 04:50:01,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,703 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -25 predicate places. [2023-11-30 04:50:01,703 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 162 transitions, 967 flow [2023-11-30 04:50:01,704 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,704 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:01,704 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:01,704 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:50:01,704 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:01,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2117829530, now seen corresponding path program 1 times [2023-11-30 04:50:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:01,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210118621] [2023-11-30 04:50:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210118621] [2023-11-30 04:50:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210118621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:01,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:01,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881091118] [2023-11-30 04:50:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:01,744 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:01,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:01,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:01,744 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 178 [2023-11-30 04:50:01,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 162 transitions, 967 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:01,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 178 [2023-11-30 04:50:01,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:02,326 INFO L124 PetriNetUnfolderBase]: 1415/2714 cut-off events. [2023-11-30 04:50:02,328 INFO L125 PetriNetUnfolderBase]: For 6414/6614 co-relation queries the response was YES. [2023-11-30 04:50:02,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14160 conditions, 2714 events. 1415/2714 cut-off events. For 6414/6614 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 17630 event pairs, 102 based on Foata normal form. 6/1926 useless extension candidates. Maximal degree in co-relation 14042. Up to 1711 conditions per place. [2023-11-30 04:50:02,359 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 65 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2023-11-30 04:50:02,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 164 transitions, 1129 flow [2023-11-30 04:50:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-30 04:50:02,370 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6629213483146067 [2023-11-30 04:50:02,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-30 04:50:02,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-30 04:50:02,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:02,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-30 04:50:02,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,386 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -24 predicate places. [2023-11-30 04:50:02,386 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 164 transitions, 1129 flow [2023-11-30 04:50:02,387 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,387 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:02,387 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:02,387 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:50:02,388 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:02,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2117829531, now seen corresponding path program 1 times [2023-11-30 04:50:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:02,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134922362] [2023-11-30 04:50:02,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:02,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:02,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134922362] [2023-11-30 04:50:02,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134922362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:02,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:02,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:02,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362583798] [2023-11-30 04:50:02,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:02,518 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:02,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:02,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:02,519 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 178 [2023-11-30 04:50:02,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 164 transitions, 1129 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:02,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 178 [2023-11-30 04:50:02,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:02,868 INFO L124 PetriNetUnfolderBase]: 1408/2701 cut-off events. [2023-11-30 04:50:02,868 INFO L125 PetriNetUnfolderBase]: For 8499/8739 co-relation queries the response was YES. [2023-11-30 04:50:02,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16024 conditions, 2701 events. 1408/2701 cut-off events. For 8499/8739 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 17542 event pairs, 102 based on Foata normal form. 6/1913 useless extension candidates. Maximal degree in co-relation 15898. Up to 1711 conditions per place. [2023-11-30 04:50:02,888 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 73 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2023-11-30 04:50:02,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 175 transitions, 1437 flow [2023-11-30 04:50:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-11-30 04:50:02,889 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6853932584269663 [2023-11-30 04:50:02,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-11-30 04:50:02,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-11-30 04:50:02,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:02,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-11-30 04:50:02,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,891 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -23 predicate places. [2023-11-30 04:50:02,892 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 175 transitions, 1437 flow [2023-11-30 04:50:02,892 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,892 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:02,892 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:02,892 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:50:02,892 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:02,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:02,892 INFO L85 PathProgramCache]: Analyzing trace with hash 456173710, now seen corresponding path program 1 times [2023-11-30 04:50:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261810671] [2023-11-30 04:50:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:02,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261810671] [2023-11-30 04:50:02,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261810671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:02,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:02,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:50:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642979502] [2023-11-30 04:50:02,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:02,962 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:50:02,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:50:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:50:02,963 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 178 [2023-11-30 04:50:02,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 175 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:02,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 178 [2023-11-30 04:50:02,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:03,311 INFO L124 PetriNetUnfolderBase]: 1382/2657 cut-off events. [2023-11-30 04:50:03,311 INFO L125 PetriNetUnfolderBase]: For 10660/10936 co-relation queries the response was YES. [2023-11-30 04:50:03,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17274 conditions, 2657 events. 1382/2657 cut-off events. For 10660/10936 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 17623 event pairs, 78 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 17145. Up to 1711 conditions per place. [2023-11-30 04:50:03,336 INFO L140 encePairwiseOnDemand]: 174/178 looper letters, 88 selfloop transitions, 7 changer transitions 0/207 dead transitions. [2023-11-30 04:50:03,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 207 transitions, 2139 flow [2023-11-30 04:50:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-11-30 04:50:03,338 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7490636704119851 [2023-11-30 04:50:03,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-11-30 04:50:03,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-11-30 04:50:03,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:03,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-11-30 04:50:03,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:03,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:03,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:03,341 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -21 predicate places. [2023-11-30 04:50:03,341 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 207 transitions, 2139 flow [2023-11-30 04:50:03,341 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:03,341 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:03,341 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:03,341 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:50:03,342 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:03,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1162516223, now seen corresponding path program 1 times [2023-11-30 04:50:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:03,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169990708] [2023-11-30 04:50:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169990708] [2023-11-30 04:50:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169990708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:50:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858368400] [2023-11-30 04:50:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:03,413 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:50:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:50:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:50:03,414 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 178 [2023-11-30 04:50:03,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 207 transitions, 2139 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:03,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:03,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 178 [2023-11-30 04:50:03,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:03,970 INFO L124 PetriNetUnfolderBase]: 1576/3193 cut-off events. [2023-11-30 04:50:03,970 INFO L125 PetriNetUnfolderBase]: For 19575/20071 co-relation queries the response was YES. [2023-11-30 04:50:03,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22220 conditions, 3193 events. 1576/3193 cut-off events. For 19575/20071 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 23736 event pairs, 60 based on Foata normal form. 12/2447 useless extension candidates. Maximal degree in co-relation 22080. Up to 2081 conditions per place. [2023-11-30 04:50:04,001 INFO L140 encePairwiseOnDemand]: 167/178 looper letters, 123 selfloop transitions, 9 changer transitions 0/229 dead transitions. [2023-11-30 04:50:04,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 229 transitions, 2781 flow [2023-11-30 04:50:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:50:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:50:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-11-30 04:50:04,002 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6835205992509363 [2023-11-30 04:50:04,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-11-30 04:50:04,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-11-30 04:50:04,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:04,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-11-30 04:50:04,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:04,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:04,004 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:04,005 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -20 predicate places. [2023-11-30 04:50:04,005 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 229 transitions, 2781 flow [2023-11-30 04:50:04,005 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:04,005 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:04,005 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:04,005 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:50:04,006 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:04,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:04,006 INFO L85 PathProgramCache]: Analyzing trace with hash 296366018, now seen corresponding path program 1 times [2023-11-30 04:50:04,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:04,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928409195] [2023-11-30 04:50:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:04,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:04,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928409195] [2023-11-30 04:50:04,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928409195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:04,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:04,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:50:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927877880] [2023-11-30 04:50:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:04,138 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:50:04,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:50:04,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:50:04,139 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 178 [2023-11-30 04:50:04,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 229 transitions, 2781 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:04,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:04,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 178 [2023-11-30 04:50:04,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:04,719 INFO L124 PetriNetUnfolderBase]: 1556/3251 cut-off events. [2023-11-30 04:50:04,720 INFO L125 PetriNetUnfolderBase]: For 23873/24205 co-relation queries the response was YES. [2023-11-30 04:50:04,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23759 conditions, 3251 events. 1556/3251 cut-off events. For 23873/24205 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 24475 event pairs, 66 based on Foata normal form. 12/2512 useless extension candidates. Maximal degree in co-relation 23609. Up to 2081 conditions per place. [2023-11-30 04:50:04,751 INFO L140 encePairwiseOnDemand]: 172/178 looper letters, 122 selfloop transitions, 14 changer transitions 0/240 dead transitions. [2023-11-30 04:50:04,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 240 transitions, 3271 flow [2023-11-30 04:50:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:50:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:50:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-11-30 04:50:04,753 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6674157303370787 [2023-11-30 04:50:04,753 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-11-30 04:50:04,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-11-30 04:50:04,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:04,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-11-30 04:50:04,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:04,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:04,756 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:04,756 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -17 predicate places. [2023-11-30 04:50:04,757 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 240 transitions, 3271 flow [2023-11-30 04:50:04,757 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:04,757 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:04,757 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:04,757 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:50:04,757 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:04,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1619980452, now seen corresponding path program 1 times [2023-11-30 04:50:04,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:04,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793818123] [2023-11-30 04:50:04,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:04,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:05,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:05,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793818123] [2023-11-30 04:50:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793818123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:50:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211081062] [2023-11-30 04:50:05,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:05,054 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:50:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:50:05,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:50:05,055 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 178 [2023-11-30 04:50:05,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 240 transitions, 3271 flow. Second operand has 11 states, 11 states have (on average 100.0909090909091) internal successors, (1101), 11 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:05,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:05,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 178 [2023-11-30 04:50:05,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:06,280 INFO L124 PetriNetUnfolderBase]: 2689/6836 cut-off events. [2023-11-30 04:50:06,281 INFO L125 PetriNetUnfolderBase]: For 48202/49422 co-relation queries the response was YES. [2023-11-30 04:50:06,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45603 conditions, 6836 events. 2689/6836 cut-off events. For 48202/49422 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 63442 event pairs, 103 based on Foata normal form. 12/5931 useless extension candidates. Maximal degree in co-relation 45441. Up to 3388 conditions per place. [2023-11-30 04:50:06,331 INFO L140 encePairwiseOnDemand]: 154/178 looper letters, 293 selfloop transitions, 90 changer transitions 10/485 dead transitions. [2023-11-30 04:50:06,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 485 transitions, 9103 flow [2023-11-30 04:50:06,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 04:50:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 04:50:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1539 transitions. [2023-11-30 04:50:06,334 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6175762439807384 [2023-11-30 04:50:06,334 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1539 transitions. [2023-11-30 04:50:06,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1539 transitions. [2023-11-30 04:50:06,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:06,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1539 transitions. [2023-11-30 04:50:06,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 109.92857142857143) internal successors, (1539), 14 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:06,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 178.0) internal successors, (2670), 15 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:06,340 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 178.0) internal successors, (2670), 15 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:06,340 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2023-11-30 04:50:06,340 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 485 transitions, 9103 flow [2023-11-30 04:50:06,341 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.0909090909091) internal successors, (1101), 11 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:06,341 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:06,341 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:06,341 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:50:06,341 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:06,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:06,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1000932480, now seen corresponding path program 1 times [2023-11-30 04:50:06,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:06,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400079851] [2023-11-30 04:50:06,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:06,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:06,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400079851] [2023-11-30 04:50:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400079851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:06,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:06,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:50:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170329165] [2023-11-30 04:50:06,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:06,564 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:50:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:06,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:50:06,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:50:06,566 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 178 [2023-11-30 04:50:06,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 485 transitions, 9103 flow. Second operand has 9 states, 9 states have (on average 102.44444444444444) internal successors, (922), 9 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:06,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:06,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 178 [2023-11-30 04:50:06,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:07,748 INFO L124 PetriNetUnfolderBase]: 2137/5601 cut-off events. [2023-11-30 04:50:07,749 INFO L125 PetriNetUnfolderBase]: For 50970/53092 co-relation queries the response was YES. [2023-11-30 04:50:07,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39663 conditions, 5601 events. 2137/5601 cut-off events. For 50970/53092 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 50145 event pairs, 91 based on Foata normal form. 1/4975 useless extension candidates. Maximal degree in co-relation 39490. Up to 2670 conditions per place. [2023-11-30 04:50:07,797 INFO L140 encePairwiseOnDemand]: 159/178 looper letters, 337 selfloop transitions, 47 changer transitions 10/494 dead transitions. [2023-11-30 04:50:07,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 494 transitions, 10107 flow [2023-11-30 04:50:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:50:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:50:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 872 transitions. [2023-11-30 04:50:07,800 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6123595505617978 [2023-11-30 04:50:07,800 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 872 transitions. [2023-11-30 04:50:07,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 872 transitions. [2023-11-30 04:50:07,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:07,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 872 transitions. [2023-11-30 04:50:07,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:07,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 178.0) internal successors, (1602), 9 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:07,803 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 178.0) internal successors, (1602), 9 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:07,804 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, 3 predicate places. [2023-11-30 04:50:07,804 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 494 transitions, 10107 flow [2023-11-30 04:50:07,804 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.44444444444444) internal successors, (922), 9 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:07,804 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:07,804 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:07,804 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:50:07,804 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:07,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2028822097, now seen corresponding path program 1 times [2023-11-30 04:50:07,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:07,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463085955] [2023-11-30 04:50:07,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:07,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463085955] [2023-11-30 04:50:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463085955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:08,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:50:08,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656673400] [2023-11-30 04:50:08,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:08,136 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 04:50:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:08,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 04:50:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-30 04:50:08,138 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 178 [2023-11-30 04:50:08,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 494 transitions, 10107 flow. Second operand has 13 states, 13 states have (on average 97.92307692307692) internal successors, (1273), 13 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:08,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:08,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 178 [2023-11-30 04:50:08,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:09,806 INFO L124 PetriNetUnfolderBase]: 2441/6898 cut-off events. [2023-11-30 04:50:09,807 INFO L125 PetriNetUnfolderBase]: For 56985/63678 co-relation queries the response was YES. [2023-11-30 04:50:09,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50733 conditions, 6898 events. 2441/6898 cut-off events. For 56985/63678 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 65219 event pairs, 108 based on Foata normal form. 30/6362 useless extension candidates. Maximal degree in co-relation 50548. Up to 2936 conditions per place. [2023-11-30 04:50:09,862 INFO L140 encePairwiseOnDemand]: 152/178 looper letters, 219 selfloop transitions, 107 changer transitions 198/615 dead transitions. [2023-11-30 04:50:09,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 615 transitions, 14009 flow [2023-11-30 04:50:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 04:50:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 04:50:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1791 transitions. [2023-11-30 04:50:09,869 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5918704560475876 [2023-11-30 04:50:09,869 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1791 transitions. [2023-11-30 04:50:09,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1791 transitions. [2023-11-30 04:50:09,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:09,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1791 transitions. [2023-11-30 04:50:09,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 105.3529411764706) internal successors, (1791), 17 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:09,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 178.0) internal successors, (3204), 18 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:09,877 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 178.0) internal successors, (3204), 18 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:09,878 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, 19 predicate places. [2023-11-30 04:50:09,878 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 615 transitions, 14009 flow [2023-11-30 04:50:09,878 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 97.92307692307692) internal successors, (1273), 13 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:09,879 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:09,879 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:09,879 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:50:09,879 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:09,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash -176705651, now seen corresponding path program 1 times [2023-11-30 04:50:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:09,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688995037] [2023-11-30 04:50:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:10,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688995037] [2023-11-30 04:50:10,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688995037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:10,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:10,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-30 04:50:10,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009284629] [2023-11-30 04:50:10,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:10,324 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 04:50:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:10,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 04:50:10,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-30 04:50:10,326 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 178 [2023-11-30 04:50:10,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 615 transitions, 14009 flow. Second operand has 14 states, 14 states have (on average 95.92857142857143) internal successors, (1343), 14 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:10,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:10,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 178 [2023-11-30 04:50:10,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:13,626 INFO L124 PetriNetUnfolderBase]: 4692/12049 cut-off events. [2023-11-30 04:50:13,626 INFO L125 PetriNetUnfolderBase]: For 131726/141672 co-relation queries the response was YES. [2023-11-30 04:50:13,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94330 conditions, 12049 events. 4692/12049 cut-off events. For 131726/141672 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 119246 event pairs, 181 based on Foata normal form. 79/11421 useless extension candidates. Maximal degree in co-relation 94132. Up to 4842 conditions per place. [2023-11-30 04:50:13,734 INFO L140 encePairwiseOnDemand]: 152/178 looper letters, 286 selfloop transitions, 79 changer transitions 621/1075 dead transitions. [2023-11-30 04:50:13,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 1075 transitions, 27748 flow [2023-11-30 04:50:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-30 04:50:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-30 04:50:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1873 transitions. [2023-11-30 04:50:13,738 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.58458177278402 [2023-11-30 04:50:13,738 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1873 transitions. [2023-11-30 04:50:13,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1873 transitions. [2023-11-30 04:50:13,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:13,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1873 transitions. [2023-11-30 04:50:13,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 104.05555555555556) internal successors, (1873), 18 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:13,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 178.0) internal successors, (3382), 19 states have internal predecessors, (3382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:13,745 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 178.0) internal successors, (3382), 19 states have internal predecessors, (3382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:13,745 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, 36 predicate places. [2023-11-30 04:50:13,745 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 1075 transitions, 27748 flow [2023-11-30 04:50:13,746 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 95.92857142857143) internal successors, (1343), 14 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:13,746 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:13,746 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:13,746 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:50:13,746 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:50:13,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1873105003, now seen corresponding path program 2 times [2023-11-30 04:50:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:13,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753817445] [2023-11-30 04:50:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753817445] [2023-11-30 04:50:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753817445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:14,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-30 04:50:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202908025] [2023-11-30 04:50:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:14,159 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 04:50:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:14,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 04:50:14,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-30 04:50:14,160 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 178 [2023-11-30 04:50:14,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 1075 transitions, 27748 flow. Second operand has 14 states, 14 states have (on average 95.92857142857143) internal successors, (1343), 14 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:14,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:14,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 178 [2023-11-30 04:50:14,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:16,856 INFO L124 PetriNetUnfolderBase]: 3894/9542 cut-off events. [2023-11-30 04:50:16,857 INFO L125 PetriNetUnfolderBase]: For 125309/136593 co-relation queries the response was YES. [2023-11-30 04:50:16,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82258 conditions, 9542 events. 3894/9542 cut-off events. For 125309/136593 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 87206 event pairs, 64 based on Foata normal form. 223/9551 useless extension candidates. Maximal degree in co-relation 82047. Up to 3570 conditions per place. [2023-11-30 04:50:16,904 INFO L140 encePairwiseOnDemand]: 160/178 looper letters, 0 selfloop transitions, 0 changer transitions 1189/1189 dead transitions. [2023-11-30 04:50:16,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 1189 transitions, 32704 flow [2023-11-30 04:50:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 04:50:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 04:50:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1637 transitions. [2023-11-30 04:50:16,915 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5747893258426966 [2023-11-30 04:50:16,915 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1637 transitions. [2023-11-30 04:50:16,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1637 transitions. [2023-11-30 04:50:16,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:16,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1637 transitions. [2023-11-30 04:50:16,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 102.3125) internal successors, (1637), 16 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:16,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 178.0) internal successors, (3026), 17 states have internal predecessors, (3026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:16,921 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 178.0) internal successors, (3026), 17 states have internal predecessors, (3026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:16,922 INFO L307 CegarLoopForPetriNet]: 182 programPoint places, 44 predicate places. [2023-11-30 04:50:16,922 INFO L500 AbstractCegarLoop]: Abstraction has has 226 places, 1189 transitions, 32704 flow [2023-11-30 04:50:16,932 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 95.92857142857143) internal successors, (1343), 14 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:16,942 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe018_rmo.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:50:16,986 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 83 remaining) [2023-11-30 04:50:16,986 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 83 remaining) [2023-11-30 04:50:16,986 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 83 remaining) [2023-11-30 04:50:16,986 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 83 remaining) [2023-11-30 04:50:16,986 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 83 remaining) [2023-11-30 04:50:16,986 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 83 remaining) [2023-11-30 04:50:16,987 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 83 remaining) [2023-11-30 04:50:16,988 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 83 remaining) [2023-11-30 04:50:16,989 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 83 remaining) [2023-11-30 04:50:16,989 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 83 remaining) [2023-11-30 04:50:16,989 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 83 remaining) [2023-11-30 04:50:16,989 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 83 remaining) [2023-11-30 04:50:16,990 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 83 remaining) [2023-11-30 04:50:16,990 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 83 remaining) [2023-11-30 04:50:16,990 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 83 remaining) [2023-11-30 04:50:16,990 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 83 remaining) [2023-11-30 04:50:16,990 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 83 remaining) [2023-11-30 04:50:16,990 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 83 remaining) [2023-11-30 04:50:16,990 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 83 remaining) [2023-11-30 04:50:16,990 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 83 remaining) [2023-11-30 04:50:16,990 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 83 remaining) [2023-11-30 04:50:16,990 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 83 remaining) [2023-11-30 04:50:16,991 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 83 remaining) [2023-11-30 04:50:16,992 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 83 remaining) [2023-11-30 04:50:16,993 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 83 remaining) [2023-11-30 04:50:16,993 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 83 remaining) [2023-11-30 04:50:16,993 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 83 remaining) [2023-11-30 04:50:16,993 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 83 remaining) [2023-11-30 04:50:16,993 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 83 remaining) [2023-11-30 04:50:16,993 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 83 remaining) [2023-11-30 04:50:16,993 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 83 remaining) [2023-11-30 04:50:16,993 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 83 remaining) [2023-11-30 04:50:16,993 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 83 remaining) [2023-11-30 04:50:16,993 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:50:16,994 INFO L457 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:16,998 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:50:16,998 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:50:17,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:50:17 BasicIcfg [2023-11-30 04:50:17,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:50:17,004 INFO L158 Benchmark]: Toolchain (without parser) took 25363.98ms. Allocated memory was 329.3MB in the beginning and 5.7GB in the end (delta: 5.3GB). Free memory was 288.6MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-11-30 04:50:17,004 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 329.3MB. Free memory is still 285.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:50:17,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.29ms. Allocated memory is still 329.3MB. Free memory was 288.6MB in the beginning and 263.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:50:17,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.30ms. Allocated memory is still 329.3MB. Free memory was 263.9MB in the beginning and 261.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:50:17,006 INFO L158 Benchmark]: Boogie Preprocessor took 25.25ms. Allocated memory is still 329.3MB. Free memory was 261.4MB in the beginning and 259.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:50:17,007 INFO L158 Benchmark]: RCFGBuilder took 813.11ms. Allocated memory is still 329.3MB. Free memory was 259.1MB in the beginning and 212.0MB in the end (delta: 47.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.0GB. [2023-11-30 04:50:17,007 INFO L158 Benchmark]: TraceAbstraction took 23960.75ms. Allocated memory was 329.3MB in the beginning and 5.7GB in the end (delta: 5.3GB). Free memory was 211.0MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-11-30 04:50:17,013 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.12ms. Allocated memory is still 329.3MB. Free memory is still 285.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 524.29ms. Allocated memory is still 329.3MB. Free memory was 288.6MB in the beginning and 263.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.30ms. Allocated memory is still 329.3MB. Free memory was 263.9MB in the beginning and 261.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.25ms. Allocated memory is still 329.3MB. Free memory was 261.4MB in the beginning and 259.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 813.11ms. Allocated memory is still 329.3MB. Free memory was 259.1MB in the beginning and 212.0MB in the end (delta: 47.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.0GB. * TraceAbstraction took 23960.75ms. Allocated memory was 329.3MB in the beginning and 5.7GB in the end (delta: 5.3GB). Free memory was 211.0MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 236 locations, 83 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1034 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1034 mSDsluCounter, 389 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 215 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2144 IncrementalHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 174 mSDtfsCounter, 2144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32704occurred in iteration=15, InterpolantAutomatonStates: 108, 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.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1182 NumberOfCodeBlocks, 1182 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1167 ConstructedInterpolants, 0 QuantifiedInterpolants, 7101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 46 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:50:17,034 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...