/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 20:58:17,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 20:58:17,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 20:58:17,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 20:58:17,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 20:58:17,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 20:58:17,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 20:58:17,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 20:58:17,653 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 20:58:17,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 20:58:17,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 20:58:17,657 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 20:58:17,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 20:58:17,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 20:58:17,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 20:58:17,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 20:58:17,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 20:58:17,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 20:58:17,658 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 20:58:17,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 20:58:17,659 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 20:58:17,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 20:58:17,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 20:58:17,660 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 20:58:17,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 20:58:17,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:58:17,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 20:58:17,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 20:58:17,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 20:58:17,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 20:58:17,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 20:58:17,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 20:58:17,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 20:58:17,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 20:58:17,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 20:58:17,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 20:58:17,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 20:58:17,875 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 20:58:17,875 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 20:58:17,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-12-05 20:58:19,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 20:58:19,230 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 20:58:19,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-12-05 20:58:19,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ae9fd32/4df1367ba612402986b871af39d9b48d/FLAG333b188b6 [2023-12-05 20:58:19,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ae9fd32/4df1367ba612402986b871af39d9b48d [2023-12-05 20:58:19,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 20:58:19,263 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 20:58:19,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 20:58:19,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 20:58:19,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 20:58:19,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a255afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19, skipping insertion in model container [2023-12-05 20:58:19,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,327 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 20:58:19,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:58:19,718 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 20:58:19,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:58:19,806 INFO L206 MainTranslator]: Completed translation [2023-12-05 20:58:19,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19 WrapperNode [2023-12-05 20:58:19,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 20:58:19,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 20:58:19,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 20:58:19,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 20:58:19,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,859 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2023-12-05 20:58:19,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 20:58:19,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 20:58:19,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 20:58:19,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 20:58:19,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 20:58:19,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 20:58:19,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 20:58:19,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 20:58:19,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (1/1) ... [2023-12-05 20:58:19,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:58:19,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:58:19,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 20:58:19,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 20:58:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-05 20:58:19,990 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-05 20:58:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-05 20:58:19,990 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-05 20:58:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 20:58:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 20:58:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 20:58:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 20:58:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 20:58:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 20:58:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 20:58:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 20:58:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 20:58:19,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 20:58:19,992 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 20:58:20,158 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 20:58:20,161 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 20:58:20,586 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 20:58:20,600 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 20:58:20,600 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-05 20:58:20,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:58:20 BoogieIcfgContainer [2023-12-05 20:58:20,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 20:58:20,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 20:58:20,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 20:58:20,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 20:58:20,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:58:19" (1/3) ... [2023-12-05 20:58:20,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6912d1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:58:20, skipping insertion in model container [2023-12-05 20:58:20,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:19" (2/3) ... [2023-12-05 20:58:20,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6912d1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:58:20, skipping insertion in model container [2023-12-05 20:58:20,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:58:20" (3/3) ... [2023-12-05 20:58:20,607 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-12-05 20:58:20,618 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 20:58:20,619 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2023-12-05 20:58:20,619 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 20:58:20,715 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 20:58:20,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 294 transitions, 602 flow [2023-12-05 20:58:20,869 INFO L124 PetriNetUnfolderBase]: 15/292 cut-off events. [2023-12-05 20:58:20,869 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 20:58:20,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 292 events. 15/292 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 686 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 197. Up to 3 conditions per place. [2023-12-05 20:58:20,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 294 transitions, 602 flow [2023-12-05 20:58:20,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 282 transitions, 573 flow [2023-12-05 20:58:20,899 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 20:58:20,905 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;@5cefccb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 20:58:20,906 INFO L363 AbstractCegarLoop]: Starting to check reachability of 100 error locations. [2023-12-05 20:58:20,913 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 20:58:20,913 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2023-12-05 20:58:20,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:58:20,913 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:20,914 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:20,914 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:20,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:20,919 INFO L85 PathProgramCache]: Analyzing trace with hash 258200551, now seen corresponding path program 1 times [2023-12-05 20:58:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609684956] [2023-12-05 20:58:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:21,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:21,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609684956] [2023-12-05 20:58:21,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609684956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:21,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:21,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:21,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686095026] [2023-12-05 20:58:21,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:21,431 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:21,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:21,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:21,458 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 294 [2023-12-05 20:58:21,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 282 transitions, 573 flow. Second operand has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:21,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:21,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 294 [2023-12-05 20:58:21,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:22,806 INFO L124 PetriNetUnfolderBase]: 3483/9979 cut-off events. [2023-12-05 20:58:22,806 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-12-05 20:58:22,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15330 conditions, 9979 events. 3483/9979 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 96738 event pairs, 2965 based on Foata normal form. 419/7697 useless extension candidates. Maximal degree in co-relation 14667. Up to 5258 conditions per place. [2023-12-05 20:58:22,872 INFO L140 encePairwiseOnDemand]: 280/294 looper letters, 78 selfloop transitions, 6 changer transitions 0/263 dead transitions. [2023-12-05 20:58:22,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 703 flow [2023-12-05 20:58:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 20:58:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 20:58:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1262 transitions. [2023-12-05 20:58:22,886 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7154195011337868 [2023-12-05 20:58:22,887 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1262 transitions. [2023-12-05 20:58:22,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1262 transitions. [2023-12-05 20:58:22,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:22,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1262 transitions. [2023-12-05 20:58:22,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:22,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:22,903 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:22,906 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, -8 predicate places. [2023-12-05 20:58:22,906 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 263 transitions, 703 flow [2023-12-05 20:58:22,907 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:22,907 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:22,907 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:22,907 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 20:58:22,907 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:22,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:22,908 INFO L85 PathProgramCache]: Analyzing trace with hash 258200552, now seen corresponding path program 1 times [2023-12-05 20:58:22,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:22,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468192866] [2023-12-05 20:58:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:22,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468192866] [2023-12-05 20:58:23,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468192866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:23,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:23,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:23,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868259954] [2023-12-05 20:58:23,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:23,210 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:23,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:23,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:23,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:23,212 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 294 [2023-12-05 20:58:23,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 263 transitions, 703 flow. Second operand has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:23,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:23,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 294 [2023-12-05 20:58:23,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:25,310 INFO L124 PetriNetUnfolderBase]: 9204/20715 cut-off events. [2023-12-05 20:58:25,310 INFO L125 PetriNetUnfolderBase]: For 3521/6937 co-relation queries the response was YES. [2023-12-05 20:58:25,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44650 conditions, 20715 events. 9204/20715 cut-off events. For 3521/6937 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 208239 event pairs, 8239 based on Foata normal form. 0/15549 useless extension candidates. Maximal degree in co-relation 43418. Up to 13932 conditions per place. [2023-12-05 20:58:25,450 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 101 selfloop transitions, 6 changer transitions 0/260 dead transitions. [2023-12-05 20:58:25,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 260 transitions, 905 flow [2023-12-05 20:58:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 20:58:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 20:58:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1124 transitions. [2023-12-05 20:58:25,453 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.63718820861678 [2023-12-05 20:58:25,453 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1124 transitions. [2023-12-05 20:58:25,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1124 transitions. [2023-12-05 20:58:25,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:25,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1124 transitions. [2023-12-05 20:58:25,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:25,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:25,459 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:25,462 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, -6 predicate places. [2023-12-05 20:58:25,462 INFO L500 AbstractCegarLoop]: Abstraction has has 268 places, 260 transitions, 905 flow [2023-12-05 20:58:25,463 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:25,463 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:25,463 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:25,463 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 20:58:25,464 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:25,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash 950976742, now seen corresponding path program 1 times [2023-12-05 20:58:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:25,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362024250] [2023-12-05 20:58:25,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:25,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:25,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:25,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362024250] [2023-12-05 20:58:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362024250] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:25,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:25,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:25,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67672733] [2023-12-05 20:58:25,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:25,657 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:25,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:25,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:25,663 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 294 [2023-12-05 20:58:25,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 260 transitions, 905 flow. Second operand has 8 states, 8 states have (on average 194.625) internal successors, (1557), 8 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:25,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:25,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 294 [2023-12-05 20:58:25,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:27,830 INFO L124 PetriNetUnfolderBase]: 9204/20713 cut-off events. [2023-12-05 20:58:27,844 INFO L125 PetriNetUnfolderBase]: For 14037/21741 co-relation queries the response was YES. [2023-12-05 20:58:27,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54533 conditions, 20713 events. 9204/20713 cut-off events. For 14037/21741 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 208120 event pairs, 8239 based on Foata normal form. 2/19490 useless extension candidates. Maximal degree in co-relation 53049. Up to 13930 conditions per place. [2023-12-05 20:58:28,064 INFO L140 encePairwiseOnDemand]: 282/294 looper letters, 74 selfloop transitions, 10 changer transitions 0/258 dead transitions. [2023-12-05 20:58:28,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 258 transitions, 1065 flow [2023-12-05 20:58:28,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 20:58:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 20:58:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2006 transitions. [2023-12-05 20:58:28,069 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.682312925170068 [2023-12-05 20:58:28,069 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2006 transitions. [2023-12-05 20:58:28,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2006 transitions. [2023-12-05 20:58:28,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:28,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2006 transitions. [2023-12-05 20:58:28,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 200.6) internal successors, (2006), 10 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:28,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:28,079 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:28,080 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 1 predicate places. [2023-12-05 20:58:28,080 INFO L500 AbstractCegarLoop]: Abstraction has has 275 places, 258 transitions, 1065 flow [2023-12-05 20:58:28,080 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 194.625) internal successors, (1557), 8 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:28,080 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:28,081 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:28,081 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 20:58:28,081 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:28,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash 950976741, now seen corresponding path program 1 times [2023-12-05 20:58:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622110182] [2023-12-05 20:58:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:28,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622110182] [2023-12-05 20:58:28,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622110182] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:28,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:28,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:28,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135181137] [2023-12-05 20:58:28,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:28,169 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:28,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:28,172 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 294 [2023-12-05 20:58:28,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 258 transitions, 1065 flow. Second operand has 8 states, 8 states have (on average 191.75) internal successors, (1534), 8 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:28,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:28,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 294 [2023-12-05 20:58:28,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:30,396 INFO L124 PetriNetUnfolderBase]: 9204/20711 cut-off events. [2023-12-05 20:58:30,412 INFO L125 PetriNetUnfolderBase]: For 27630/39701 co-relation queries the response was YES. [2023-12-05 20:58:30,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64411 conditions, 20711 events. 9204/20711 cut-off events. For 27630/39701 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 208224 event pairs, 8239 based on Foata normal form. 0/19488 useless extension candidates. Maximal degree in co-relation 62680. Up to 13928 conditions per place. [2023-12-05 20:58:30,601 INFO L140 encePairwiseOnDemand]: 283/294 looper letters, 74 selfloop transitions, 9 changer transitions 0/256 dead transitions. [2023-12-05 20:58:30,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 256 transitions, 1215 flow [2023-12-05 20:58:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 20:58:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 20:58:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1786 transitions. [2023-12-05 20:58:30,605 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6749811035525322 [2023-12-05 20:58:30,605 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1786 transitions. [2023-12-05 20:58:30,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1786 transitions. [2023-12-05 20:58:30,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:30,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1786 transitions. [2023-12-05 20:58:30,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.44444444444446) internal successors, (1786), 9 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:30,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:30,613 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:30,615 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 7 predicate places. [2023-12-05 20:58:30,615 INFO L500 AbstractCegarLoop]: Abstraction has has 281 places, 256 transitions, 1215 flow [2023-12-05 20:58:30,615 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 191.75) internal successors, (1534), 8 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:30,615 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:30,616 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:30,616 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 20:58:30,616 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:30,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash -670837734, now seen corresponding path program 1 times [2023-12-05 20:58:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:30,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892321461] [2023-12-05 20:58:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:31,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892321461] [2023-12-05 20:58:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892321461] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:31,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:31,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 20:58:31,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060629057] [2023-12-05 20:58:31,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:31,125 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-05 20:58:31,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-05 20:58:31,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-05 20:58:31,127 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 294 [2023-12-05 20:58:31,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 256 transitions, 1215 flow. Second operand has 12 states, 12 states have (on average 211.33333333333334) internal successors, (2536), 12 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:31,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:31,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 294 [2023-12-05 20:58:31,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:33,361 INFO L124 PetriNetUnfolderBase]: 9203/20707 cut-off events. [2023-12-05 20:58:33,362 INFO L125 PetriNetUnfolderBase]: For 43654/56932 co-relation queries the response was YES. [2023-12-05 20:58:33,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70236 conditions, 20707 events. 9203/20707 cut-off events. For 43654/56932 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 208167 event pairs, 8239 based on Foata normal form. 0/19485 useless extension candidates. Maximal degree in co-relation 68334. Up to 13928 conditions per place. [2023-12-05 20:58:33,539 INFO L140 encePairwiseOnDemand]: 277/294 looper letters, 46 selfloop transitions, 16 changer transitions 0/252 dead transitions. [2023-12-05 20:58:33,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 252 transitions, 1331 flow [2023-12-05 20:58:33,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 20:58:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 20:58:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2571 transitions. [2023-12-05 20:58:33,544 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7287414965986394 [2023-12-05 20:58:33,544 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2571 transitions. [2023-12-05 20:58:33,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2571 transitions. [2023-12-05 20:58:33,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:33,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2571 transitions. [2023-12-05 20:58:33,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 214.25) internal successors, (2571), 12 states have internal predecessors, (2571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:33,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:33,554 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:33,555 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-12-05 20:58:33,556 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 252 transitions, 1331 flow [2023-12-05 20:58:33,556 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 211.33333333333334) internal successors, (2536), 12 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:33,557 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:33,557 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:33,557 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 20:58:33,557 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:33,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:33,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1502147520, now seen corresponding path program 1 times [2023-12-05 20:58:33,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:33,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608804173] [2023-12-05 20:58:33,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:33,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608804173] [2023-12-05 20:58:33,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608804173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:33,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821466364] [2023-12-05 20:58:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:33,749 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:58:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:58:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:58:33,751 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 294 [2023-12-05 20:58:33,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 252 transitions, 1331 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:33,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:33,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 294 [2023-12-05 20:58:33,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:34,891 INFO L124 PetriNetUnfolderBase]: 4139/10279 cut-off events. [2023-12-05 20:58:34,892 INFO L125 PetriNetUnfolderBase]: For 33183/40095 co-relation queries the response was YES. [2023-12-05 20:58:34,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42273 conditions, 10279 events. 4139/10279 cut-off events. For 33183/40095 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 96081 event pairs, 3665 based on Foata normal form. 2352/12021 useless extension candidates. Maximal degree in co-relation 40065. Up to 6624 conditions per place. [2023-12-05 20:58:34,986 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 88 selfloop transitions, 1 changer transitions 0/248 dead transitions. [2023-12-05 20:58:34,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 248 transitions, 1481 flow [2023-12-05 20:58:34,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-12-05 20:58:34,988 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7074829931972789 [2023-12-05 20:58:34,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-12-05 20:58:34,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-12-05 20:58:34,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:34,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-12-05 20:58:34,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:34,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:34,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:34,991 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-12-05 20:58:34,991 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 248 transitions, 1481 flow [2023-12-05 20:58:34,992 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:34,992 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:34,992 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:34,992 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 20:58:34,992 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:34,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1389959763, now seen corresponding path program 1 times [2023-12-05 20:58:34,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:34,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592335823] [2023-12-05 20:58:34,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:34,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:35,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592335823] [2023-12-05 20:58:35,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592335823] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:35,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:35,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:35,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953994470] [2023-12-05 20:58:35,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:35,093 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:35,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:35,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:35,096 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 294 [2023-12-05 20:58:35,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 248 transitions, 1481 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:35,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:35,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 294 [2023-12-05 20:58:35,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:36,286 INFO L124 PetriNetUnfolderBase]: 4064/10048 cut-off events. [2023-12-05 20:58:36,286 INFO L125 PetriNetUnfolderBase]: For 41845/49521 co-relation queries the response was YES. [2023-12-05 20:58:36,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46224 conditions, 10048 events. 4064/10048 cut-off events. For 41845/49521 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 93580 event pairs, 3598 based on Foata normal form. 66/9515 useless extension candidates. Maximal degree in co-relation 44232. Up to 6486 conditions per place. [2023-12-05 20:58:36,353 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 65 selfloop transitions, 1 changer transitions 0/246 dead transitions. [2023-12-05 20:58:36,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 246 transitions, 1597 flow [2023-12-05 20:58:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2023-12-05 20:58:36,356 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2023-12-05 20:58:36,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2023-12-05 20:58:36,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2023-12-05 20:58:36,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:36,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2023-12-05 20:58:36,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:36,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:36,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:36,359 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-12-05 20:58:36,359 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 246 transitions, 1597 flow [2023-12-05 20:58:36,359 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:36,359 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:36,360 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:36,360 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 20:58:36,360 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:36,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:36,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1389959764, now seen corresponding path program 1 times [2023-12-05 20:58:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:36,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783982059] [2023-12-05 20:58:36,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:36,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783982059] [2023-12-05 20:58:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783982059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:36,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:36,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080213117] [2023-12-05 20:58:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:36,405 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:36,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:36,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:36,406 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 294 [2023-12-05 20:58:36,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 246 transitions, 1597 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:36,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:36,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 294 [2023-12-05 20:58:36,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:37,516 INFO L124 PetriNetUnfolderBase]: 3989/9817 cut-off events. [2023-12-05 20:58:37,516 INFO L125 PetriNetUnfolderBase]: For 54101/62638 co-relation queries the response was YES. [2023-12-05 20:58:37,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49879 conditions, 9817 events. 3989/9817 cut-off events. For 54101/62638 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 90965 event pairs, 3531 based on Foata normal form. 66/9295 useless extension candidates. Maximal degree in co-relation 48266. Up to 6348 conditions per place. [2023-12-05 20:58:37,596 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 64 selfloop transitions, 1 changer transitions 0/244 dead transitions. [2023-12-05 20:58:37,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 244 transitions, 1703 flow [2023-12-05 20:58:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2023-12-05 20:58:37,599 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7698412698412699 [2023-12-05 20:58:37,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2023-12-05 20:58:37,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2023-12-05 20:58:37,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:37,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2023-12-05 20:58:37,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:37,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:37,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:37,602 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-12-05 20:58:37,602 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 244 transitions, 1703 flow [2023-12-05 20:58:37,603 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:37,603 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:37,603 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:37,603 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 20:58:37,603 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:37,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:37,603 INFO L85 PathProgramCache]: Analyzing trace with hash -287713448, now seen corresponding path program 1 times [2023-12-05 20:58:37,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:37,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457026924] [2023-12-05 20:58:37,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:37,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:37,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457026924] [2023-12-05 20:58:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457026924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:37,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:37,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:37,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987228370] [2023-12-05 20:58:37,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:37,690 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:37,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:37,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:37,691 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 294 [2023-12-05 20:58:37,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 244 transitions, 1703 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:37,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:37,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 294 [2023-12-05 20:58:37,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:37,979 INFO L124 PetriNetUnfolderBase]: 618/1889 cut-off events. [2023-12-05 20:58:37,979 INFO L125 PetriNetUnfolderBase]: For 13037/13919 co-relation queries the response was YES. [2023-12-05 20:58:37,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10186 conditions, 1889 events. 618/1889 cut-off events. For 13037/13919 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 12541 event pairs, 534 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 8326. Up to 1098 conditions per place. [2023-12-05 20:58:37,991 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 13 selfloop transitions, 3 changer transitions 3/250 dead transitions. [2023-12-05 20:58:37,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 250 transitions, 1839 flow [2023-12-05 20:58:37,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 833 transitions. [2023-12-05 20:58:37,993 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2023-12-05 20:58:37,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 833 transitions. [2023-12-05 20:58:37,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 833 transitions. [2023-12-05 20:58:37,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:37,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 833 transitions. [2023-12-05 20:58:37,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:37,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,006 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-12-05 20:58:38,006 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 250 transitions, 1839 flow [2023-12-05 20:58:38,007 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,007 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:38,007 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:38,007 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 20:58:38,007 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:38,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1576458658, now seen corresponding path program 1 times [2023-12-05 20:58:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:38,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236240493] [2023-12-05 20:58:38,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:38,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:38,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236240493] [2023-12-05 20:58:38,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236240493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:38,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:38,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:38,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575166106] [2023-12-05 20:58:38,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:38,116 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:38,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:38,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:38,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:38,117 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 294 [2023-12-05 20:58:38,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 250 transitions, 1839 flow. Second operand has 8 states, 8 states have (on average 186.5) internal successors, (1492), 8 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:38,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 294 [2023-12-05 20:58:38,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:38,435 INFO L124 PetriNetUnfolderBase]: 563/1713 cut-off events. [2023-12-05 20:58:38,435 INFO L125 PetriNetUnfolderBase]: For 16410/17064 co-relation queries the response was YES. [2023-12-05 20:58:38,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10195 conditions, 1713 events. 563/1713 cut-off events. For 16410/17064 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10918 event pairs, 294 based on Foata normal form. 72/1699 useless extension candidates. Maximal degree in co-relation 8161. Up to 978 conditions per place. [2023-12-05 20:58:38,448 INFO L140 encePairwiseOnDemand]: 277/294 looper letters, 83 selfloop transitions, 9 changer transitions 3/252 dead transitions. [2023-12-05 20:58:38,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 252 transitions, 2129 flow [2023-12-05 20:58:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 20:58:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 20:58:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1744 transitions. [2023-12-05 20:58:38,451 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6591080876795162 [2023-12-05 20:58:38,451 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1744 transitions. [2023-12-05 20:58:38,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1744 transitions. [2023-12-05 20:58:38,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:38,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1744 transitions. [2023-12-05 20:58:38,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.77777777777777) internal successors, (1744), 9 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,458 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,458 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-12-05 20:58:38,458 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 252 transitions, 2129 flow [2023-12-05 20:58:38,459 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 186.5) internal successors, (1492), 8 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,459 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:38,459 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:38,459 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 20:58:38,459 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:38,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:38,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1576458659, now seen corresponding path program 1 times [2023-12-05 20:58:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:38,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460946958] [2023-12-05 20:58:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:38,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460946958] [2023-12-05 20:58:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460946958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:38,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-05 20:58:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783746104] [2023-12-05 20:58:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:38,695 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 20:58:38,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:38,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 20:58:38,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-05 20:58:38,697 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 294 [2023-12-05 20:58:38,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 252 transitions, 2129 flow. Second operand has 10 states, 10 states have (on average 183.1) internal successors, (1831), 10 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:38,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 294 [2023-12-05 20:58:38,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:39,190 INFO L124 PetriNetUnfolderBase]: 493/1580 cut-off events. [2023-12-05 20:58:39,190 INFO L125 PetriNetUnfolderBase]: For 17311/18037 co-relation queries the response was YES. [2023-12-05 20:58:39,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9884 conditions, 1580 events. 493/1580 cut-off events. For 17311/18037 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9856 event pairs, 294 based on Foata normal form. 63/1557 useless extension candidates. Maximal degree in co-relation 7673. Up to 845 conditions per place. [2023-12-05 20:58:39,201 INFO L140 encePairwiseOnDemand]: 273/294 looper letters, 74 selfloop transitions, 14 changer transitions 3/245 dead transitions. [2023-12-05 20:58:39,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 245 transitions, 2225 flow [2023-12-05 20:58:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 20:58:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 20:58:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2252 transitions. [2023-12-05 20:58:39,204 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6383219954648526 [2023-12-05 20:58:39,204 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2252 transitions. [2023-12-05 20:58:39,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2252 transitions. [2023-12-05 20:58:39,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:39,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2252 transitions. [2023-12-05 20:58:39,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 187.66666666666666) internal successors, (2252), 12 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:39,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:39,212 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:39,213 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 19 predicate places. [2023-12-05 20:58:39,213 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 245 transitions, 2225 flow [2023-12-05 20:58:39,213 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 183.1) internal successors, (1831), 10 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:39,213 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:39,213 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:39,213 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 20:58:39,214 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:39,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:39,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1625578810, now seen corresponding path program 1 times [2023-12-05 20:58:39,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:39,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237203598] [2023-12-05 20:58:39,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:39,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:39,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237203598] [2023-12-05 20:58:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237203598] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:39,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-05 20:58:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835954096] [2023-12-05 20:58:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:39,981 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-05 20:58:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:39,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-05 20:58:39,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-05 20:58:39,984 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 294 [2023-12-05 20:58:39,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 245 transitions, 2225 flow. Second operand has 16 states, 16 states have (on average 151.625) internal successors, (2426), 16 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:39,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:39,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 294 [2023-12-05 20:58:39,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:40,638 INFO L124 PetriNetUnfolderBase]: 543/1689 cut-off events. [2023-12-05 20:58:40,638 INFO L125 PetriNetUnfolderBase]: For 21027/21912 co-relation queries the response was YES. [2023-12-05 20:58:40,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11627 conditions, 1689 events. 543/1689 cut-off events. For 21027/21912 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10629 event pairs, 267 based on Foata normal form. 9/1611 useless extension candidates. Maximal degree in co-relation 9207. Up to 917 conditions per place. [2023-12-05 20:58:40,653 INFO L140 encePairwiseOnDemand]: 274/294 looper letters, 112 selfloop transitions, 23 changer transitions 4/270 dead transitions. [2023-12-05 20:58:40,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 270 transitions, 2988 flow [2023-12-05 20:58:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-05 20:58:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-05 20:58:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2508 transitions. [2023-12-05 20:58:40,657 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5331632653061225 [2023-12-05 20:58:40,657 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2508 transitions. [2023-12-05 20:58:40,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2508 transitions. [2023-12-05 20:58:40,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:40,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2508 transitions. [2023-12-05 20:58:40,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 156.75) internal successors, (2508), 16 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 294.0) internal successors, (4998), 17 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,666 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 294.0) internal successors, (4998), 17 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,666 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 34 predicate places. [2023-12-05 20:58:40,666 INFO L500 AbstractCegarLoop]: Abstraction has has 308 places, 270 transitions, 2988 flow [2023-12-05 20:58:40,667 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 151.625) internal successors, (2426), 16 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,667 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:40,667 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:40,667 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 20:58:40,667 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:40,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 680851560, now seen corresponding path program 1 times [2023-12-05 20:58:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:40,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713576450] [2023-12-05 20:58:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:40,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:41,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:41,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713576450] [2023-12-05 20:58:41,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713576450] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:41,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:41,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-05 20:58:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263525134] [2023-12-05 20:58:41,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:41,403 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-05 20:58:41,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-05 20:58:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-05 20:58:41,406 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 294 [2023-12-05 20:58:41,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 270 transitions, 2988 flow. Second operand has 17 states, 17 states have (on average 150.52941176470588) internal successors, (2559), 17 states have internal predecessors, (2559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:41,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 294 [2023-12-05 20:58:41,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:42,419 INFO L124 PetriNetUnfolderBase]: 808/2579 cut-off events. [2023-12-05 20:58:42,419 INFO L125 PetriNetUnfolderBase]: For 37990/38947 co-relation queries the response was YES. [2023-12-05 20:58:42,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18802 conditions, 2579 events. 808/2579 cut-off events. For 37990/38947 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 18074 event pairs, 219 based on Foata normal form. 8/2456 useless extension candidates. Maximal degree in co-relation 14999. Up to 1388 conditions per place. [2023-12-05 20:58:42,437 INFO L140 encePairwiseOnDemand]: 272/294 looper letters, 162 selfloop transitions, 28 changer transitions 4/326 dead transitions. [2023-12-05 20:58:42,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 326 transitions, 4601 flow [2023-12-05 20:58:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-05 20:58:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-12-05 20:58:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2670 transitions. [2023-12-05 20:58:42,441 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5342136854741897 [2023-12-05 20:58:42,441 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2670 transitions. [2023-12-05 20:58:42,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2670 transitions. [2023-12-05 20:58:42,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:42,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2670 transitions. [2023-12-05 20:58:42,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 157.05882352941177) internal successors, (2670), 17 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 294.0) internal successors, (5292), 18 states have internal predecessors, (5292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,450 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 294.0) internal successors, (5292), 18 states have internal predecessors, (5292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,450 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 50 predicate places. [2023-12-05 20:58:42,450 INFO L500 AbstractCegarLoop]: Abstraction has has 324 places, 326 transitions, 4601 flow [2023-12-05 20:58:42,451 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 150.52941176470588) internal successors, (2559), 17 states have internal predecessors, (2559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,451 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:42,451 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:42,451 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 20:58:42,451 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:42,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash -572052909, now seen corresponding path program 1 times [2023-12-05 20:58:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:42,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980240867] [2023-12-05 20:58:42,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:42,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980240867] [2023-12-05 20:58:42,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980240867] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:42,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:42,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:42,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704705321] [2023-12-05 20:58:42,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:42,484 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:42,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:42,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:42,485 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 294 [2023-12-05 20:58:42,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 326 transitions, 4601 flow. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:42,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 294 [2023-12-05 20:58:42,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:42,732 INFO L124 PetriNetUnfolderBase]: 702/2152 cut-off events. [2023-12-05 20:58:42,732 INFO L125 PetriNetUnfolderBase]: For 37623/37935 co-relation queries the response was YES. [2023-12-05 20:58:42,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16553 conditions, 2152 events. 702/2152 cut-off events. For 37623/37935 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 13272 event pairs, 166 based on Foata normal form. 4/2073 useless extension candidates. Maximal degree in co-relation 13846. Up to 1178 conditions per place. [2023-12-05 20:58:42,750 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 56 selfloop transitions, 2 changer transitions 5/317 dead transitions. [2023-12-05 20:58:42,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 317 transitions, 4547 flow [2023-12-05 20:58:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-12-05 20:58:42,751 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9421768707482994 [2023-12-05 20:58:42,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-12-05 20:58:42,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-12-05 20:58:42,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:42,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-12-05 20:58:42,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,753 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 52 predicate places. [2023-12-05 20:58:42,754 INFO L500 AbstractCegarLoop]: Abstraction has has 326 places, 317 transitions, 4547 flow [2023-12-05 20:58:42,754 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,754 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:42,754 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:42,754 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 20:58:42,754 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:42,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash 345468283, now seen corresponding path program 1 times [2023-12-05 20:58:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:42,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531664019] [2023-12-05 20:58:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:42,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-12-05 20:58:42,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:42,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531664019] [2023-12-05 20:58:42,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531664019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:42,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:42,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:42,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540149034] [2023-12-05 20:58:42,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:42,898 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:42,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:42,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:42,899 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 294 [2023-12-05 20:58:42,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 317 transitions, 4547 flow. Second operand has 7 states, 7 states have (on average 203.71428571428572) internal successors, (1426), 7 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:42,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 294 [2023-12-05 20:58:42,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:43,238 INFO L124 PetriNetUnfolderBase]: 678/2106 cut-off events. [2023-12-05 20:58:43,238 INFO L125 PetriNetUnfolderBase]: For 43453/43765 co-relation queries the response was YES. [2023-12-05 20:58:43,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17012 conditions, 2106 events. 678/2106 cut-off events. For 43453/43765 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12863 event pairs, 162 based on Foata normal form. 22/2045 useless extension candidates. Maximal degree in co-relation 14189. Up to 1132 conditions per place. [2023-12-05 20:58:43,255 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 127 selfloop transitions, 2 changer transitions 5/315 dead transitions. [2023-12-05 20:58:43,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 315 transitions, 4779 flow [2023-12-05 20:58:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 20:58:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 20:58:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 861 transitions. [2023-12-05 20:58:43,257 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-12-05 20:58:43,257 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 861 transitions. [2023-12-05 20:58:43,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 861 transitions. [2023-12-05 20:58:43,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:43,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 861 transitions. [2023-12-05 20:58:43,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 215.25) internal successors, (861), 4 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:43,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:43,259 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:43,259 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 53 predicate places. [2023-12-05 20:58:43,260 INFO L500 AbstractCegarLoop]: Abstraction has has 327 places, 315 transitions, 4779 flow [2023-12-05 20:58:43,260 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 203.71428571428572) internal successors, (1426), 7 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:43,260 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:43,260 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:43,260 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 20:58:43,260 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:43,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:43,260 INFO L85 PathProgramCache]: Analyzing trace with hash 345468284, now seen corresponding path program 1 times [2023-12-05 20:58:43,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:43,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174875131] [2023-12-05 20:58:43,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:43,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:43,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:43,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174875131] [2023-12-05 20:58:43,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174875131] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:43,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:43,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-05 20:58:43,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694844626] [2023-12-05 20:58:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:43,832 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-05 20:58:43,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:43,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-05 20:58:43,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-12-05 20:58:43,834 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 294 [2023-12-05 20:58:43,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 315 transitions, 4779 flow. Second operand has 18 states, 18 states have (on average 161.83333333333334) internal successors, (2913), 18 states have internal predecessors, (2913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:43,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:43,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 294 [2023-12-05 20:58:43,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:44,670 INFO L124 PetriNetUnfolderBase]: 754/2241 cut-off events. [2023-12-05 20:58:44,670 INFO L125 PetriNetUnfolderBase]: For 57238/57589 co-relation queries the response was YES. [2023-12-05 20:58:44,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19586 conditions, 2241 events. 754/2241 cut-off events. For 57238/57589 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 13641 event pairs, 164 based on Foata normal form. 2/2161 useless extension candidates. Maximal degree in co-relation 16579. Up to 1223 conditions per place. [2023-12-05 20:58:44,689 INFO L140 encePairwiseOnDemand]: 269/294 looper letters, 156 selfloop transitions, 33 changer transitions 5/338 dead transitions. [2023-12-05 20:58:44,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 338 transitions, 5775 flow [2023-12-05 20:58:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-05 20:58:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-05 20:58:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3145 transitions. [2023-12-05 20:58:44,693 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5630146795560329 [2023-12-05 20:58:44,693 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3145 transitions. [2023-12-05 20:58:44,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3145 transitions. [2023-12-05 20:58:44,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:44,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3145 transitions. [2023-12-05 20:58:44,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 165.52631578947367) internal successors, (3145), 19 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:44,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 294.0) internal successors, (5880), 20 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:44,715 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 294.0) internal successors, (5880), 20 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:44,715 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 71 predicate places. [2023-12-05 20:58:44,715 INFO L500 AbstractCegarLoop]: Abstraction has has 345 places, 338 transitions, 5775 flow [2023-12-05 20:58:44,716 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 161.83333333333334) internal successors, (2913), 18 states have internal predecessors, (2913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:44,716 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:44,716 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:44,716 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 20:58:44,716 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:44,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1161989109, now seen corresponding path program 1 times [2023-12-05 20:58:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265127141] [2023-12-05 20:58:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:44,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:44,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265127141] [2023-12-05 20:58:44,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265127141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:44,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:44,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:44,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050879213] [2023-12-05 20:58:44,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:44,937 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:44,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:44,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:44,939 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 294 [2023-12-05 20:58:44,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 338 transitions, 5775 flow. Second operand has 8 states, 8 states have (on average 172.75) internal successors, (1382), 8 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:44,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:44,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 294 [2023-12-05 20:58:44,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:45,431 INFO L124 PetriNetUnfolderBase]: 823/2405 cut-off events. [2023-12-05 20:58:45,432 INFO L125 PetriNetUnfolderBase]: For 72145/72353 co-relation queries the response was YES. [2023-12-05 20:58:45,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22298 conditions, 2405 events. 823/2405 cut-off events. For 72145/72353 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 14580 event pairs, 166 based on Foata normal form. 9/2339 useless extension candidates. Maximal degree in co-relation 19108. Up to 1311 conditions per place. [2023-12-05 20:58:45,456 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 169 selfloop transitions, 6 changer transitions 6/346 dead transitions. [2023-12-05 20:58:45,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 346 transitions, 6387 flow [2023-12-05 20:58:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 20:58:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 20:58:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1277 transitions. [2023-12-05 20:58:45,465 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6205053449951409 [2023-12-05 20:58:45,465 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1277 transitions. [2023-12-05 20:58:45,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1277 transitions. [2023-12-05 20:58:45,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:45,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1277 transitions. [2023-12-05 20:58:45,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.42857142857142) internal successors, (1277), 7 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:45,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:45,468 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:45,469 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 77 predicate places. [2023-12-05 20:58:45,469 INFO L500 AbstractCegarLoop]: Abstraction has has 351 places, 346 transitions, 6387 flow [2023-12-05 20:58:45,469 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 172.75) internal successors, (1382), 8 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:45,469 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:45,469 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-05 20:58:45,470 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 20:58:45,470 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:45,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:45,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1921399839, now seen corresponding path program 1 times [2023-12-05 20:58:45,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:45,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752974377] [2023-12-05 20:58:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:48,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:48,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752974377] [2023-12-05 20:58:48,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752974377] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 20:58:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088145138] [2023-12-05 20:58:48,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:48,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 20:58:48,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:58:48,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 20:58:48,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-05 20:58:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:48,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-05 20:58:48,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 20:58:48,707 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 20:58:48,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-05 20:58:48,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-05 20:58:48,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 20:58:49,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 20:58:49,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 20:58:49,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 20:58:49,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-05 20:58:50,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 20:58:50,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 20:58:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:50,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 20:58:50,607 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_346 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_346 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-05 20:58:50,655 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_346 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_346 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-05 20:58:50,665 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_346 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_346 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-12-05 20:58:50,676 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_346 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_346 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-12-05 20:58:50,723 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_343 Int) (v_ArrVal_346 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_343) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_343 Int) (v_ArrVal_346 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_343) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2023-12-05 20:58:50,757 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_343 Int) (v_ArrVal_341 Int) (v_ArrVal_346 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse0 .cse1 v_ArrVal_343) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse5) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_343 Int) (v_ArrVal_341 Int) (v_ArrVal_346 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse6 .cse1 v_ArrVal_343) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_346) |c_~#queue~0.base|) .cse5) 4)))))) is different from false [2023-12-05 20:59:12,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:12,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 276 [2023-12-05 20:59:32,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:32,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 103 [2023-12-05 20:59:32,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 112 [2023-12-05 20:59:32,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:32,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 69 [2023-12-05 20:59:32,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2023-12-05 20:59:32,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2023-12-05 20:59:32,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:32,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 101 [2023-12-05 20:59:32,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 20:59:32,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 20:59:32,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-12-05 20:59:32,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 20:59:32,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2023-12-05 20:59:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-05 20:59:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088145138] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 20:59:33,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 20:59:33,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 22] total 66 [2023-12-05 20:59:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269834860] [2023-12-05 20:59:33,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 20:59:33,485 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-12-05 20:59:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-12-05 20:59:33,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=3301, Unknown=56, NotChecked=738, Total=4422 [2023-12-05 20:59:33,490 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 294 [2023-12-05 20:59:33,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 346 transitions, 6387 flow. Second operand has 67 states, 67 states have (on average 147.34328358208955) internal successors, (9872), 67 states have internal predecessors, (9872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:33,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:33,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 294 [2023-12-05 20:59:33,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:43,907 INFO L124 PetriNetUnfolderBase]: 1710/4871 cut-off events. [2023-12-05 20:59:43,908 INFO L125 PetriNetUnfolderBase]: For 171490/172316 co-relation queries the response was YES. [2023-12-05 20:59:43,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47748 conditions, 4871 events. 1710/4871 cut-off events. For 171490/172316 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 35354 event pairs, 344 based on Foata normal form. 32/4734 useless extension candidates. Maximal degree in co-relation 40955. Up to 2690 conditions per place. [2023-12-05 20:59:43,960 INFO L140 encePairwiseOnDemand]: 258/294 looper letters, 323 selfloop transitions, 95 changer transitions 10/562 dead transitions. [2023-12-05 20:59:43,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 562 transitions, 13623 flow [2023-12-05 20:59:43,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-05 20:59:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-12-05 20:59:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 6826 transitions. [2023-12-05 20:59:43,966 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5159486016628874 [2023-12-05 20:59:43,966 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 6826 transitions. [2023-12-05 20:59:43,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 6826 transitions. [2023-12-05 20:59:43,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:43,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 6826 transitions. [2023-12-05 20:59:43,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 151.6888888888889) internal successors, (6826), 45 states have internal predecessors, (6826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:43,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 294.0) internal successors, (13524), 46 states have internal predecessors, (13524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:43,985 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 294.0) internal successors, (13524), 46 states have internal predecessors, (13524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:43,986 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 121 predicate places. [2023-12-05 20:59:43,986 INFO L500 AbstractCegarLoop]: Abstraction has has 395 places, 562 transitions, 13623 flow [2023-12-05 20:59:43,987 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 147.34328358208955) internal successors, (9872), 67 states have internal predecessors, (9872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:43,987 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:43,988 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-05 20:59:43,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-05 20:59:44,196 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-05 20:59:44,196 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:59:44,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:44,198 INFO L85 PathProgramCache]: Analyzing trace with hash -68706586, now seen corresponding path program 1 times [2023-12-05 20:59:44,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:44,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923559593] [2023-12-05 20:59:44,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:44,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:47,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:47,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923559593] [2023-12-05 20:59:47,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923559593] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:47,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:47,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-05 20:59:47,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755146704] [2023-12-05 20:59:47,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:47,185 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-05 20:59:47,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:47,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-05 20:59:47,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-05 20:59:47,187 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-12-05 20:59:47,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 562 transitions, 13623 flow. Second operand has 19 states, 19 states have (on average 147.05263157894737) internal successors, (2794), 19 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:47,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:47,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-12-05 20:59:47,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:51,377 INFO L124 PetriNetUnfolderBase]: 1858/5221 cut-off events. [2023-12-05 20:59:51,377 INFO L125 PetriNetUnfolderBase]: For 202177/203180 co-relation queries the response was YES. [2023-12-05 20:59:51,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55227 conditions, 5221 events. 1858/5221 cut-off events. For 202177/203180 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 38119 event pairs, 349 based on Foata normal form. 0/5053 useless extension candidates. Maximal degree in co-relation 48030. Up to 2934 conditions per place. [2023-12-05 20:59:51,442 INFO L140 encePairwiseOnDemand]: 270/294 looper letters, 440 selfloop transitions, 47 changer transitions 10/640 dead transitions. [2023-12-05 20:59:51,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 640 transitions, 17316 flow [2023-12-05 20:59:51,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-05 20:59:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-12-05 20:59:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3352 transitions. [2023-12-05 20:59:51,445 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.518243661100804 [2023-12-05 20:59:51,445 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3352 transitions. [2023-12-05 20:59:51,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3352 transitions. [2023-12-05 20:59:51,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:51,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3352 transitions. [2023-12-05 20:59:51,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 152.36363636363637) internal successors, (3352), 22 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:51,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 294.0) internal successors, (6762), 23 states have internal predecessors, (6762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:51,453 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 294.0) internal successors, (6762), 23 states have internal predecessors, (6762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:51,457 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 142 predicate places. [2023-12-05 20:59:51,457 INFO L500 AbstractCegarLoop]: Abstraction has has 416 places, 640 transitions, 17316 flow [2023-12-05 20:59:51,457 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 147.05263157894737) internal successors, (2794), 19 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:51,457 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:51,457 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-05 20:59:51,458 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-05 20:59:51,472 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:59:51,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:51,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1741720656, now seen corresponding path program 2 times [2023-12-05 20:59:51,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:51,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835014640] [2023-12-05 20:59:51,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:51,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:52,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:52,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835014640] [2023-12-05 20:59:52,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835014640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:52,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:52,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-05 20:59:52,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189472969] [2023-12-05 20:59:52,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:52,336 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-05 20:59:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:52,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-05 20:59:52,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-12-05 20:59:52,338 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-12-05 20:59:52,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 640 transitions, 17316 flow. Second operand has 19 states, 19 states have (on average 147.05263157894737) internal successors, (2794), 19 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:52,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:52,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-12-05 20:59:52,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:54,796 INFO L124 PetriNetUnfolderBase]: 1978/5483 cut-off events. [2023-12-05 20:59:54,796 INFO L125 PetriNetUnfolderBase]: For 237211/238279 co-relation queries the response was YES. [2023-12-05 20:59:54,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62120 conditions, 5483 events. 1978/5483 cut-off events. For 237211/238279 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 40261 event pairs, 352 based on Foata normal form. 10/5325 useless extension candidates. Maximal degree in co-relation 54519. Up to 3117 conditions per place. [2023-12-05 20:59:54,858 INFO L140 encePairwiseOnDemand]: 268/294 looper letters, 474 selfloop transitions, 58 changer transitions 10/685 dead transitions. [2023-12-05 20:59:54,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 685 transitions, 19996 flow [2023-12-05 20:59:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-05 20:59:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-12-05 20:59:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3190 transitions. [2023-12-05 20:59:54,861 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5166828636216392 [2023-12-05 20:59:54,861 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3190 transitions. [2023-12-05 20:59:54,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3190 transitions. [2023-12-05 20:59:54,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:54,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3190 transitions. [2023-12-05 20:59:54,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 151.9047619047619) internal successors, (3190), 21 states have internal predecessors, (3190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:54,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 294.0) internal successors, (6468), 22 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:54,867 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 294.0) internal successors, (6468), 22 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:54,867 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 162 predicate places. [2023-12-05 20:59:54,868 INFO L500 AbstractCegarLoop]: Abstraction has has 436 places, 685 transitions, 19996 flow [2023-12-05 20:59:54,868 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 147.05263157894737) internal successors, (2794), 19 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:54,868 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:54,868 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-05 20:59:54,868 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-05 20:59:54,868 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:59:54,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:54,869 INFO L85 PathProgramCache]: Analyzing trace with hash 666733894, now seen corresponding path program 3 times [2023-12-05 20:59:54,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:54,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160222338] [2023-12-05 20:59:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:54,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:55,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160222338] [2023-12-05 20:59:55,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160222338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:55,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:55,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-05 20:59:55,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948237885] [2023-12-05 20:59:55,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:55,651 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-05 20:59:55,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-05 20:59:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-12-05 20:59:55,652 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-12-05 20:59:55,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 685 transitions, 19996 flow. Second operand has 19 states, 19 states have (on average 147.05263157894737) internal successors, (2794), 19 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:55,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:55,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-12-05 20:59:55,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:58,154 INFO L124 PetriNetUnfolderBase]: 1946/5411 cut-off events. [2023-12-05 20:59:58,154 INFO L125 PetriNetUnfolderBase]: For 251213/252305 co-relation queries the response was YES. [2023-12-05 20:59:58,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64628 conditions, 5411 events. 1946/5411 cut-off events. For 251213/252305 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 40086 event pairs, 353 based on Foata normal form. 10/5260 useless extension candidates. Maximal degree in co-relation 56623. Up to 3077 conditions per place. [2023-12-05 20:59:58,214 INFO L140 encePairwiseOnDemand]: 271/294 looper letters, 482 selfloop transitions, 51 changer transitions 10/686 dead transitions. [2023-12-05 20:59:58,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 686 transitions, 21060 flow [2023-12-05 20:59:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-05 20:59:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-12-05 20:59:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3032 transitions. [2023-12-05 20:59:58,217 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5156462585034014 [2023-12-05 20:59:58,217 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3032 transitions. [2023-12-05 20:59:58,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3032 transitions. [2023-12-05 20:59:58,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:58,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3032 transitions. [2023-12-05 20:59:58,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 151.6) internal successors, (3032), 20 states have internal predecessors, (3032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:58,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 294.0) internal successors, (6174), 21 states have internal predecessors, (6174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:58,224 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 294.0) internal successors, (6174), 21 states have internal predecessors, (6174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:58,224 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 181 predicate places. [2023-12-05 20:59:58,224 INFO L500 AbstractCegarLoop]: Abstraction has has 455 places, 686 transitions, 21060 flow [2023-12-05 20:59:58,225 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 147.05263157894737) internal successors, (2794), 19 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:58,225 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:58,225 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-05 20:59:58,225 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-05 20:59:58,225 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:59:58,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1198348365, now seen corresponding path program 1 times [2023-12-05 20:59:58,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:58,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237505847] [2023-12-05 20:59:58,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:59,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:59,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237505847] [2023-12-05 20:59:59,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237505847] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 20:59:59,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588094408] [2023-12-05 20:59:59,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:59,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 20:59:59,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:59:59,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 20:59:59,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-05 21:00:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:00,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-05 21:00:00,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:00:00,165 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-05 21:00:00,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-05 21:00:00,207 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:00:00,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-05 21:00:00,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-05 21:00:00,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 21:00:00,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 21:00:01,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 21:00:01,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 21:00:01,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 21:00:01,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-05 21:00:01,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:00:01,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 21:00:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:01,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:00:02,152 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_498 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_498 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-05 21:00:02,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_498 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_498 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-12-05 21:00:02,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_498 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_498 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-12-05 21:00:03,481 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_492 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_492))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|) (forall ((v_ArrVal_495 Int) (v_ArrVal_494 Int) (v_ArrVal_498 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 .cse5 v_ArrVal_494))) (store (store .cse3 .cse4 v_ArrVal_495) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse5 0))))) (forall ((v_ArrVal_492 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_492))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|) (< .cse7 0) (forall ((v_ArrVal_495 Int) (v_ArrVal_494 Int) (v_ArrVal_498 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse6 .cse7 v_ArrVal_494))) (store (store .cse9 .cse4 v_ArrVal_495) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|) .cse1) 4)))))))))) is different from false [2023-12-05 21:00:03,698 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_492))) (let ((.cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))) (.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_495 Int) (v_ArrVal_494 Int) (v_ArrVal_498 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_494))) (store (store .cse1 .cse2 v_ArrVal_495) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse5 0) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))))) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_492))) (let ((.cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))) (.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_495 Int) (v_ArrVal_494 Int) (v_ArrVal_498 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 .cse9 v_ArrVal_494))) (store (store .cse7 .cse2 v_ArrVal_495) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse9 0) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))))))) is different from false [2023-12-05 21:00:04,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:04,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 280 treesize of output 284 [2023-12-05 21:00:04,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:04,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 108 [2023-12-05 21:00:04,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:04,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 267 [2023-12-05 21:00:04,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2023-12-05 21:00:04,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 181 [2023-12-05 21:00:04,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 248 [2023-12-05 21:00:04,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-05 21:00:04,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:04,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 143 [2023-12-05 21:00:05,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:05,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2023-12-05 21:00:05,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2023-12-05 21:00:05,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2023-12-05 21:00:05,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-12-05 21:00:05,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:05,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 109 [2023-12-05 21:00:05,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 557 treesize of output 547 [2023-12-05 21:00:05,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:05,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 151 [2023-12-05 21:00:05,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 194 [2023-12-05 21:00:05,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 135 [2023-12-05 21:00:05,467 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 21:00:05,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 95 [2023-12-05 21:00:06,279 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-12-05 21:00:06,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2023-12-05 21:00:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:06,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588094408] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:00:06,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:00:06,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 69 [2023-12-05 21:00:06,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176221341] [2023-12-05 21:00:06,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:00:06,344 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-12-05 21:00:06,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:06,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-12-05 21:00:06,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=3748, Unknown=33, NotChecked=650, Total=4830 [2023-12-05 21:00:06,348 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-12-05 21:00:06,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 686 transitions, 21060 flow. Second operand has 70 states, 70 states have (on average 146.27142857142857) internal successors, (10239), 70 states have internal predecessors, (10239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:06,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:06,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-12-05 21:00:06,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:15,223 INFO L124 PetriNetUnfolderBase]: 2755/7784 cut-off events. [2023-12-05 21:00:15,223 INFO L125 PetriNetUnfolderBase]: For 387426/389755 co-relation queries the response was YES. [2023-12-05 21:00:15,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95904 conditions, 7784 events. 2755/7784 cut-off events. For 387426/389755 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 63727 event pairs, 486 based on Foata normal form. 32/7552 useless extension candidates. Maximal degree in co-relation 83266. Up to 4390 conditions per place. [2023-12-05 21:00:15,325 INFO L140 encePairwiseOnDemand]: 260/294 looper letters, 637 selfloop transitions, 119 changer transitions 14/913 dead transitions. [2023-12-05 21:00:15,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 913 transitions, 31262 flow [2023-12-05 21:00:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-05 21:00:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-12-05 21:00:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 5645 transitions. [2023-12-05 21:00:15,364 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5189373046515904 [2023-12-05 21:00:15,364 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 5645 transitions. [2023-12-05 21:00:15,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 5645 transitions. [2023-12-05 21:00:15,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:15,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 5645 transitions. [2023-12-05 21:00:15,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 152.56756756756758) internal successors, (5645), 37 states have internal predecessors, (5645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:15,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 294.0) internal successors, (11172), 38 states have internal predecessors, (11172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:15,384 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 294.0) internal successors, (11172), 38 states have internal predecessors, (11172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:15,400 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 217 predicate places. [2023-12-05 21:00:15,400 INFO L500 AbstractCegarLoop]: Abstraction has has 491 places, 913 transitions, 31262 flow [2023-12-05 21:00:15,401 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 146.27142857142857) internal successors, (10239), 70 states have internal predecessors, (10239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:15,401 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:15,401 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:15,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:00:15,606 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-05 21:00:15,607 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 21:00:15,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:15,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1083914877, now seen corresponding path program 1 times [2023-12-05 21:00:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:15,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952812349] [2023-12-05 21:00:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:15,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:15,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952812349] [2023-12-05 21:00:15,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952812349] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:00:15,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132103551] [2023-12-05 21:00:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:15,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:00:15,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:00:15,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:00:15,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-05 21:00:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:15,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-05 21:00:15,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:00:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:15,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:00:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:15,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132103551] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:00:15,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:00:15,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:00:15,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057338234] [2023-12-05 21:00:15,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:00:15,976 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 21:00:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:15,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 21:00:15,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-05 21:00:15,978 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 294 [2023-12-05 21:00:15,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 913 transitions, 31262 flow. Second operand has 10 states, 10 states have (on average 270.4) internal successors, (2704), 10 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:15,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:15,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 294 [2023-12-05 21:00:15,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:19,286 INFO L124 PetriNetUnfolderBase]: 3572/9763 cut-off events. [2023-12-05 21:00:19,286 INFO L125 PetriNetUnfolderBase]: For 555154/558312 co-relation queries the response was YES. [2023-12-05 21:00:19,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125027 conditions, 9763 events. 3572/9763 cut-off events. For 555154/558312 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 78072 event pairs, 559 based on Foata normal form. 2/9475 useless extension candidates. Maximal degree in co-relation 112307. Up to 5599 conditions per place. [2023-12-05 21:00:19,414 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 500 selfloop transitions, 9 changer transitions 14/1089 dead transitions. [2023-12-05 21:00:19,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 1089 transitions, 40230 flow [2023-12-05 21:00:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:00:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:00:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2463 transitions. [2023-12-05 21:00:19,416 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9308390022675737 [2023-12-05 21:00:19,416 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2463 transitions. [2023-12-05 21:00:19,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2463 transitions. [2023-12-05 21:00:19,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:19,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2463 transitions. [2023-12-05 21:00:19,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 273.6666666666667) internal successors, (2463), 9 states have internal predecessors, (2463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:19,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:19,435 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:19,436 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 225 predicate places. [2023-12-05 21:00:19,436 INFO L500 AbstractCegarLoop]: Abstraction has has 499 places, 1089 transitions, 40230 flow [2023-12-05 21:00:19,436 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 270.4) internal successors, (2704), 10 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:19,436 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:19,436 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-05 21:00:19,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-05 21:00:19,642 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:00:19,643 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 21:00:19,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1314089673, now seen corresponding path program 1 times [2023-12-05 21:00:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:19,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711930996] [2023-12-05 21:00:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:19,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711930996] [2023-12-05 21:00:19,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711930996] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:00:19,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932878878] [2023-12-05 21:00:19,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:19,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:00:19,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:00:19,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:00:19,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-05 21:00:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:20,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-05 21:00:20,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:00:20,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:00:20,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:00:20,121 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-05 21:00:20,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-05 21:00:20,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:00:20,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:00:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:20,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:00:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932878878] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:00:21,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:00:21,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2023-12-05 21:00:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580691153] [2023-12-05 21:00:21,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:00:21,469 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-05 21:00:21,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-05 21:00:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-12-05 21:00:21,471 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 294 [2023-12-05 21:00:21,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 1089 transitions, 40230 flow. Second operand has 22 states, 22 states have (on average 173.22727272727272) internal successors, (3811), 22 states have internal predecessors, (3811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:21,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:21,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 294 [2023-12-05 21:00:21,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:26,631 INFO L124 PetriNetUnfolderBase]: 4476/11972 cut-off events. [2023-12-05 21:00:26,631 INFO L125 PetriNetUnfolderBase]: For 762846/766471 co-relation queries the response was YES. [2023-12-05 21:00:26,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162658 conditions, 11972 events. 4476/11972 cut-off events. For 762846/766471 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 101401 event pairs, 575 based on Foata normal form. 80/11738 useless extension candidates. Maximal degree in co-relation 149382. Up to 7044 conditions per place. [2023-12-05 21:00:26,799 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 1126 selfloop transitions, 16 changer transitions 14/1394 dead transitions. [2023-12-05 21:00:26,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 1394 transitions, 56235 flow [2023-12-05 21:00:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 21:00:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 21:00:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2166 transitions. [2023-12-05 21:00:26,802 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6139455782312925 [2023-12-05 21:00:26,802 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2166 transitions. [2023-12-05 21:00:26,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2166 transitions. [2023-12-05 21:00:26,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:26,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2166 transitions. [2023-12-05 21:00:26,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 180.5) internal successors, (2166), 12 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-12-05 21:00:26,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:26,812 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:26,812 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 236 predicate places. [2023-12-05 21:00:26,812 INFO L500 AbstractCegarLoop]: Abstraction has has 510 places, 1394 transitions, 56235 flow [2023-12-05 21:00:26,813 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 173.22727272727272) internal successors, (3811), 22 states have internal predecessors, (3811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:26,813 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:26,813 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-05 21:00:26,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-05 21:00:27,018 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:00:27,018 INFO L425 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 21:00:27,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -576271438, now seen corresponding path program 2 times [2023-12-05 21:00:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:27,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279081447] [2023-12-05 21:00:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:29,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:29,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279081447] [2023-12-05 21:00:29,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279081447] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:00:29,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793320392] [2023-12-05 21:00:29,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-05 21:00:29,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:00:29,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:00:29,058 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:00:29,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-05 21:00:29,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-05 21:00:29,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:00:29,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 84 conjunts are in the unsatisfiable core [2023-12-05 21:00:29,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:00:29,350 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 21:00:29,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-05 21:00:29,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-05 21:00:29,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 21:00:29,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 21:00:29,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:00:29,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-05 21:00:30,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 21:00:30,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-12-05 21:00:30,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:00:30,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 21:00:30,623 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-05 21:00:30,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2023-12-05 21:00:30,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-05 21:00:30,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-05 21:00:30,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-05 21:00:31,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:00:31,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-05 21:00:31,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-05 21:00:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:31,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:00:31,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-12-05 21:00:31,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:31,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-12-05 21:00:31,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:31,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2023-12-05 21:00:31,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-05 21:00:31,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:31,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-05 21:00:31,597 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 21:00:31,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:00:31,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-05 21:01:17,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:01:17,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 117 [2023-12-05 21:01:17,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:01:17,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:01:17,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 145 [2023-12-05 21:01:17,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-12-05 21:01:17,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2023-12-05 21:01:17,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-05 21:01:17,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:01:17,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2023-12-05 21:01:17,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:01:17,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 252 treesize of output 167 [2023-12-05 21:01:17,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 21:01:17,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:01:17,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 218 [2023-12-05 21:01:17,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2023-12-05 21:01:17,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-05 21:01:17,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:01:17,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 104 [2023-12-05 21:01:17,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:01:17,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 247 treesize of output 162 [2023-12-05 21:01:17,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 21:01:17,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:01:17,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 208 [2023-12-05 21:01:17,629 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 21:01:17,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2023-12-05 21:01:17,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-05 21:01:17,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:01:17,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 94 [2023-12-05 21:01:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 44 refuted. 9 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:01:18,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793320392] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:01:18,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:01:18,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 32] total 88 [2023-12-05 21:01:18,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659615951] [2023-12-05 21:01:18,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:01:18,554 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2023-12-05 21:01:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:01:18,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2023-12-05 21:01:18,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=7090, Unknown=97, NotChecked=0, Total=7832 [2023-12-05 21:01:18,563 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 294 [2023-12-05 21:01:18,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 1394 transitions, 56235 flow. Second operand has 89 states, 89 states have (on average 143.4943820224719) internal successors, (12771), 89 states have internal predecessors, (12771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:01:18,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:01:18,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 294 [2023-12-05 21:01:18,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:01:57,068 INFO L124 PetriNetUnfolderBase]: 7272/19673 cut-off events. [2023-12-05 21:01:57,068 INFO L125 PetriNetUnfolderBase]: For 1295649/1302217 co-relation queries the response was YES. [2023-12-05 21:01:57,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274218 conditions, 19673 events. 7272/19673 cut-off events. For 1295649/1302217 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 186683 event pairs, 967 based on Foata normal form. 160/19290 useless extension candidates. Maximal degree in co-relation 248650. Up to 11373 conditions per place. [2023-12-05 21:01:57,369 INFO L140 encePairwiseOnDemand]: 258/294 looper letters, 1873 selfloop transitions, 293 changer transitions 24/2323 dead transitions. [2023-12-05 21:01:57,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 2323 transitions, 101933 flow [2023-12-05 21:01:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-12-05 21:01:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-12-05 21:01:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 10858 transitions. [2023-12-05 21:01:57,392 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5059174354673376 [2023-12-05 21:01:57,393 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 10858 transitions. [2023-12-05 21:01:57,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 10858 transitions. [2023-12-05 21:01:57,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:01:57,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 10858 transitions. [2023-12-05 21:01:57,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 148.73972602739727) internal successors, (10858), 73 states have internal predecessors, (10858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:01:57,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 294.0) internal successors, (21756), 74 states have internal predecessors, (21756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:01:57,415 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 294.0) internal successors, (21756), 74 states have internal predecessors, (21756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:01:57,416 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 308 predicate places. [2023-12-05 21:01:57,416 INFO L500 AbstractCegarLoop]: Abstraction has has 582 places, 2323 transitions, 101933 flow [2023-12-05 21:01:57,418 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 143.4943820224719) internal successors, (12771), 89 states have internal predecessors, (12771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:01:57,418 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:01:57,418 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-05 21:01:57,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-05 21:01:57,623 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-05 21:01:57,623 INFO L425 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 21:01:57,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:01:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash 743015464, now seen corresponding path program 3 times [2023-12-05 21:01:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:01:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339080090] [2023-12-05 21:01:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:01:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:01:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:01:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:01:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:01:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339080090] [2023-12-05 21:01:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339080090] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:01:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921987452] [2023-12-05 21:01:59,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-05 21:01:59,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:01:59,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:01:59,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:01:59,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-05 21:02:00,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-05 21:02:00,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:02:00,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 93 conjunts are in the unsatisfiable core [2023-12-05 21:02:00,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:02:00,244 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-05 21:02:00,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-05 21:02:00,299 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-05 21:02:00,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-05 21:02:00,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-05 21:02:00,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 21:02:01,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 21:02:01,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 21:02:01,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 21:02:01,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-05 21:02:01,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:02:01,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 21:02:02,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 21:02:02,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-05 21:02:02,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-05 21:02:02,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:02:02,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 21:02:02,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-05 21:02:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:02:02,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:02:03,019 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (and (forall ((v_ArrVal_803 (Array Int Int))) (<= 0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) .cse0) 4)))) (forall ((v_ArrVal_803 (Array Int Int))) (<= (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) .cse0) 4) 4) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))))) is different from false [2023-12-05 21:02:03,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_803 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_803 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-05 21:02:03,077 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_802) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_802) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-05 21:02:03,138 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_802) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_802) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-05 21:02:03,161 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_802) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_802) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-05 21:02:03,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_802) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_802) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-05 21:02:15,203 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_800 Int) (v_ArrVal_798 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_798))) (store (store .cse0 .cse1 v_ArrVal_800) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_802) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_800 Int) (v_ArrVal_798 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_798))) (store (store .cse6 .cse1 v_ArrVal_800) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_802) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_803) |c_~#queue~0.base|) .cse5) 4))))))) is different from false Received shutdown request... [2023-12-05 21:02:35,841 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-12-05 21:02:35,841 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-05 21:02:36,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 100 remaining) [2023-12-05 21:02:36,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-05 21:02:36,751 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-05 21:02:36,751 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 100 remaining) [2023-12-05 21:02:36,753 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (79 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 100 remaining) [2023-12-05 21:02:36,754 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 100 remaining) [2023-12-05 21:02:36,755 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 100 remaining) [2023-12-05 21:02:36,756 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 100 remaining) [2023-12-05 21:02:36,757 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 100 remaining) [2023-12-05 21:02:36,757 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 100 remaining) [2023-12-05 21:02:36,757 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 100 remaining) [2023-12-05 21:02:36,757 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 100 remaining) [2023-12-05 21:02:36,764 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 100 remaining) [2023-12-05 21:02:36,764 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 100 remaining) [2023-12-05 21:02:36,764 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 100 remaining) [2023-12-05 21:02:36,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 100 remaining) [2023-12-05 21:02:36,766 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 100 remaining) [2023-12-05 21:02:36,766 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 100 remaining) [2023-12-05 21:02:36,766 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 100 remaining) [2023-12-05 21:02:36,766 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] [2023-12-05 21:02:36,775 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:02:36,775 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:02:36,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:02:36 BasicIcfg [2023-12-05 21:02:36,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:02:36,778 INFO L158 Benchmark]: Toolchain (without parser) took 257515.31ms. Allocated memory was 249.6MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 197.0MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2023-12-05 21:02:36,778 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 249.6MB. Free memory is still 196.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:02:36,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.03ms. Allocated memory is still 249.6MB. Free memory was 196.7MB in the beginning and 166.7MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-05 21:02:36,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.87ms. Allocated memory is still 249.6MB. Free memory was 166.7MB in the beginning and 163.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:02:36,779 INFO L158 Benchmark]: Boogie Preprocessor took 27.77ms. Allocated memory is still 249.6MB. Free memory was 163.6MB in the beginning and 161.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:02:36,779 INFO L158 Benchmark]: RCFGBuilder took 710.79ms. Allocated memory was 249.6MB in the beginning and 320.9MB in the end (delta: 71.3MB). Free memory was 161.4MB in the beginning and 262.8MB in the end (delta: -101.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-05 21:02:36,779 INFO L158 Benchmark]: TraceAbstraction took 256174.87ms. Allocated memory was 320.9MB in the beginning and 5.4GB in the end (delta: 5.1GB). Free memory was 262.3MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2023-12-05 21:02:36,780 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.11ms. Allocated memory is still 249.6MB. Free memory is still 196.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 537.03ms. Allocated memory is still 249.6MB. Free memory was 196.7MB in the beginning and 166.7MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.87ms. Allocated memory is still 249.6MB. Free memory was 166.7MB in the beginning and 163.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.77ms. Allocated memory is still 249.6MB. Free memory was 163.6MB in the beginning and 161.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 710.79ms. Allocated memory was 249.6MB in the beginning and 320.9MB in the end (delta: 71.3MB). Free memory was 161.4MB in the beginning and 262.8MB in the end (delta: -101.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 256174.87ms. Allocated memory was 320.9MB in the beginning and 5.4GB in the end (delta: 5.1GB). Free memory was 262.3MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 2.8GB. Max. memory is 8.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 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 154 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 74 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 454 locations, 100 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: 256.0s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 96.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10098 SdHoareTripleChecker+Valid, 24.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10098 mSDsluCounter, 4890 SdHoareTripleChecker+Invalid, 21.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3287 IncrementalHoareTripleChecker+Unchecked, 4367 mSDsCounter, 657 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24148 IncrementalHoareTripleChecker+Invalid, 28092 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 657 mSolverCounterUnsat, 523 mSDtfsCounter, 24148 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1894 GetRequests, 1178 SyntacticMatches, 33 SemanticMatches, 683 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 14031 ImplicationChecksByTransitivity, 122.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101933occurred in iteration=25, InterpolantAutomatonStates: 381, 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.4s SatisfiabilityAnalysisTime, 117.8s InterpolantComputationTime, 2730 NumberOfCodeBlocks, 2730 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3327 ConstructedInterpolants, 251 QuantifiedInterpolants, 95619 SizeOfPredicates, 94 NumberOfNonLiveVariables, 1878 ConjunctsInSsa, 239 ConjunctsInUnsatCore, 35 InterpolantComputations, 20 PerfectInterpolantSequences, 43/372 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