/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/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:00:41,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:00:41,208 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:00:41,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:00:41,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:00:41,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:00:41,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:00:41,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:00:41,234 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:00:41,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:00:41,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:00:41,238 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:00:41,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:00:41,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:00:41,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:00:41,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:00:41,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:00:41,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:00:41,239 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:00:41,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:00:41,240 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:00:41,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:00:41,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:00:41,240 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:00:41,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:00:41,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:00:41,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:00:41,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:00:41,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:00:41,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:00:41,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:00:41,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:00:41,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:00:41,243 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:00:41,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:00:41,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:00:41,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:00:41,447 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:00:41,447 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:00:41,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2023-11-30 04:00:42,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:00:42,648 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:00:42,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2023-11-30 04:00:42,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f045cf859/b29cea6e515545df96646d489a26cebf/FLAGa082078b3 [2023-11-30 04:00:42,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f045cf859/b29cea6e515545df96646d489a26cebf [2023-11-30 04:00:42,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:00:42,679 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:00:42,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:00:42,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:00:42,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:00:42,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:00:42" (1/1) ... [2023-11-30 04:00:42,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b65572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:42, skipping insertion in model container [2023-11-30 04:00:42,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:00:42" (1/1) ... [2023-11-30 04:00:42,717 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:00:43,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:00:43,061 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:00:43,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:00:43,156 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:00:43,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43 WrapperNode [2023-11-30 04:00:43,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:00:43,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:00:43,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:00:43,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:00:43,161 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:00:43" (1/1) ... [2023-11-30 04:00:43,185 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:00:43" (1/1) ... [2023-11-30 04:00:43,218 INFO L138 Inliner]: procedures = 275, calls = 74, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 269 [2023-11-30 04:00:43,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:00:43,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:00:43,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:00:43,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:00:43,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43" (1/1) ... [2023-11-30 04:00:43,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43" (1/1) ... [2023-11-30 04:00:43,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43" (1/1) ... [2023-11-30 04:00:43,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43" (1/1) ... [2023-11-30 04:00:43,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43" (1/1) ... [2023-11-30 04:00:43,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43" (1/1) ... [2023-11-30 04:00:43,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43" (1/1) ... [2023-11-30 04:00:43,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43" (1/1) ... [2023-11-30 04:00:43,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:00:43,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:00:43,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:00:43,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:00:43,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43" (1/1) ... [2023-11-30 04:00:43,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:00:43,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:00:43,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:00:43,276 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:00:43,295 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-30 04:00:43,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-30 04:00:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-30 04:00:43,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-30 04:00:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:00:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:00:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 04:00:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:00:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:00:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 04:00:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:00:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:00:43,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:00:43,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:00:43,298 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:00:43,408 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:00:43,433 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:00:43,980 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:00:43,995 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:00:43,995 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 04:00:43,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:00:43 BoogieIcfgContainer [2023-11-30 04:00:43,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:00:43,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:00:43,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:00:44,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:00:44,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:00:42" (1/3) ... [2023-11-30 04:00:44,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee0ad6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:00:44, skipping insertion in model container [2023-11-30 04:00:44,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:43" (2/3) ... [2023-11-30 04:00:44,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee0ad6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:00:44, skipping insertion in model container [2023-11-30 04:00:44,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:00:43" (3/3) ... [2023-11-30 04:00:44,002 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2023-11-30 04:00:44,013 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:00:44,013 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2023-11-30 04:00:44,013 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:00:44,096 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 04:00:44,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 358 places, 369 transitions, 752 flow [2023-11-30 04:00:44,204 INFO L124 PetriNetUnfolderBase]: 18/367 cut-off events. [2023-11-30 04:00:44,204 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:00:44,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 367 events. 18/367 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 793 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 266. Up to 2 conditions per place. [2023-11-30 04:00:44,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 358 places, 369 transitions, 752 flow [2023-11-30 04:00:44,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 339 places, 348 transitions, 705 flow [2023-11-30 04:00:44,232 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:00:44,236 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;@7b10b4ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:00:44,236 INFO L363 AbstractCegarLoop]: Starting to check reachability of 136 error locations. [2023-11-30 04:00:44,242 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:00:44,242 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2023-11-30 04:00:44,242 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:00:44,242 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:00:44,243 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] [2023-11-30 04:00:44,243 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:00:44,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:00:44,246 INFO L85 PathProgramCache]: Analyzing trace with hash -255396237, now seen corresponding path program 1 times [2023-11-30 04:00:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:00:44,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072099135] [2023-11-30 04:00:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:00:44,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:00:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:00:44,650 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:00:44,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:00:44,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072099135] [2023-11-30 04:00:44,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072099135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:00:44,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:00:44,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:00:44,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800393508] [2023-11-30 04:00:44,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:00:44,658 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:00:44,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:00:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:00:44,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:00:44,684 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 369 [2023-11-30 04:00:44,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 348 transitions, 705 flow. Second operand has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 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:00:44,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:00:44,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 369 [2023-11-30 04:00:44,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:00:46,810 INFO L124 PetriNetUnfolderBase]: 5809/16881 cut-off events. [2023-11-30 04:00:46,810 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2023-11-30 04:00:46,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25828 conditions, 16881 events. 5809/16881 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 173884 event pairs, 5275 based on Foata normal form. 684/13091 useless extension candidates. Maximal degree in co-relation 25385. Up to 8807 conditions per place. [2023-11-30 04:00:46,914 INFO L140 encePairwiseOnDemand]: 354/369 looper letters, 99 selfloop transitions, 6 changer transitions 0/333 dead transitions. [2023-11-30 04:00:46,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 333 transitions, 885 flow [2023-11-30 04:00:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:00:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:00:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1590 transitions. [2023-11-30 04:00:46,965 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7181571815718157 [2023-11-30 04:00:46,965 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1590 transitions. [2023-11-30 04:00:46,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1590 transitions. [2023-11-30 04:00:46,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:00:46,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1590 transitions. [2023-11-30 04:00:46,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 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:00:46,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 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:00:46,995 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 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:00:47,002 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, -4 predicate places. [2023-11-30 04:00:47,003 INFO L500 AbstractCegarLoop]: Abstraction has has 335 places, 333 transitions, 885 flow [2023-11-30 04:00:47,004 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 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:00:47,004 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:00:47,004 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] [2023-11-30 04:00:47,004 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:00:47,004 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:00:47,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:00:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash -255396236, now seen corresponding path program 1 times [2023-11-30 04:00:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:00:47,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456371576] [2023-11-30 04:00:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:00:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:00:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:00:47,253 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:00:47,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:00:47,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456371576] [2023-11-30 04:00:47,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456371576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:00:47,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:00:47,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:00:47,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073347269] [2023-11-30 04:00:47,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:00:47,255 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:00:47,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:00:47,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:00:47,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:00:47,257 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 369 [2023-11-30 04:00:47,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 333 transitions, 885 flow. Second operand has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 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:00:47,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:00:47,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 369 [2023-11-30 04:00:47,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:00:50,804 INFO L124 PetriNetUnfolderBase]: 15728/36051 cut-off events. [2023-11-30 04:00:50,804 INFO L125 PetriNetUnfolderBase]: For 5215/6275 co-relation queries the response was YES. [2023-11-30 04:00:50,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76721 conditions, 36051 events. 15728/36051 cut-off events. For 5215/6275 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 384101 event pairs, 14749 based on Foata normal form. 0/27491 useless extension candidates. Maximal degree in co-relation 75845. Up to 23862 conditions per place. [2023-11-30 04:00:51,256 INFO L140 encePairwiseOnDemand]: 360/369 looper letters, 131 selfloop transitions, 6 changer transitions 0/330 dead transitions. [2023-11-30 04:00:51,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 330 transitions, 1147 flow [2023-11-30 04:00:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:00:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:00:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1406 transitions. [2023-11-30 04:00:51,259 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6350496838301717 [2023-11-30 04:00:51,259 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1406 transitions. [2023-11-30 04:00:51,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1406 transitions. [2023-11-30 04:00:51,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:00:51,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1406 transitions. [2023-11-30 04:00:51,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 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:00:51,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 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:00:51,266 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 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:00:51,266 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, -2 predicate places. [2023-11-30 04:00:51,266 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 330 transitions, 1147 flow [2023-11-30 04:00:51,267 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 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:00:51,267 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:00:51,267 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] [2023-11-30 04:00:51,267 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:00:51,267 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:00:51,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:00:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1756187696, now seen corresponding path program 1 times [2023-11-30 04:00:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:00:51,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827947200] [2023-11-30 04:00:51,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:00:51,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:00:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:00:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:00:51,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:00:51,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827947200] [2023-11-30 04:00:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827947200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:00:51,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:00:51,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:00:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370134649] [2023-11-30 04:00:51,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:00:51,580 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:00:51,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:00:51,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:00:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:00:51,584 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 369 [2023-11-30 04:00:51,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 330 transitions, 1147 flow. Second operand has 8 states, 8 states have (on average 245.625) internal successors, (1965), 8 states have internal predecessors, (1965), 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:00:51,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:00:51,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 369 [2023-11-30 04:00:51,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:00:55,398 INFO L124 PetriNetUnfolderBase]: 15728/36049 cut-off events. [2023-11-30 04:00:55,398 INFO L125 PetriNetUnfolderBase]: For 21189/24711 co-relation queries the response was YES. [2023-11-30 04:00:55,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93342 conditions, 36049 events. 15728/36049 cut-off events. For 21189/24711 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 383653 event pairs, 14749 based on Foata normal form. 2/34598 useless extension candidates. Maximal degree in co-relation 92259. Up to 23860 conditions per place. [2023-11-30 04:00:55,641 INFO L140 encePairwiseOnDemand]: 357/369 looper letters, 95 selfloop transitions, 10 changer transitions 0/328 dead transitions. [2023-11-30 04:00:55,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 328 transitions, 1349 flow [2023-11-30 04:00:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 04:00:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 04:00:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2537 transitions. [2023-11-30 04:00:55,646 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6875338753387534 [2023-11-30 04:00:55,646 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2537 transitions. [2023-11-30 04:00:55,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2537 transitions. [2023-11-30 04:00:55,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:00:55,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2537 transitions. [2023-11-30 04:00:55,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 253.7) internal successors, (2537), 10 states have internal predecessors, (2537), 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:00:55,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 369.0) internal successors, (4059), 11 states have internal predecessors, (4059), 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:00:55,657 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 369.0) internal successors, (4059), 11 states have internal predecessors, (4059), 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:00:55,658 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 5 predicate places. [2023-11-30 04:00:55,658 INFO L500 AbstractCegarLoop]: Abstraction has has 344 places, 328 transitions, 1349 flow [2023-11-30 04:00:55,658 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 245.625) internal successors, (1965), 8 states have internal predecessors, (1965), 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:00:55,658 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:00:55,659 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] [2023-11-30 04:00:55,659 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:00:55,659 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:00:55,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:00:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1756187697, now seen corresponding path program 1 times [2023-11-30 04:00:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:00:55,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853778021] [2023-11-30 04:00:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:00:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:00:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:00:55,738 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:00:55,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:00:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853778021] [2023-11-30 04:00:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853778021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:00:55,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:00:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:00:55,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578668805] [2023-11-30 04:00:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:00:55,739 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:00:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:00:55,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:00:55,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:00:55,741 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 369 [2023-11-30 04:00:55,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 328 transitions, 1349 flow. Second operand has 8 states, 8 states have (on average 242.75) internal successors, (1942), 8 states have internal predecessors, (1942), 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:00:55,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:00:55,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 369 [2023-11-30 04:00:55,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:00:59,644 INFO L124 PetriNetUnfolderBase]: 15728/36047 cut-off events. [2023-11-30 04:00:59,644 INFO L125 PetriNetUnfolderBase]: For 42007/47433 co-relation queries the response was YES. [2023-11-30 04:00:59,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109958 conditions, 36047 events. 15728/36047 cut-off events. For 42007/47433 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 384307 event pairs, 14749 based on Foata normal form. 0/34596 useless extension candidates. Maximal degree in co-relation 108673. Up to 23858 conditions per place. [2023-11-30 04:00:59,902 INFO L140 encePairwiseOnDemand]: 358/369 looper letters, 95 selfloop transitions, 9 changer transitions 0/326 dead transitions. [2023-11-30 04:00:59,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 326 transitions, 1541 flow [2023-11-30 04:00:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:00:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:00:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2266 transitions. [2023-11-30 04:00:59,906 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.682324601023788 [2023-11-30 04:00:59,906 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2266 transitions. [2023-11-30 04:00:59,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2266 transitions. [2023-11-30 04:00:59,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:00:59,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2266 transitions. [2023-11-30 04:00:59,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 251.77777777777777) internal successors, (2266), 9 states have internal predecessors, (2266), 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:00:59,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 369.0) internal successors, (3690), 10 states have internal predecessors, (3690), 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:00:59,915 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 369.0) internal successors, (3690), 10 states have internal predecessors, (3690), 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:00:59,916 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 11 predicate places. [2023-11-30 04:00:59,916 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 326 transitions, 1541 flow [2023-11-30 04:00:59,916 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 242.75) internal successors, (1942), 8 states have internal predecessors, (1942), 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:00:59,916 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:00:59,916 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:00:59,917 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:00:59,917 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:00:59,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:00:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash 49462506, now seen corresponding path program 1 times [2023-11-30 04:00:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:00:59,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301528214] [2023-11-30 04:00:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:00:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:00:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:00,312 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:01:00,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:00,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301528214] [2023-11-30 04:01:00,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301528214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:00,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:00,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:01:00,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410192263] [2023-11-30 04:01:00,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:00,313 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 04:01:00,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:00,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 04:01:00,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-30 04:01:00,316 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 369 [2023-11-30 04:01:00,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 326 transitions, 1541 flow. Second operand has 12 states, 12 states have (on average 264.0) internal successors, (3168), 12 states have internal predecessors, (3168), 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:01:00,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:00,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 369 [2023-11-30 04:01:00,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:04,451 INFO L124 PetriNetUnfolderBase]: 15727/36043 cut-off events. [2023-11-30 04:01:04,452 INFO L125 PetriNetUnfolderBase]: For 64492/70335 co-relation queries the response was YES. [2023-11-30 04:01:04,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119337 conditions, 36043 events. 15727/36043 cut-off events. For 64492/70335 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 383993 event pairs, 14749 based on Foata normal form. 0/34593 useless extension candidates. Maximal degree in co-relation 117903. Up to 23858 conditions per place. [2023-11-30 04:01:04,700 INFO L140 encePairwiseOnDemand]: 352/369 looper letters, 66 selfloop transitions, 16 changer transitions 0/322 dead transitions. [2023-11-30 04:01:04,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 322 transitions, 1697 flow [2023-11-30 04:01:04,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 04:01:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 04:01:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3215 transitions. [2023-11-30 04:01:04,705 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7260614272809395 [2023-11-30 04:01:04,705 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3215 transitions. [2023-11-30 04:01:04,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3215 transitions. [2023-11-30 04:01:04,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:04,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3215 transitions. [2023-11-30 04:01:04,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 267.9166666666667) internal successors, (3215), 12 states have internal predecessors, (3215), 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:01:04,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 369.0) internal successors, (4797), 13 states have internal predecessors, (4797), 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:01:04,716 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 369.0) internal successors, (4797), 13 states have internal predecessors, (4797), 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:01:04,716 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 19 predicate places. [2023-11-30 04:01:04,716 INFO L500 AbstractCegarLoop]: Abstraction has has 358 places, 322 transitions, 1697 flow [2023-11-30 04:01:04,717 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 264.0) internal successors, (3168), 12 states have internal predecessors, (3168), 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:01:04,717 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:04,717 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:01:04,717 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:01:04,717 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:04,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1196445072, now seen corresponding path program 1 times [2023-11-30 04:01:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:04,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353125033] [2023-11-30 04:01:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:04,774 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:01:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:04,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353125033] [2023-11-30 04:01:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353125033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:04,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:04,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305837183] [2023-11-30 04:01:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:04,775 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:04,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:04,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:04,776 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 369 [2023-11-30 04:01:04,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 322 transitions, 1697 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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:01:04,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:04,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 369 [2023-11-30 04:01:04,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:08,162 INFO L124 PetriNetUnfolderBase]: 11374/26847 cut-off events. [2023-11-30 04:01:08,163 INFO L125 PetriNetUnfolderBase]: For 78240/83148 co-relation queries the response was YES. [2023-11-30 04:01:08,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102210 conditions, 26847 events. 11374/26847 cut-off events. For 78240/83148 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 278112 event pairs, 10632 based on Foata normal form. 2106/27857 useless extension candidates. Maximal degree in co-relation 100585. Up to 17564 conditions per place. [2023-11-30 04:01:08,367 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 88 selfloop transitions, 1 changer transitions 0/320 dead transitions. [2023-11-30 04:01:08,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 320 transitions, 1859 flow [2023-11-30 04:01:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2023-11-30 04:01:08,369 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7759710930442638 [2023-11-30 04:01:08,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 859 transitions. [2023-11-30 04:01:08,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 859 transitions. [2023-11-30 04:01:08,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:08,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 859 transitions. [2023-11-30 04:01:08,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 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:01:08,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:01:08,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:01:08,384 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 19 predicate places. [2023-11-30 04:01:08,384 INFO L500 AbstractCegarLoop]: Abstraction has has 358 places, 320 transitions, 1859 flow [2023-11-30 04:01:08,385 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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:01:08,385 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:08,385 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:01:08,385 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:01:08,385 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:08,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1196445073, now seen corresponding path program 1 times [2023-11-30 04:01:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061724023] [2023-11-30 04:01:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:08,489 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:01:08,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:08,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061724023] [2023-11-30 04:01:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061724023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:08,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:08,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:08,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184472354] [2023-11-30 04:01:08,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:08,494 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:08,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:08,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:08,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:08,495 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 369 [2023-11-30 04:01:08,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 320 transitions, 1859 flow. Second operand has 4 states, 4 states have (on average 223.75) internal successors, (895), 4 states have internal predecessors, (895), 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:01:08,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:08,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 369 [2023-11-30 04:01:08,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:10,974 INFO L124 PetriNetUnfolderBase]: 7021/17651 cut-off events. [2023-11-30 04:01:10,975 INFO L125 PetriNetUnfolderBase]: For 71879/76475 co-relation queries the response was YES. [2023-11-30 04:01:11,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80069 conditions, 17651 events. 7021/17651 cut-off events. For 71879/76475 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 176241 event pairs, 6515 based on Foata normal form. 2106/19015 useless extension candidates. Maximal degree in co-relation 78187. Up to 11270 conditions per place. [2023-11-30 04:01:11,077 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 117 selfloop transitions, 1 changer transitions 0/318 dead transitions. [2023-11-30 04:01:11,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 318 transitions, 2079 flow [2023-11-30 04:01:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2023-11-30 04:01:11,080 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7046070460704607 [2023-11-30 04:01:11,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 780 transitions. [2023-11-30 04:01:11,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 780 transitions. [2023-11-30 04:01:11,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:11,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 780 transitions. [2023-11-30 04:01:11,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 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:01:11,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:01:11,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:01:11,102 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 19 predicate places. [2023-11-30 04:01:11,102 INFO L500 AbstractCegarLoop]: Abstraction has has 358 places, 318 transitions, 2079 flow [2023-11-30 04:01:11,103 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 223.75) internal successors, (895), 4 states have internal predecessors, (895), 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:01:11,103 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:11,103 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] [2023-11-30 04:01:11,103 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:01:11,103 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:11,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1216872274, now seen corresponding path program 1 times [2023-11-30 04:01:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:11,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127794133] [2023-11-30 04:01:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:11,185 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:01:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:11,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127794133] [2023-11-30 04:01:11,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127794133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:11,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:11,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717348332] [2023-11-30 04:01:11,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:11,187 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:11,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:11,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:11,189 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 369 [2023-11-30 04:01:11,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 318 transitions, 2079 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:01:11,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:11,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 369 [2023-11-30 04:01:11,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:13,216 INFO L124 PetriNetUnfolderBase]: 6917/17363 cut-off events. [2023-11-30 04:01:13,216 INFO L125 PetriNetUnfolderBase]: For 89383/94630 co-relation queries the response was YES. [2023-11-30 04:01:13,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87174 conditions, 17363 events. 6917/17363 cut-off events. For 89383/94630 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 172286 event pairs, 6418 based on Foata normal form. 98/16727 useless extension candidates. Maximal degree in co-relation 85436. Up to 11073 conditions per place. [2023-11-30 04:01:13,328 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 85 selfloop transitions, 1 changer transitions 0/316 dead transitions. [2023-11-30 04:01:13,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 316 transitions, 2235 flow [2023-11-30 04:01:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2023-11-30 04:01:13,330 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7786811201445348 [2023-11-30 04:01:13,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 862 transitions. [2023-11-30 04:01:13,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 862 transitions. [2023-11-30 04:01:13,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:13,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 862 transitions. [2023-11-30 04:01:13,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:01:13,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:01:13,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:01:13,337 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 19 predicate places. [2023-11-30 04:01:13,337 INFO L500 AbstractCegarLoop]: Abstraction has has 358 places, 316 transitions, 2235 flow [2023-11-30 04:01:13,338 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:01:13,338 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:13,338 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] [2023-11-30 04:01:13,338 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:01:13,338 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:13,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1216872275, now seen corresponding path program 1 times [2023-11-30 04:01:13,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506598462] [2023-11-30 04:01:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:13,380 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:01:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:13,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506598462] [2023-11-30 04:01:13,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506598462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:13,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:13,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321139681] [2023-11-30 04:01:13,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:13,381 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:13,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:13,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:13,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:13,382 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 369 [2023-11-30 04:01:13,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 316 transitions, 2235 flow. Second operand has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 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:01:13,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:13,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 369 [2023-11-30 04:01:13,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:15,714 INFO L124 PetriNetUnfolderBase]: 6813/17075 cut-off events. [2023-11-30 04:01:15,714 INFO L125 PetriNetUnfolderBase]: For 114697/120663 co-relation queries the response was YES. [2023-11-30 04:01:15,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93754 conditions, 17075 events. 6813/17075 cut-off events. For 114697/120663 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 168902 event pairs, 6321 based on Foata normal form. 98/16447 useless extension candidates. Maximal degree in co-relation 92325. Up to 10876 conditions per place. [2023-11-30 04:01:15,846 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 84 selfloop transitions, 1 changer transitions 0/314 dead transitions. [2023-11-30 04:01:15,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 314 transitions, 2377 flow [2023-11-30 04:01:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2023-11-30 04:01:15,862 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7723577235772358 [2023-11-30 04:01:15,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 855 transitions. [2023-11-30 04:01:15,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 855 transitions. [2023-11-30 04:01:15,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:15,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 855 transitions. [2023-11-30 04:01:15,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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:01:15,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:01:15,868 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:01:15,868 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 19 predicate places. [2023-11-30 04:01:15,868 INFO L500 AbstractCegarLoop]: Abstraction has has 358 places, 314 transitions, 2377 flow [2023-11-30 04:01:15,869 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 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:01:15,869 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:15,869 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] [2023-11-30 04:01:15,869 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:01:15,869 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:15,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1902513469, now seen corresponding path program 1 times [2023-11-30 04:01:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:15,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968800819] [2023-11-30 04:01:15,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:16,033 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:01:16,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:16,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968800819] [2023-11-30 04:01:16,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968800819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:01:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545190825] [2023-11-30 04:01:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:16,038 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:01:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:16,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:01:16,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:01:16,040 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 369 [2023-11-30 04:01:16,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 314 transitions, 2377 flow. Second operand has 8 states, 8 states have (on average 225.5) internal successors, (1804), 8 states have internal predecessors, (1804), 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:01:16,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:16,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 369 [2023-11-30 04:01:16,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:18,020 INFO L124 PetriNetUnfolderBase]: 5856/14632 cut-off events. [2023-11-30 04:01:18,021 INFO L125 PetriNetUnfolderBase]: For 149567/150682 co-relation queries the response was YES. [2023-11-30 04:01:18,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86756 conditions, 14632 events. 5856/14632 cut-off events. For 149567/150682 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 139537 event pairs, 2449 based on Foata normal form. 1015/15129 useless extension candidates. Maximal degree in co-relation 85197. Up to 8914 conditions per place. [2023-11-30 04:01:18,136 INFO L140 encePairwiseOnDemand]: 340/369 looper letters, 139 selfloop transitions, 13 changer transitions 0/346 dead transitions. [2023-11-30 04:01:18,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 346 transitions, 3299 flow [2023-11-30 04:01:18,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:01:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:01:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2166 transitions. [2023-11-30 04:01:18,140 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6522131887985546 [2023-11-30 04:01:18,140 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2166 transitions. [2023-11-30 04:01:18,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2166 transitions. [2023-11-30 04:01:18,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:18,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2166 transitions. [2023-11-30 04:01:18,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 240.66666666666666) internal successors, (2166), 9 states have internal predecessors, (2166), 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:01:18,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 369.0) internal successors, (3690), 10 states have internal predecessors, (3690), 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:01:18,146 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 369.0) internal successors, (3690), 10 states have internal predecessors, (3690), 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:01:18,147 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 11 predicate places. [2023-11-30 04:01:18,147 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 346 transitions, 3299 flow [2023-11-30 04:01:18,147 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 225.5) internal successors, (1804), 8 states have internal predecessors, (1804), 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:01:18,148 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:18,148 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] [2023-11-30 04:01:18,148 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:01:18,148 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:18,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1902513470, now seen corresponding path program 1 times [2023-11-30 04:01:18,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:18,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450720759] [2023-11-30 04:01:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:18,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:18,397 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:01:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450720759] [2023-11-30 04:01:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450720759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:18,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-30 04:01:18,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343849645] [2023-11-30 04:01:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:18,398 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 04:01:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:18,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 04:01:18,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-30 04:01:18,400 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 369 [2023-11-30 04:01:18,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 346 transitions, 3299 flow. Second operand has 10 states, 10 states have (on average 222.1) internal successors, (2221), 10 states have internal predecessors, (2221), 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:01:18,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:18,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 369 [2023-11-30 04:01:18,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:20,396 INFO L124 PetriNetUnfolderBase]: 4669/12579 cut-off events. [2023-11-30 04:01:20,396 INFO L125 PetriNetUnfolderBase]: For 138580/139619 co-relation queries the response was YES. [2023-11-30 04:01:20,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76163 conditions, 12579 events. 4669/12579 cut-off events. For 138580/139619 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 119779 event pairs, 1857 based on Foata normal form. 896/12978 useless extension candidates. Maximal degree in co-relation 74471. Up to 6826 conditions per place. [2023-11-30 04:01:20,504 INFO L140 encePairwiseOnDemand]: 337/369 looper letters, 123 selfloop transitions, 18 changer transitions 0/350 dead transitions. [2023-11-30 04:01:20,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 350 transitions, 3593 flow [2023-11-30 04:01:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 04:01:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 04:01:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2783 transitions. [2023-11-30 04:01:20,508 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6285004516711834 [2023-11-30 04:01:20,509 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2783 transitions. [2023-11-30 04:01:20,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2783 transitions. [2023-11-30 04:01:20,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:20,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2783 transitions. [2023-11-30 04:01:20,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 231.91666666666666) internal successors, (2783), 12 states have internal predecessors, (2783), 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:01:20,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 369.0) internal successors, (4797), 13 states have internal predecessors, (4797), 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:01:20,530 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 369.0) internal successors, (4797), 13 states have internal predecessors, (4797), 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:01:20,531 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 8 predicate places. [2023-11-30 04:01:20,531 INFO L500 AbstractCegarLoop]: Abstraction has has 347 places, 350 transitions, 3593 flow [2023-11-30 04:01:20,531 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 222.1) internal successors, (2221), 10 states have internal predecessors, (2221), 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:01:20,531 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:20,531 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] [2023-11-30 04:01:20,531 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:01:20,531 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:20,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1151623780, now seen corresponding path program 1 times [2023-11-30 04:01:20,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:20,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801243636] [2023-11-30 04:01:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:20,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:22,797 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:01:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:22,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801243636] [2023-11-30 04:01:22,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801243636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:22,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:22,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-30 04:01:22,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142640642] [2023-11-30 04:01:22,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:22,798 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-30 04:01:22,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-30 04:01:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-30 04:01:22,800 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 369 [2023-11-30 04:01:22,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 350 transitions, 3593 flow. Second operand has 16 states, 16 states have (on average 181.125) internal successors, (2898), 16 states have internal predecessors, (2898), 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:01:22,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:22,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 369 [2023-11-30 04:01:22,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:26,282 INFO L124 PetriNetUnfolderBase]: 5049/13205 cut-off events. [2023-11-30 04:01:26,283 INFO L125 PetriNetUnfolderBase]: For 157940/159604 co-relation queries the response was YES. [2023-11-30 04:01:26,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88846 conditions, 13205 events. 5049/13205 cut-off events. For 157940/159604 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 124937 event pairs, 1898 based on Foata normal form. 64/12749 useless extension candidates. Maximal degree in co-relation 86985. Up to 7693 conditions per place. [2023-11-30 04:01:26,391 INFO L140 encePairwiseOnDemand]: 346/369 looper letters, 217 selfloop transitions, 29 changer transitions 0/404 dead transitions. [2023-11-30 04:01:26,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 404 transitions, 5108 flow [2023-11-30 04:01:26,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-30 04:01:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-30 04:01:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3742 transitions. [2023-11-30 04:01:26,396 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5070460704607046 [2023-11-30 04:01:26,396 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3742 transitions. [2023-11-30 04:01:26,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3742 transitions. [2023-11-30 04:01:26,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:26,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3742 transitions. [2023-11-30 04:01:26,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 187.1) internal successors, (3742), 20 states have internal predecessors, (3742), 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:01:26,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 369.0) internal successors, (7749), 21 states have internal predecessors, (7749), 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:01:26,426 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 369.0) internal successors, (7749), 21 states have internal predecessors, (7749), 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:01:26,426 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 27 predicate places. [2023-11-30 04:01:26,426 INFO L500 AbstractCegarLoop]: Abstraction has has 366 places, 404 transitions, 5108 flow [2023-11-30 04:01:26,427 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 181.125) internal successors, (2898), 16 states have internal predecessors, (2898), 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:01:26,427 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:26,427 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] [2023-11-30 04:01:26,427 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:01:26,427 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:26,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1055821893, now seen corresponding path program 1 times [2023-11-30 04:01:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599099393] [2023-11-30 04:01:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:26,536 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:01:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599099393] [2023-11-30 04:01:26,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599099393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:26,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:26,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:26,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241304040] [2023-11-30 04:01:26,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:26,537 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:26,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:26,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:26,538 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 369 [2023-11-30 04:01:26,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 404 transitions, 5108 flow. Second operand has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 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:01:26,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:26,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 369 [2023-11-30 04:01:26,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:27,760 INFO L124 PetriNetUnfolderBase]: 2765/7136 cut-off events. [2023-11-30 04:01:27,760 INFO L125 PetriNetUnfolderBase]: For 103510/104102 co-relation queries the response was YES. [2023-11-30 04:01:27,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52681 conditions, 7136 events. 2765/7136 cut-off events. For 103510/104102 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 55541 event pairs, 792 based on Foata normal form. 0/6899 useless extension candidates. Maximal degree in co-relation 50449. Up to 4502 conditions per place. [2023-11-30 04:01:27,833 INFO L140 encePairwiseOnDemand]: 365/369 looper letters, 36 selfloop transitions, 3 changer transitions 0/390 dead transitions. [2023-11-30 04:01:27,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 390 transitions, 4974 flow [2023-11-30 04:01:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2023-11-30 04:01:27,842 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.94579945799458 [2023-11-30 04:01:27,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1047 transitions. [2023-11-30 04:01:27,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1047 transitions. [2023-11-30 04:01:27,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:27,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1047 transitions. [2023-11-30 04:01:27,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.0) internal successors, (1047), 3 states have internal predecessors, (1047), 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:01:27,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:01:27,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:01:27,846 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 29 predicate places. [2023-11-30 04:01:27,846 INFO L500 AbstractCegarLoop]: Abstraction has has 368 places, 390 transitions, 4974 flow [2023-11-30 04:01:27,846 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 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:01:27,846 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:27,846 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] [2023-11-30 04:01:27,846 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:01:27,846 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:27,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1543561332, now seen corresponding path program 1 times [2023-11-30 04:01:27,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:27,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020249074] [2023-11-30 04:01:27,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:28,434 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:01:28,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020249074] [2023-11-30 04:01:28,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020249074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:28,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:28,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-30 04:01:28,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987613567] [2023-11-30 04:01:28,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:28,434 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 04:01:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 04:01:28,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-11-30 04:01:28,437 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 369 [2023-11-30 04:01:28,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 390 transitions, 4974 flow. Second operand has 18 states, 18 states have (on average 179.83333333333334) internal successors, (3237), 18 states have internal predecessors, (3237), 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:01:28,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:28,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 369 [2023-11-30 04:01:28,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:30,452 INFO L124 PetriNetUnfolderBase]: 2758/7089 cut-off events. [2023-11-30 04:01:30,452 INFO L125 PetriNetUnfolderBase]: For 116034/116418 co-relation queries the response was YES. [2023-11-30 04:01:30,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57023 conditions, 7089 events. 2758/7089 cut-off events. For 116034/116418 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 54820 event pairs, 412 based on Foata normal form. 8/6869 useless extension candidates. Maximal degree in co-relation 54602. Up to 4485 conditions per place. [2023-11-30 04:01:30,541 INFO L140 encePairwiseOnDemand]: 348/369 looper letters, 218 selfloop transitions, 27 changer transitions 0/405 dead transitions. [2023-11-30 04:01:30,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 405 transitions, 5900 flow [2023-11-30 04:01:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 04:01:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 04:01:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3155 transitions. [2023-11-30 04:01:30,546 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5029491471385302 [2023-11-30 04:01:30,546 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3155 transitions. [2023-11-30 04:01:30,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3155 transitions. [2023-11-30 04:01:30,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:30,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3155 transitions. [2023-11-30 04:01:30,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 185.58823529411765) internal successors, (3155), 17 states have internal predecessors, (3155), 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:01:30,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 369.0) internal successors, (6642), 18 states have internal predecessors, (6642), 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:01:30,554 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 369.0) internal successors, (6642), 18 states have internal predecessors, (6642), 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:01:30,555 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 44 predicate places. [2023-11-30 04:01:30,555 INFO L500 AbstractCegarLoop]: Abstraction has has 383 places, 405 transitions, 5900 flow [2023-11-30 04:01:30,555 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 179.83333333333334) internal successors, (3237), 18 states have internal predecessors, (3237), 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:01:30,555 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:30,555 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, 1] [2023-11-30 04:01:30,556 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:01:30,556 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:30,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:30,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1645806891, now seen corresponding path program 1 times [2023-11-30 04:01:30,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:30,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066342496] [2023-11-30 04:01:30,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:30,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:30,897 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:01:30,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:30,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066342496] [2023-11-30 04:01:30,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066342496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:30,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:30,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:01:30,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068247291] [2023-11-30 04:01:30,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:30,898 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:01:30,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:01:30,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:01:30,899 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 369 [2023-11-30 04:01:30,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 405 transitions, 5900 flow. Second operand has 7 states, 7 states have (on average 254.71428571428572) internal successors, (1783), 7 states have internal predecessors, (1783), 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:01:30,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:30,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 369 [2023-11-30 04:01:30,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:32,138 INFO L124 PetriNetUnfolderBase]: 2573/6691 cut-off events. [2023-11-30 04:01:32,138 INFO L125 PetriNetUnfolderBase]: For 131625/132019 co-relation queries the response was YES. [2023-11-30 04:01:32,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56648 conditions, 6691 events. 2573/6691 cut-off events. For 131625/132019 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 51191 event pairs, 344 based on Foata normal form. 127/6596 useless extension candidates. Maximal degree in co-relation 54136. Up to 4177 conditions per place. [2023-11-30 04:01:32,225 INFO L140 encePairwiseOnDemand]: 364/369 looper letters, 164 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2023-11-30 04:01:32,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 400 transitions, 6132 flow [2023-11-30 04:01:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:01:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:01:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1078 transitions. [2023-11-30 04:01:32,226 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7303523035230353 [2023-11-30 04:01:32,226 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1078 transitions. [2023-11-30 04:01:32,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1078 transitions. [2023-11-30 04:01:32,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:32,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1078 transitions. [2023-11-30 04:01:32,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 269.5) internal successors, (1078), 4 states have internal predecessors, (1078), 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:01:32,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 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:01:32,228 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 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:01:32,229 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 44 predicate places. [2023-11-30 04:01:32,229 INFO L500 AbstractCegarLoop]: Abstraction has has 383 places, 400 transitions, 6132 flow [2023-11-30 04:01:32,229 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 254.71428571428572) internal successors, (1783), 7 states have internal predecessors, (1783), 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:01:32,229 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:32,229 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, 1] [2023-11-30 04:01:32,229 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:01:32,229 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:32,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1645806892, now seen corresponding path program 1 times [2023-11-30 04:01:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:32,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509685784] [2023-11-30 04:01:32,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:34,187 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:01:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509685784] [2023-11-30 04:01:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509685784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:34,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:34,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-30 04:01:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079826269] [2023-11-30 04:01:34,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:34,188 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 04:01:34,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 04:01:34,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2023-11-30 04:01:34,190 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 369 [2023-11-30 04:01:34,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 400 transitions, 6132 flow. Second operand has 18 states, 18 states have (on average 188.27777777777777) internal successors, (3389), 18 states have internal predecessors, (3389), 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:01:34,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:34,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 369 [2023-11-30 04:01:34,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:36,615 INFO L124 PetriNetUnfolderBase]: 2979/7137 cut-off events. [2023-11-30 04:01:36,616 INFO L125 PetriNetUnfolderBase]: For 182530/183026 co-relation queries the response was YES. [2023-11-30 04:01:36,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67106 conditions, 7137 events. 2979/7137 cut-off events. For 182530/183026 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 53293 event pairs, 348 based on Foata normal form. 2/6914 useless extension candidates. Maximal degree in co-relation 64427. Up to 4581 conditions per place. [2023-11-30 04:01:36,702 INFO L140 encePairwiseOnDemand]: 346/369 looper letters, 195 selfloop transitions, 30 changer transitions 0/408 dead transitions. [2023-11-30 04:01:36,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 408 transitions, 6719 flow [2023-11-30 04:01:36,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-30 04:01:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-30 04:01:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3477 transitions. [2023-11-30 04:01:36,705 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.523486901535682 [2023-11-30 04:01:36,705 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3477 transitions. [2023-11-30 04:01:36,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3477 transitions. [2023-11-30 04:01:36,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:36,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3477 transitions. [2023-11-30 04:01:36,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 193.16666666666666) internal successors, (3477), 18 states have internal predecessors, (3477), 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:01:36,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 369.0) internal successors, (7011), 19 states have internal predecessors, (7011), 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:01:36,713 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 369.0) internal successors, (7011), 19 states have internal predecessors, (7011), 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:01:36,713 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 61 predicate places. [2023-11-30 04:01:36,713 INFO L500 AbstractCegarLoop]: Abstraction has has 400 places, 408 transitions, 6719 flow [2023-11-30 04:01:36,714 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 188.27777777777777) internal successors, (3389), 18 states have internal predecessors, (3389), 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:01:36,714 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:36,714 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, 1, 1, 1, 1, 1] [2023-11-30 04:01:36,714 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:01:36,714 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:36,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:36,714 INFO L85 PathProgramCache]: Analyzing trace with hash -159030253, now seen corresponding path program 1 times [2023-11-30 04:01:36,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:36,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004645419] [2023-11-30 04:01:36,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:36,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:36,950 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:01:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:36,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004645419] [2023-11-30 04:01:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004645419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:36,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:36,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:01:36,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227895852] [2023-11-30 04:01:36,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:36,951 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:01:36,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:36,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:01:36,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:01:36,953 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 369 [2023-11-30 04:01:36,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 408 transitions, 6719 flow. Second operand has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 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:01:36,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:36,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 369 [2023-11-30 04:01:36,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:38,171 INFO L124 PetriNetUnfolderBase]: 2969/7118 cut-off events. [2023-11-30 04:01:38,172 INFO L125 PetriNetUnfolderBase]: For 209358/209866 co-relation queries the response was YES. [2023-11-30 04:01:38,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70897 conditions, 7118 events. 2969/7118 cut-off events. For 209358/209866 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 53049 event pairs, 348 based on Foata normal form. 9/6902 useless extension candidates. Maximal degree in co-relation 68061. Up to 4562 conditions per place. [2023-11-30 04:01:38,423 INFO L140 encePairwiseOnDemand]: 365/369 looper letters, 193 selfloop transitions, 3 changer transitions 0/407 dead transitions. [2023-11-30 04:01:38,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 407 transitions, 7093 flow [2023-11-30 04:01:38,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:01:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:01:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1172 transitions. [2023-11-30 04:01:38,424 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.635230352303523 [2023-11-30 04:01:38,424 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1172 transitions. [2023-11-30 04:01:38,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1172 transitions. [2023-11-30 04:01:38,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:38,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1172 transitions. [2023-11-30 04:01:38,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 234.4) internal successors, (1172), 5 states have internal predecessors, (1172), 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:01:38,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 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:01:38,427 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 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:01:38,427 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 64 predicate places. [2023-11-30 04:01:38,427 INFO L500 AbstractCegarLoop]: Abstraction has has 403 places, 407 transitions, 7093 flow [2023-11-30 04:01:38,428 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 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:01:38,428 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:38,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:38,428 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 04:01:38,428 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:38,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1232921978, now seen corresponding path program 1 times [2023-11-30 04:01:38,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:38,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864151661] [2023-11-30 04:01:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:38,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:38,606 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:01:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864151661] [2023-11-30 04:01:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864151661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-30 04:01:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379038546] [2023-11-30 04:01:38,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:38,607 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 04:01:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:38,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 04:01:38,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-30 04:01:38,608 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 369 [2023-11-30 04:01:38,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 407 transitions, 7093 flow. Second operand has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 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:01:38,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:38,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 369 [2023-11-30 04:01:38,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:40,202 INFO L124 PetriNetUnfolderBase]: 2988/7105 cut-off events. [2023-11-30 04:01:40,202 INFO L125 PetriNetUnfolderBase]: For 241579/242313 co-relation queries the response was YES. [2023-11-30 04:01:40,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74905 conditions, 7105 events. 2988/7105 cut-off events. For 241579/242313 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 53079 event pairs, 354 based on Foata normal form. 18/6896 useless extension candidates. Maximal degree in co-relation 71918. Up to 4564 conditions per place. [2023-11-30 04:01:40,279 INFO L140 encePairwiseOnDemand]: 353/369 looper letters, 185 selfloop transitions, 14 changer transitions 0/415 dead transitions. [2023-11-30 04:01:40,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 415 transitions, 7813 flow [2023-11-30 04:01:40,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 04:01:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 04:01:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2943 transitions. [2023-11-30 04:01:40,282 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2023-11-30 04:01:40,282 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2943 transitions. [2023-11-30 04:01:40,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2943 transitions. [2023-11-30 04:01:40,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:40,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2943 transitions. [2023-11-30 04:01:40,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 245.25) internal successors, (2943), 12 states have internal predecessors, (2943), 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:01:40,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 369.0) internal successors, (4797), 13 states have internal predecessors, (4797), 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:01:40,289 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 369.0) internal successors, (4797), 13 states have internal predecessors, (4797), 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:01:40,289 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 73 predicate places. [2023-11-30 04:01:40,289 INFO L500 AbstractCegarLoop]: Abstraction has has 412 places, 415 transitions, 7813 flow [2023-11-30 04:01:40,289 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 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:01:40,289 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:40,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:40,290 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 04:01:40,290 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:40,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1232921977, now seen corresponding path program 1 times [2023-11-30 04:01:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:40,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051464094] [2023-11-30 04:01:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:40,428 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:01:40,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:40,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051464094] [2023-11-30 04:01:40,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051464094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:40,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:40,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:01:40,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411546771] [2023-11-30 04:01:40,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:40,429 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:01:40,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:40,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:01:40,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:01:40,431 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 369 [2023-11-30 04:01:40,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 415 transitions, 7813 flow. Second operand has 8 states, 8 states have (on average 244.625) internal successors, (1957), 8 states have internal predecessors, (1957), 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:01:40,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:40,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 369 [2023-11-30 04:01:40,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:41,977 INFO L124 PetriNetUnfolderBase]: 2969/7082 cut-off events. [2023-11-30 04:01:41,977 INFO L125 PetriNetUnfolderBase]: For 271633/272203 co-relation queries the response was YES. [2023-11-30 04:01:42,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77952 conditions, 7082 events. 2969/7082 cut-off events. For 271633/272203 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 52836 event pairs, 348 based on Foata normal form. 18/6875 useless extension candidates. Maximal degree in co-relation 74819. Up to 4526 conditions per place. [2023-11-30 04:01:42,072 INFO L140 encePairwiseOnDemand]: 358/369 looper letters, 180 selfloop transitions, 9 changer transitions 0/413 dead transitions. [2023-11-30 04:01:42,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 413 transitions, 8135 flow [2023-11-30 04:01:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:01:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:01:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2251 transitions. [2023-11-30 04:01:42,075 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.677807889190003 [2023-11-30 04:01:42,075 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2251 transitions. [2023-11-30 04:01:42,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2251 transitions. [2023-11-30 04:01:42,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:42,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2251 transitions. [2023-11-30 04:01:42,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 250.11111111111111) internal successors, (2251), 9 states have internal predecessors, (2251), 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:01:42,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 369.0) internal successors, (3690), 10 states have internal predecessors, (3690), 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:01:42,079 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 369.0) internal successors, (3690), 10 states have internal predecessors, (3690), 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:01:42,079 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 79 predicate places. [2023-11-30 04:01:42,079 INFO L500 AbstractCegarLoop]: Abstraction has has 418 places, 413 transitions, 8135 flow [2023-11-30 04:01:42,079 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 244.625) internal successors, (1957), 8 states have internal predecessors, (1957), 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:01:42,080 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:42,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:42,080 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 04:01:42,080 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:42,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1502529426, now seen corresponding path program 1 times [2023-11-30 04:01:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:42,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281197444] [2023-11-30 04:01:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:44,969 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:01:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281197444] [2023-11-30 04:01:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281197444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:44,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:44,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-11-30 04:01:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589425311] [2023-11-30 04:01:44,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:44,970 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-30 04:01:44,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:44,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-30 04:01:44,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2023-11-30 04:01:44,973 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 369 [2023-11-30 04:01:44,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 413 transitions, 8135 flow. Second operand has 27 states, 27 states have (on average 169.85185185185185) internal successors, (4586), 27 states have internal predecessors, (4586), 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:01:44,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:44,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 369 [2023-11-30 04:01:44,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:50,737 INFO L124 PetriNetUnfolderBase]: 3488/8171 cut-off events. [2023-11-30 04:01:50,737 INFO L125 PetriNetUnfolderBase]: For 363100/364652 co-relation queries the response was YES. [2023-11-30 04:01:50,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95058 conditions, 8171 events. 3488/8171 cut-off events. For 363100/364652 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 61365 event pairs, 379 based on Foata normal form. 25/7912 useless extension candidates. Maximal degree in co-relation 91460. Up to 5143 conditions per place. [2023-11-30 04:01:50,845 INFO L140 encePairwiseOnDemand]: 332/369 looper letters, 299 selfloop transitions, 59 changer transitions 2/513 dead transitions. [2023-11-30 04:01:50,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 513 transitions, 12299 flow [2023-11-30 04:01:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-30 04:01:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-30 04:01:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6087 transitions. [2023-11-30 04:01:50,857 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4713124274099884 [2023-11-30 04:01:50,857 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 6087 transitions. [2023-11-30 04:01:50,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 6087 transitions. [2023-11-30 04:01:50,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:50,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 6087 transitions. [2023-11-30 04:01:50,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 173.9142857142857) internal successors, (6087), 35 states have internal predecessors, (6087), 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:01:50,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 369.0) internal successors, (13284), 36 states have internal predecessors, (13284), 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:01:50,869 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 369.0) internal successors, (13284), 36 states have internal predecessors, (13284), 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:01:50,869 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 113 predicate places. [2023-11-30 04:01:50,869 INFO L500 AbstractCegarLoop]: Abstraction has has 452 places, 513 transitions, 12299 flow [2023-11-30 04:01:50,870 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 169.85185185185185) internal successors, (4586), 27 states have internal predecessors, (4586), 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:01:50,870 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:50,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:50,884 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 04:01:50,884 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:50,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash -812455613, now seen corresponding path program 1 times [2023-11-30 04:01:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:50,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375264848] [2023-11-30 04:01:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:50,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:53,361 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:01:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375264848] [2023-11-30 04:01:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375264848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:53,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:53,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-30 04:01:53,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494042366] [2023-11-30 04:01:53,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:53,362 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-30 04:01:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:53,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-30 04:01:53,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2023-11-30 04:01:53,365 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 369 [2023-11-30 04:01:53,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 513 transitions, 12299 flow. Second operand has 20 states, 20 states have (on average 172.55) internal successors, (3451), 20 states have internal predecessors, (3451), 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:01:53,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:53,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 369 [2023-11-30 04:01:53,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:57,865 INFO L124 PetriNetUnfolderBase]: 3666/8567 cut-off events. [2023-11-30 04:01:57,865 INFO L125 PetriNetUnfolderBase]: For 410579/412581 co-relation queries the response was YES. [2023-11-30 04:01:57,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105721 conditions, 8567 events. 3666/8567 cut-off events. For 410579/412581 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 64844 event pairs, 371 based on Foata normal form. 3/8280 useless extension candidates. Maximal degree in co-relation 101969. Up to 5415 conditions per place. [2023-11-30 04:01:58,007 INFO L140 encePairwiseOnDemand]: 345/369 looper letters, 377 selfloop transitions, 47 changer transitions 0/586 dead transitions. [2023-11-30 04:01:58,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 586 transitions, 16009 flow [2023-11-30 04:01:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-30 04:01:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-30 04:01:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3919 transitions. [2023-11-30 04:01:58,010 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.48275437299827545 [2023-11-30 04:01:58,010 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3919 transitions. [2023-11-30 04:01:58,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3919 transitions. [2023-11-30 04:01:58,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:58,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3919 transitions. [2023-11-30 04:01:58,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 178.13636363636363) internal successors, (3919), 22 states have internal predecessors, (3919), 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:01:58,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 369.0) internal successors, (8487), 23 states have internal predecessors, (8487), 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:01:58,019 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 369.0) internal successors, (8487), 23 states have internal predecessors, (8487), 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:01:58,019 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 134 predicate places. [2023-11-30 04:01:58,019 INFO L500 AbstractCegarLoop]: Abstraction has has 473 places, 586 transitions, 16009 flow [2023-11-30 04:01:58,019 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 172.55) internal successors, (3451), 20 states have internal predecessors, (3451), 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:01:58,020 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:58,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:58,020 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 04:01:58,020 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:01:58,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1947584837, now seen corresponding path program 2 times [2023-11-30 04:01:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:58,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006095039] [2023-11-30 04:01:58,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:58,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:00,157 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:02:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:00,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006095039] [2023-11-30 04:02:00,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006095039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:02:00,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:02:00,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-30 04:02:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310637414] [2023-11-30 04:02:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:02:00,158 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-30 04:02:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:00,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-30 04:02:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2023-11-30 04:02:00,160 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 369 [2023-11-30 04:02:00,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 586 transitions, 16009 flow. Second operand has 20 states, 20 states have (on average 172.55) internal successors, (3451), 20 states have internal predecessors, (3451), 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:02:00,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:00,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 369 [2023-11-30 04:02:00,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:04,325 INFO L124 PetriNetUnfolderBase]: 3757/8724 cut-off events. [2023-11-30 04:02:04,325 INFO L125 PetriNetUnfolderBase]: For 449145/451514 co-relation queries the response was YES. [2023-11-30 04:02:04,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114208 conditions, 8724 events. 3757/8724 cut-off events. For 449145/451514 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 66026 event pairs, 373 based on Foata normal form. 21/8454 useless extension candidates. Maximal degree in co-relation 110214. Up to 5524 conditions per place. [2023-11-30 04:02:04,477 INFO L140 encePairwiseOnDemand]: 345/369 looper letters, 388 selfloop transitions, 51 changer transitions 2/603 dead transitions. [2023-11-30 04:02:04,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 603 transitions, 17560 flow [2023-11-30 04:02:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-30 04:02:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-30 04:02:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3564 transitions. [2023-11-30 04:02:04,481 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.48292682926829267 [2023-11-30 04:02:04,481 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3564 transitions. [2023-11-30 04:02:04,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3564 transitions. [2023-11-30 04:02:04,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:04,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3564 transitions. [2023-11-30 04:02:04,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 178.2) internal successors, (3564), 20 states have internal predecessors, (3564), 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:02:04,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 369.0) internal successors, (7749), 21 states have internal predecessors, (7749), 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:02:04,489 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 369.0) internal successors, (7749), 21 states have internal predecessors, (7749), 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:02:04,489 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 153 predicate places. [2023-11-30 04:02:04,489 INFO L500 AbstractCegarLoop]: Abstraction has has 492 places, 603 transitions, 17560 flow [2023-11-30 04:02:04,489 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 172.55) internal successors, (3451), 20 states have internal predecessors, (3451), 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:02:04,489 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:04,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:04,490 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 04:02:04,490 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:02:04,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:04,490 INFO L85 PathProgramCache]: Analyzing trace with hash -892922735, now seen corresponding path program 3 times [2023-11-30 04:02:04,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:04,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062060245] [2023-11-30 04:02:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:05,090 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:02:05,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062060245] [2023-11-30 04:02:05,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062060245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:02:05,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:02:05,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-30 04:02:05,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277860008] [2023-11-30 04:02:05,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:02:05,091 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 04:02:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:05,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 04:02:05,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-11-30 04:02:05,093 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 369 [2023-11-30 04:02:05,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 603 transitions, 17560 flow. Second operand has 18 states, 18 states have (on average 195.0) internal successors, (3510), 18 states have internal predecessors, (3510), 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:02:05,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:05,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 369 [2023-11-30 04:02:05,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:10,732 INFO L124 PetriNetUnfolderBase]: 6856/15691 cut-off events. [2023-11-30 04:02:10,733 INFO L125 PetriNetUnfolderBase]: For 894560/901958 co-relation queries the response was YES. [2023-11-30 04:02:10,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214099 conditions, 15691 events. 6856/15691 cut-off events. For 894560/901958 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 129579 event pairs, 772 based on Foata normal form. 149/15203 useless extension candidates. Maximal degree in co-relation 206696. Up to 10333 conditions per place. [2023-11-30 04:02:10,978 INFO L140 encePairwiseOnDemand]: 337/369 looper letters, 528 selfloop transitions, 54 changer transitions 3/780 dead transitions. [2023-11-30 04:02:10,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 780 transitions, 25381 flow [2023-11-30 04:02:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-30 04:02:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-30 04:02:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4142 transitions. [2023-11-30 04:02:10,982 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5612466124661246 [2023-11-30 04:02:10,982 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4142 transitions. [2023-11-30 04:02:10,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4142 transitions. [2023-11-30 04:02:10,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:10,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4142 transitions. [2023-11-30 04:02:10,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 207.1) internal successors, (4142), 20 states have internal predecessors, (4142), 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:02:10,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 369.0) internal successors, (7749), 21 states have internal predecessors, (7749), 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:02:10,990 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 369.0) internal successors, (7749), 21 states have internal predecessors, (7749), 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:02:10,990 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 172 predicate places. [2023-11-30 04:02:10,990 INFO L500 AbstractCegarLoop]: Abstraction has has 511 places, 780 transitions, 25381 flow [2023-11-30 04:02:10,991 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 195.0) internal successors, (3510), 18 states have internal predecessors, (3510), 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:02:10,991 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:10,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:10,991 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-30 04:02:10,991 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:02:10,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1502764438, now seen corresponding path program 1 times [2023-11-30 04:02:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976117991] [2023-11-30 04:02:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:10,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:14,387 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:02:14,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:14,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976117991] [2023-11-30 04:02:14,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976117991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:02:14,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:02:14,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-11-30 04:02:14,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575996416] [2023-11-30 04:02:14,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:02:14,391 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-30 04:02:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:14,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-30 04:02:14,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2023-11-30 04:02:14,393 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 369 [2023-11-30 04:02:14,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 780 transitions, 25381 flow. Second operand has 29 states, 29 states have (on average 168.68965517241378) internal successors, (4892), 29 states have internal predecessors, (4892), 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:02:14,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:14,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 369 [2023-11-30 04:02:14,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:22,953 INFO L124 PetriNetUnfolderBase]: 7315/17205 cut-off events. [2023-11-30 04:02:22,953 INFO L125 PetriNetUnfolderBase]: For 1041130/1049841 co-relation queries the response was YES. [2023-11-30 04:02:23,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241095 conditions, 17205 events. 7315/17205 cut-off events. For 1041130/1049841 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 145636 event pairs, 832 based on Foata normal form. 72/16524 useless extension candidates. Maximal degree in co-relation 232785. Up to 11019 conditions per place. [2023-11-30 04:02:23,204 INFO L140 encePairwiseOnDemand]: 330/369 looper letters, 675 selfloop transitions, 101 changer transitions 4/937 dead transitions. [2023-11-30 04:02:23,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 937 transitions, 33698 flow [2023-11-30 04:02:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-30 04:02:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-11-30 04:02:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6245 transitions. [2023-11-30 04:02:23,212 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.47011442336645587 [2023-11-30 04:02:23,212 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6245 transitions. [2023-11-30 04:02:23,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6245 transitions. [2023-11-30 04:02:23,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:23,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6245 transitions. [2023-11-30 04:02:23,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 173.47222222222223) internal successors, (6245), 36 states have internal predecessors, (6245), 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:02:23,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 369.0) internal successors, (13653), 37 states have internal predecessors, (13653), 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:02:23,236 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 369.0) internal successors, (13653), 37 states have internal predecessors, (13653), 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:02:23,236 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 207 predicate places. [2023-11-30 04:02:23,236 INFO L500 AbstractCegarLoop]: Abstraction has has 546 places, 937 transitions, 33698 flow [2023-11-30 04:02:23,237 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 168.68965517241378) internal successors, (4892), 29 states have internal predecessors, (4892), 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:02:23,237 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:23,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:23,237 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-30 04:02:23,237 INFO L425 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:02:23,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:23,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1147702490, now seen corresponding path program 2 times [2023-11-30 04:02:23,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:23,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809478898] [2023-11-30 04:02:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:23,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:26,094 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:02:26,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:26,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809478898] [2023-11-30 04:02:26,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809478898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:02:26,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:02:26,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-11-30 04:02:26,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657983509] [2023-11-30 04:02:26,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:02:26,097 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-30 04:02:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:26,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-30 04:02:26,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2023-11-30 04:02:26,100 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 369 [2023-11-30 04:02:26,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 937 transitions, 33698 flow. Second operand has 29 states, 29 states have (on average 168.68965517241378) internal successors, (4892), 29 states have internal predecessors, (4892), 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:02:26,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:26,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 369 [2023-11-30 04:02:26,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:35,827 INFO L124 PetriNetUnfolderBase]: 7518/17982 cut-off events. [2023-11-30 04:02:35,827 INFO L125 PetriNetUnfolderBase]: For 1147333/1154925 co-relation queries the response was YES. [2023-11-30 04:02:35,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260338 conditions, 17982 events. 7518/17982 cut-off events. For 1147333/1154925 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 154226 event pairs, 500 based on Foata normal form. 107/17339 useless extension candidates. Maximal degree in co-relation 251251. Up to 11317 conditions per place. [2023-11-30 04:02:36,122 INFO L140 encePairwiseOnDemand]: 330/369 looper letters, 762 selfloop transitions, 123 changer transitions 5/1047 dead transitions. [2023-11-30 04:02:36,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 1047 transitions, 40557 flow [2023-11-30 04:02:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-30 04:02:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-30 04:02:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6066 transitions. [2023-11-30 04:02:36,128 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4696864111498258 [2023-11-30 04:02:36,128 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 6066 transitions. [2023-11-30 04:02:36,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 6066 transitions. [2023-11-30 04:02:36,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:36,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 6066 transitions. [2023-11-30 04:02:36,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 173.31428571428572) internal successors, (6066), 35 states have internal predecessors, (6066), 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:02:36,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 369.0) internal successors, (13284), 36 states have internal predecessors, (13284), 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:02:36,139 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 369.0) internal successors, (13284), 36 states have internal predecessors, (13284), 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:02:36,139 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 241 predicate places. [2023-11-30 04:02:36,139 INFO L500 AbstractCegarLoop]: Abstraction has has 580 places, 1047 transitions, 40557 flow [2023-11-30 04:02:36,140 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 168.68965517241378) internal successors, (4892), 29 states have internal predecessors, (4892), 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:02:36,140 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:36,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:36,140 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-30 04:02:36,140 INFO L425 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:02:36,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash -423073188, now seen corresponding path program 3 times [2023-11-30 04:02:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:36,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564678358] [2023-11-30 04:02:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:37,486 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:02:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564678358] [2023-11-30 04:02:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564678358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:02:37,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:02:37,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-11-30 04:02:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924061897] [2023-11-30 04:02:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:02:37,487 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-30 04:02:37,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:37,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-30 04:02:37,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-11-30 04:02:37,489 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 369 [2023-11-30 04:02:37,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 1047 transitions, 40557 flow. Second operand has 29 states, 29 states have (on average 168.68965517241378) internal successors, (4892), 29 states have internal predecessors, (4892), 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:02:37,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:37,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 369 [2023-11-30 04:02:37,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:45,448 INFO L124 PetriNetUnfolderBase]: 7574/18045 cut-off events. [2023-11-30 04:02:45,449 INFO L125 PetriNetUnfolderBase]: For 1241196/1252878 co-relation queries the response was YES. [2023-11-30 04:02:45,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273294 conditions, 18045 events. 7574/18045 cut-off events. For 1241196/1252878 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 154681 event pairs, 853 based on Foata normal form. 141/17354 useless extension candidates. Maximal degree in co-relation 263595. Up to 11356 conditions per place. [2023-11-30 04:02:45,727 INFO L140 encePairwiseOnDemand]: 331/369 looper letters, 794 selfloop transitions, 122 changer transitions 8/1081 dead transitions. [2023-11-30 04:02:45,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 1081 transitions, 44074 flow [2023-11-30 04:02:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-30 04:02:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-30 04:02:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5194 transitions. [2023-11-30 04:02:45,732 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4691960252935863 [2023-11-30 04:02:45,732 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5194 transitions. [2023-11-30 04:02:45,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5194 transitions. [2023-11-30 04:02:45,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:45,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5194 transitions. [2023-11-30 04:02:45,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 173.13333333333333) internal successors, (5194), 30 states have internal predecessors, (5194), 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:02:45,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 369.0) internal successors, (11439), 31 states have internal predecessors, (11439), 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:02:45,741 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 369.0) internal successors, (11439), 31 states have internal predecessors, (11439), 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:02:45,741 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 270 predicate places. [2023-11-30 04:02:45,741 INFO L500 AbstractCegarLoop]: Abstraction has has 609 places, 1081 transitions, 44074 flow [2023-11-30 04:02:45,742 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 168.68965517241378) internal successors, (4892), 29 states have internal predecessors, (4892), 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:02:45,742 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:45,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:45,742 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-30 04:02:45,742 INFO L425 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:02:45,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:45,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1730869036, now seen corresponding path program 1 times [2023-11-30 04:02:45,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:45,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334723914] [2023-11-30 04:02:45,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:45,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:47,083 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:02:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:47,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334723914] [2023-11-30 04:02:47,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334723914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:02:47,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:02:47,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-11-30 04:02:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937789687] [2023-11-30 04:02:47,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:02:47,084 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-30 04:02:47,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-30 04:02:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2023-11-30 04:02:47,087 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 369 [2023-11-30 04:02:47,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 1081 transitions, 44074 flow. Second operand has 28 states, 28 states have (on average 170.25) internal successors, (4767), 28 states have internal predecessors, (4767), 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:02:47,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:47,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 369 [2023-11-30 04:02:47,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:55,631 INFO L124 PetriNetUnfolderBase]: 7746/18945 cut-off events. [2023-11-30 04:02:55,631 INFO L125 PetriNetUnfolderBase]: For 1363852/1379246 co-relation queries the response was YES. [2023-11-30 04:02:55,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290534 conditions, 18945 events. 7746/18945 cut-off events. For 1363852/1379246 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 165025 event pairs, 765 based on Foata normal form. 75/18125 useless extension candidates. Maximal degree in co-relation 280645. Up to 11545 conditions per place. [2023-11-30 04:02:55,934 INFO L140 encePairwiseOnDemand]: 329/369 looper letters, 837 selfloop transitions, 70 changer transitions 6/1116 dead transitions. [2023-11-30 04:02:55,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 1116 transitions, 47272 flow [2023-11-30 04:02:55,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-30 04:02:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-11-30 04:02:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6286 transitions. [2023-11-30 04:02:55,945 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4732008431195423 [2023-11-30 04:02:55,945 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6286 transitions. [2023-11-30 04:02:55,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6286 transitions. [2023-11-30 04:02:55,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:55,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6286 transitions. [2023-11-30 04:02:55,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 174.61111111111111) internal successors, (6286), 36 states have internal predecessors, (6286), 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:02:55,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 369.0) internal successors, (13653), 37 states have internal predecessors, (13653), 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:02:55,956 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 369.0) internal successors, (13653), 37 states have internal predecessors, (13653), 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:02:55,957 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 305 predicate places. [2023-11-30 04:02:55,957 INFO L500 AbstractCegarLoop]: Abstraction has has 644 places, 1116 transitions, 47272 flow [2023-11-30 04:02:55,957 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 170.25) internal successors, (4767), 28 states have internal predecessors, (4767), 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:02:55,957 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:55,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:55,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-30 04:02:55,958 INFO L425 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:02:55,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:55,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1453037555, now seen corresponding path program 1 times [2023-11-30 04:02:55,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:55,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658209072] [2023-11-30 04:02:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:55,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:56,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:56,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658209072] [2023-11-30 04:02:56,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658209072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:02:56,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:02:56,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-30 04:02:56,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820341138] [2023-11-30 04:02:56,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:02:56,766 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-30 04:02:56,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:56,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-30 04:02:56,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-30 04:02:56,768 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 369 [2023-11-30 04:02:56,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 1116 transitions, 47272 flow. Second operand has 16 states, 16 states have (on average 217.5625) internal successors, (3481), 16 states have internal predecessors, (3481), 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:02:56,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:56,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 369 [2023-11-30 04:02:56,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:03:04,859 INFO L124 PetriNetUnfolderBase]: 7671/18940 cut-off events. [2023-11-30 04:03:04,859 INFO L125 PetriNetUnfolderBase]: For 1400715/1411653 co-relation queries the response was YES. [2023-11-30 04:03:04,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298687 conditions, 18940 events. 7671/18940 cut-off events. For 1400715/1411653 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 165663 event pairs, 788 based on Foata normal form. 85/18188 useless extension candidates. Maximal degree in co-relation 288534. Up to 11442 conditions per place. [2023-11-30 04:03:05,184 INFO L140 encePairwiseOnDemand]: 340/369 looper letters, 806 selfloop transitions, 81 changer transitions 6/1155 dead transitions. [2023-11-30 04:03:05,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 1155 transitions, 50963 flow [2023-11-30 04:03:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 04:03:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 04:03:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3680 transitions. [2023-11-30 04:03:05,186 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6233062330623306 [2023-11-30 04:03:05,186 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3680 transitions. [2023-11-30 04:03:05,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3680 transitions. [2023-11-30 04:03:05,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:03:05,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3680 transitions. [2023-11-30 04:03:05,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 230.0) internal successors, (3680), 16 states have internal predecessors, (3680), 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:03:05,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 369.0) internal successors, (6273), 17 states have internal predecessors, (6273), 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:03:05,192 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 369.0) internal successors, (6273), 17 states have internal predecessors, (6273), 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:03:05,192 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 320 predicate places. [2023-11-30 04:03:05,192 INFO L500 AbstractCegarLoop]: Abstraction has has 659 places, 1155 transitions, 50963 flow [2023-11-30 04:03:05,193 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 217.5625) internal successors, (3481), 16 states have internal predecessors, (3481), 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:03:05,193 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:03:05,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:05,193 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-30 04:03:05,193 INFO L425 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:03:05,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:03:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1424638043, now seen corresponding path program 1 times [2023-11-30 04:03:05,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:03:05,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383733176] [2023-11-30 04:03:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:03:05,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:03:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:03:05,350 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:03:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:03:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383733176] [2023-11-30 04:03:05,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383733176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:03:05,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:03:05,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:03:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601140408] [2023-11-30 04:03:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:03:05,351 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:03:05,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:03:05,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:03:05,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:03:05,352 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 369 [2023-11-30 04:03:05,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 1155 transitions, 50963 flow. Second operand has 8 states, 8 states have (on average 217.25) internal successors, (1738), 8 states have internal predecessors, (1738), 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:03:05,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:03:05,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 369 [2023-11-30 04:03:05,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:03:15,282 INFO L124 PetriNetUnfolderBase]: 10239/24072 cut-off events. [2023-11-30 04:03:15,282 INFO L125 PetriNetUnfolderBase]: For 2275543/2289417 co-relation queries the response was YES. [2023-11-30 04:03:15,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396001 conditions, 24072 events. 10239/24072 cut-off events. For 2275543/2289417 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 215032 event pairs, 935 based on Foata normal form. 70/22953 useless extension candidates. Maximal degree in co-relation 385372. Up to 14577 conditions per place. [2023-11-30 04:03:15,724 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 1100 selfloop transitions, 5 changer transitions 6/1422 dead transitions. [2023-11-30 04:03:15,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 1422 transitions, 68009 flow [2023-11-30 04:03:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:03:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:03:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1402 transitions. [2023-11-30 04:03:15,726 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6332429990966576 [2023-11-30 04:03:15,726 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1402 transitions. [2023-11-30 04:03:15,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1402 transitions. [2023-11-30 04:03:15,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:03:15,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1402 transitions. [2023-11-30 04:03:15,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 233.66666666666666) internal successors, (1402), 6 states have internal predecessors, (1402), 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:03:15,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 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:03:15,728 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 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:03:15,729 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 325 predicate places. [2023-11-30 04:03:15,729 INFO L500 AbstractCegarLoop]: Abstraction has has 664 places, 1422 transitions, 68009 flow [2023-11-30 04:03:15,729 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 217.25) internal successors, (1738), 8 states have internal predecessors, (1738), 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:03:15,729 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:03:15,729 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:15,729 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-30 04:03:15,729 INFO L425 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:03:15,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:03:15,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1082816853, now seen corresponding path program 1 times [2023-11-30 04:03:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:03:15,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781060398] [2023-11-30 04:03:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:03:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:03:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:03:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:03:15,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:03:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781060398] [2023-11-30 04:03:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781060398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:03:15,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:03:15,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:03:15,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272543703] [2023-11-30 04:03:15,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:03:15,767 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:03:15,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:03:15,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:03:15,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:03:15,768 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 369 [2023-11-30 04:03:15,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 1422 transitions, 68009 flow. Second operand has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 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:03:15,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:03:15,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 369 [2023-11-30 04:03:15,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:03:20,675 INFO L124 PetriNetUnfolderBase]: 4749/11595 cut-off events. [2023-11-30 04:03:20,675 INFO L125 PetriNetUnfolderBase]: For 1388871/1397386 co-relation queries the response was YES. [2023-11-30 04:03:20,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189718 conditions, 11595 events. 4749/11595 cut-off events. For 1388871/1397386 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 95111 event pairs, 335 based on Foata normal form. 2/10913 useless extension candidates. Maximal degree in co-relation 180650. Up to 6267 conditions per place. [2023-11-30 04:03:20,861 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 446 selfloop transitions, 5 changer transitions 26/1110 dead transitions. [2023-11-30 04:03:20,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 1110 transitions, 52479 flow [2023-11-30 04:03:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:03:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:03:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2023-11-30 04:03:20,863 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9448961156278229 [2023-11-30 04:03:20,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1046 transitions. [2023-11-30 04:03:20,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1046 transitions. [2023-11-30 04:03:20,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:03:20,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1046 transitions. [2023-11-30 04:03:20,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.6666666666667) internal successors, (1046), 3 states have internal predecessors, (1046), 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:03:20,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:03:20,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:03:20,865 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 325 predicate places. [2023-11-30 04:03:20,865 INFO L500 AbstractCegarLoop]: Abstraction has has 664 places, 1110 transitions, 52479 flow [2023-11-30 04:03:20,865 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 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:03:20,865 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:03:20,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:20,865 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-30 04:03:20,865 INFO L425 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:03:20,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:03:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1388084341, now seen corresponding path program 1 times [2023-11-30 04:03:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:03:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209092216] [2023-11-30 04:03:20,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:03:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:03:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:03:20,930 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:03:20,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:03:20,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209092216] [2023-11-30 04:03:20,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209092216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:03:20,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:03:20,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:03:20,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074955931] [2023-11-30 04:03:20,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:03:20,930 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:03:20,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:03:20,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:03:20,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:03:20,931 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 369 [2023-11-30 04:03:20,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 1110 transitions, 52479 flow. Second operand has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 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:03:20,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:03:20,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 369 [2023-11-30 04:03:20,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:03:23,358 INFO L124 PetriNetUnfolderBase]: 2484/7370 cut-off events. [2023-11-30 04:03:23,358 INFO L125 PetriNetUnfolderBase]: For 1074570/1083093 co-relation queries the response was YES. [2023-11-30 04:03:23,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104599 conditions, 7370 events. 2484/7370 cut-off events. For 1074570/1083093 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 57863 event pairs, 236 based on Foata normal form. 879/7807 useless extension candidates. Maximal degree in co-relation 95145. Up to 3425 conditions per place. [2023-11-30 04:03:23,450 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 155 selfloop transitions, 63 changer transitions 82/930 dead transitions. [2023-11-30 04:03:23,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 930 transitions, 42024 flow [2023-11-30 04:03:23,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:03:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:03:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2023-11-30 04:03:23,457 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.940379403794038 [2023-11-30 04:03:23,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1041 transitions. [2023-11-30 04:03:23,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1041 transitions. [2023-11-30 04:03:23,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:03:23,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1041 transitions. [2023-11-30 04:03:23,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 347.0) internal successors, (1041), 3 states have internal predecessors, (1041), 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:03:23,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:03:23,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 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:03:23,459 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 327 predicate places. [2023-11-30 04:03:23,459 INFO L500 AbstractCegarLoop]: Abstraction has has 666 places, 930 transitions, 42024 flow [2023-11-30 04:03:23,459 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 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:03:23,459 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:03:23,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:23,460 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-30 04:03:23,460 INFO L425 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:03:23,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:03:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash -486031890, now seen corresponding path program 1 times [2023-11-30 04:03:23,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:03:23,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118564545] [2023-11-30 04:03:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:03:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:03:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:03:23,774 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:03:23,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:03:23,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118564545] [2023-11-30 04:03:23,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118564545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:03:23,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:03:23,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:03:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154493743] [2023-11-30 04:03:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:03:23,775 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:03:23,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:03:23,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:03:23,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:03:23,776 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 369 [2023-11-30 04:03:23,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 930 transitions, 42024 flow. Second operand has 8 states, 8 states have (on average 240.75) internal successors, (1926), 8 states have internal predecessors, (1926), 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:03:23,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:03:23,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 369 [2023-11-30 04:03:23,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:03:25,969 INFO L124 PetriNetUnfolderBase]: 2297/6950 cut-off events. [2023-11-30 04:03:25,969 INFO L125 PetriNetUnfolderBase]: For 897262/900076 co-relation queries the response was YES. [2023-11-30 04:03:25,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102002 conditions, 6950 events. 2297/6950 cut-off events. For 897262/900076 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 53812 event pairs, 194 based on Foata normal form. 190/6731 useless extension candidates. Maximal degree in co-relation 92889. Up to 3195 conditions per place. [2023-11-30 04:03:26,051 INFO L140 encePairwiseOnDemand]: 352/369 looper letters, 554 selfloop transitions, 10 changer transitions 82/930 dead transitions. [2023-11-30 04:03:26,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 930 transitions, 43576 flow [2023-11-30 04:03:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:03:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:03:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2199 transitions. [2023-11-30 04:03:26,052 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6621499548328816 [2023-11-30 04:03:26,052 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2199 transitions. [2023-11-30 04:03:26,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2199 transitions. [2023-11-30 04:03:26,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:03:26,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2199 transitions. [2023-11-30 04:03:26,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 244.33333333333334) internal successors, (2199), 9 states have internal predecessors, (2199), 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:03:26,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 369.0) internal successors, (3690), 10 states have internal predecessors, (3690), 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:03:26,056 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 369.0) internal successors, (3690), 10 states have internal predecessors, (3690), 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:03:26,056 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 327 predicate places. [2023-11-30 04:03:26,056 INFO L500 AbstractCegarLoop]: Abstraction has has 666 places, 930 transitions, 43576 flow [2023-11-30 04:03:26,056 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 240.75) internal successors, (1926), 8 states have internal predecessors, (1926), 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:03:26,056 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:03:26,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:26,056 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-30 04:03:26,056 INFO L425 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:03:26,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:03:26,057 INFO L85 PathProgramCache]: Analyzing trace with hash -486031889, now seen corresponding path program 1 times [2023-11-30 04:03:26,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:03:26,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554781097] [2023-11-30 04:03:26,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:03:26,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:03:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:03:26,272 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:03:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:03:26,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554781097] [2023-11-30 04:03:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554781097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:03:26,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:03:26,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-30 04:03:26,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048124855] [2023-11-30 04:03:26,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:03:26,273 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 04:03:26,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:03:26,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 04:03:26,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-30 04:03:26,274 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 369 [2023-11-30 04:03:26,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 930 transitions, 43576 flow. Second operand has 10 states, 10 states have (on average 236.7) internal successors, (2367), 10 states have internal predecessors, (2367), 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:03:26,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:03:26,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 369 [2023-11-30 04:03:26,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:03:28,438 INFO L124 PetriNetUnfolderBase]: 2077/6504 cut-off events. [2023-11-30 04:03:28,439 INFO L125 PetriNetUnfolderBase]: For 888005/890753 co-relation queries the response was YES. [2023-11-30 04:03:28,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98567 conditions, 6504 events. 2077/6504 cut-off events. For 888005/890753 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 50056 event pairs, 155 based on Foata normal form. 180/6315 useless extension candidates. Maximal degree in co-relation 90223. Up to 2984 conditions per place. [2023-11-30 04:03:28,526 INFO L140 encePairwiseOnDemand]: 348/369 looper letters, 537 selfloop transitions, 15 changer transitions 82/910 dead transitions. [2023-11-30 04:03:28,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 910 transitions, 44084 flow [2023-11-30 04:03:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 04:03:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 04:03:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2863 transitions. [2023-11-30 04:03:28,527 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6465672990063234 [2023-11-30 04:03:28,527 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2863 transitions. [2023-11-30 04:03:28,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2863 transitions. [2023-11-30 04:03:28,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:03:28,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2863 transitions. [2023-11-30 04:03:28,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 238.58333333333334) internal successors, (2863), 12 states have internal predecessors, (2863), 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:03:28,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 369.0) internal successors, (4797), 13 states have internal predecessors, (4797), 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:03:28,540 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 369.0) internal successors, (4797), 13 states have internal predecessors, (4797), 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:03:28,540 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 331 predicate places. [2023-11-30 04:03:28,540 INFO L500 AbstractCegarLoop]: Abstraction has has 670 places, 910 transitions, 44084 flow [2023-11-30 04:03:28,541 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 236.7) internal successors, (2367), 10 states have internal predecessors, (2367), 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:03:28,541 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:03:28,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:28,541 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-30 04:03:28,541 INFO L425 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:03:28,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:03:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2112881594, now seen corresponding path program 1 times [2023-11-30 04:03:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:03:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865726004] [2023-11-30 04:03:28,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:03:28,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:03:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:03:30,329 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:03:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:03:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865726004] [2023-11-30 04:03:30,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865726004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:03:30,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:03:30,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-11-30 04:03:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185744015] [2023-11-30 04:03:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:03:30,330 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-30 04:03:30,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:03:30,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-30 04:03:30,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2023-11-30 04:03:30,333 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 369 [2023-11-30 04:03:30,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 670 places, 910 transitions, 44084 flow. Second operand has 30 states, 30 states have (on average 159.26666666666668) internal successors, (4778), 30 states have internal predecessors, (4778), 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:03:30,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:03:30,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 369 [2023-11-30 04:03:30,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:03:33,303 INFO L124 PetriNetUnfolderBase]: 1601/5101 cut-off events. [2023-11-30 04:03:33,303 INFO L125 PetriNetUnfolderBase]: For 681464/683646 co-relation queries the response was YES. [2023-11-30 04:03:33,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78913 conditions, 5101 events. 1601/5101 cut-off events. For 681464/683646 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 35348 event pairs, 151 based on Foata normal form. 14/4831 useless extension candidates. Maximal degree in co-relation 71523. Up to 2288 conditions per place. [2023-11-30 04:03:33,365 INFO L140 encePairwiseOnDemand]: 328/369 looper letters, 454 selfloop transitions, 118 changer transitions 56/770 dead transitions. [2023-11-30 04:03:33,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 770 transitions, 36851 flow [2023-11-30 04:03:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-30 04:03:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-30 04:03:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4879 transitions. [2023-11-30 04:03:33,368 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2023-11-30 04:03:33,368 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4879 transitions. [2023-11-30 04:03:33,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4879 transitions. [2023-11-30 04:03:33,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:03:33,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4879 transitions. [2023-11-30 04:03:33,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 162.63333333333333) internal successors, (4879), 30 states have internal predecessors, (4879), 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:03:33,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 369.0) internal successors, (11439), 31 states have internal predecessors, (11439), 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:03:33,376 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 369.0) internal successors, (11439), 31 states have internal predecessors, (11439), 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:03:33,378 INFO L307 CegarLoopForPetriNet]: 339 programPoint places, 351 predicate places. [2023-11-30 04:03:33,378 INFO L500 AbstractCegarLoop]: Abstraction has has 690 places, 770 transitions, 36851 flow [2023-11-30 04:03:33,378 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 159.26666666666668) internal successors, (4778), 30 states have internal predecessors, (4778), 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:03:33,378 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:03:33,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:33,379 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-30 04:03:33,379 INFO L425 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-11-30 04:03:33,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:03:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash -43716127, now seen corresponding path program 1 times [2023-11-30 04:03:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:03:33,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386779593] [2023-11-30 04:03:33,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:03:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:03:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-11-30 04:14:19,991 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:19,992 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:19,993 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:19,994 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:19,995 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:19,998 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:19,998 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:19,999 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,000 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,000 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,001 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,001 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,002 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,002 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,003 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,003 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,004 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,004 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,005 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,005 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,006 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,006 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,007 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,007 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,008 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,008 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,008 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,009 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,009 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,010 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,010 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,011 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,011 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,012 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,012 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,013 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,013 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,013 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,013 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-11-30 04:14:20,017 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 136 remaining) [2023-11-30 04:14:20,017 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-30 04:14:20,018 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. [2023-11-30 04:14:20,018 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 136 remaining) [2023-11-30 04:14:20,025 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 04:14:20,035 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 136 remaining) [2023-11-30 04:14:20,048 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 136 remaining) [2023-11-30 04:14:20,048 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 136 remaining) [2023-11-30 04:14:20,048 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 136 remaining) [2023-11-30 04:14:20,048 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 136 remaining) [2023-11-30 04:14:20,048 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 136 remaining) [2023-11-30 04:14:20,049 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (116 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (115 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 136 remaining) [2023-11-30 04:14:20,050 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 136 remaining) [2023-11-30 04:14:20,051 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 136 remaining) [2023-11-30 04:14:20,051 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 136 remaining) [2023-11-30 04:14:20,051 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 136 remaining) [2023-11-30 04:14:20,051 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 136 remaining) [2023-11-30 04:14:20,051 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 136 remaining) [2023-11-30 04:14:20,051 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 136 remaining) [2023-11-30 04:14:20,052 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 136 remaining) [2023-11-30 04:14:20,052 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 136 remaining) [2023-11-30 04:14:20,052 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 136 remaining) [2023-11-30 04:14:20,052 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 136 remaining) [2023-11-30 04:14:20,052 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 136 remaining) [2023-11-30 04:14:20,052 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 136 remaining) [2023-11-30 04:14:20,052 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 136 remaining) [2023-11-30 04:14:20,052 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 136 remaining) [2023-11-30 04:14:20,053 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 136 remaining) [2023-11-30 04:14:20,054 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 136 remaining) [2023-11-30 04:14:20,055 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 136 remaining) [2023-11-30 04:14:20,056 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 136 remaining) [2023-11-30 04:14:20,057 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 136 remaining) [2023-11-30 04:14:20,058 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 136 remaining) [2023-11-30 04:14:20,059 INFO L457 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 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:14:20,063 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:14:20,063 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:14:20,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:14:20 BasicIcfg [2023-11-30 04:14:20,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:14:20,067 INFO L158 Benchmark]: Toolchain (without parser) took 817388.42ms. Allocated memory was 388.0MB in the beginning and 15.6GB in the end (delta: 15.2GB). Free memory was 345.6MB in the beginning and 9.5GB in the end (delta: -9.2GB). Peak memory consumption was 8.8GB. Max. memory is 16.0GB. [2023-11-30 04:14:20,067 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 388.0MB. Free memory is still 343.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:14:20,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.74ms. Allocated memory is still 388.0MB. Free memory was 345.2MB in the beginning and 314.7MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-11-30 04:14:20,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.73ms. Allocated memory is still 388.0MB. Free memory was 314.7MB in the beginning and 311.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:14:20,070 INFO L158 Benchmark]: Boogie Preprocessor took 27.33ms. Allocated memory is still 388.0MB. Free memory was 311.7MB in the beginning and 309.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:14:20,070 INFO L158 Benchmark]: RCFGBuilder took 749.59ms. Allocated memory was 388.0MB in the beginning and 551.6MB in the end (delta: 163.6MB). Free memory was 309.2MB in the beginning and 502.6MB in the end (delta: -193.5MB). Peak memory consumption was 29.2MB. Max. memory is 16.0GB. [2023-11-30 04:14:20,070 INFO L158 Benchmark]: TraceAbstraction took 816068.94ms. Allocated memory was 551.6MB in the beginning and 15.6GB in the end (delta: 15.0GB). Free memory was 501.6MB in the beginning and 9.5GB in the end (delta: -9.0GB). Peak memory consumption was 8.8GB. Max. memory is 16.0GB. [2023-11-30 04:14:20,071 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 388.0MB. Free memory is still 343.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 476.74ms. Allocated memory is still 388.0MB. Free memory was 345.2MB in the beginning and 314.7MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.73ms. Allocated memory is still 388.0MB. Free memory was 314.7MB in the beginning and 311.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.33ms. Allocated memory is still 388.0MB. Free memory was 311.7MB in the beginning and 309.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 749.59ms. Allocated memory was 388.0MB in the beginning and 551.6MB in the end (delta: 163.6MB). Free memory was 309.2MB in the beginning and 502.6MB in the end (delta: -193.5MB). Peak memory consumption was 29.2MB. Max. memory is 16.0GB. * TraceAbstraction took 816068.94ms. Allocated memory was 551.6MB in the beginning and 15.6GB in the end (delta: 15.0GB). Free memory was 501.6MB in the beginning and 9.5GB in the end (delta: -9.0GB). Peak memory consumption was 8.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 182 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 180 interpolants. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 590 locations, 136 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: 815.9s, OverallIterations: 35, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 140.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8555 SdHoareTripleChecker+Valid, 18.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8555 mSDsluCounter, 6880 SdHoareTripleChecker+Invalid, 16.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5886 mSDsCounter, 509 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29649 IncrementalHoareTripleChecker+Invalid, 30158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 509 mSolverCounterUnsat, 994 mSDtfsCounter, 29649 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 175 SyntacticMatches, 24 SemanticMatches, 706 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5880 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68009occurred in iteration=29, InterpolantAutomatonStates: 477, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 3748 NumberOfCodeBlocks, 3748 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3714 ConstructedInterpolants, 0 QuantifiedInterpolants, 96338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 4/4 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown