/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_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 20:58:17,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 20:58:17,986 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:18,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 20:58:18,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 20:58:18,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 20:58:18,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 20:58:18,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 20:58:18,019 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 20:58:18,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 20:58:18,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 20:58:18,022 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 20:58:18,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 20:58:18,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 20:58:18,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 20:58:18,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 20:58:18,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 20:58:18,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 20:58:18,029 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 20:58:18,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 20:58:18,029 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 20:58:18,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 20:58:18,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 20:58:18,030 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 20:58:18,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 20:58:18,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:58:18,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 20:58:18,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 20:58:18,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 20:58:18,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 20:58:18,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 20:58:18,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 20:58:18,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 20:58:18,032 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:18,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 20:58:18,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 20:58:18,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 20:58:18,224 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 20:58:18,224 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 20:58:18,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-12-05 20:58:19,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 20:58:19,505 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 20:58:19,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-12-05 20:58:19,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5381b8ab2/6408d4dc2ac34992a7462d312f7a82dd/FLAG56eaca999 [2023-12-05 20:58:19,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5381b8ab2/6408d4dc2ac34992a7462d312f7a82dd [2023-12-05 20:58:19,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 20:58:19,540 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 20:58:19,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 20:58:19,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 20:58:19,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 20:58:19,544 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,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567a991e 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,545 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,589 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 20:58:19,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:58:19,950 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 20:58:20,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:58:20,080 INFO L206 MainTranslator]: Completed translation [2023-12-05 20:58:20,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20 WrapperNode [2023-12-05 20:58:20,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 20:58:20,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 20:58:20,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 20:58:20,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 20:58:20,086 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:20" (1/1) ... [2023-12-05 20:58:20,101 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:20" (1/1) ... [2023-12-05 20:58:20,121 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2023-12-05 20:58:20,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 20:58:20,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 20:58:20,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 20:58:20,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 20:58:20,131 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:20" (1/1) ... [2023-12-05 20:58:20,131 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:20" (1/1) ... [2023-12-05 20:58:20,138 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:20" (1/1) ... [2023-12-05 20:58:20,138 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:20" (1/1) ... [2023-12-05 20:58:20,145 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:20" (1/1) ... [2023-12-05 20:58:20,163 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:20" (1/1) ... [2023-12-05 20:58:20,165 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:20" (1/1) ... [2023-12-05 20:58:20,166 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:20" (1/1) ... [2023-12-05 20:58:20,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 20:58:20,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 20:58:20,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 20:58:20,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 20:58:20,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:20,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:58:20,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:58:20,229 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:20,262 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:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-05 20:58:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-05 20:58:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-05 20:58:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-05 20:58:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 20:58:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 20:58:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 20:58:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 20:58:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 20:58:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 20:58:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 20:58:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 20:58:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 20:58:20,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 20:58:20,271 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,415 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 20:58:20,416 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 20:58:20,816 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 20:58:20,862 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 20:58:20,862 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-05 20:58:20,864 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,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 20:58:20,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 20:58:20,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 20:58:20,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 20:58:20,876 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,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f25cf6b 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,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (2/3) ... [2023-12-05 20:58:20,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f25cf6b 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,877 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,877 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-12-05 20:58:20,906 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 20:58:20,907 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2023-12-05 20:58:20,907 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 20:58:21,135 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 20:58:21,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 294 transitions, 602 flow [2023-12-05 20:58:21,393 INFO L124 PetriNetUnfolderBase]: 15/292 cut-off events. [2023-12-05 20:58:21,394 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 20:58:21,405 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:21,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 294 transitions, 602 flow [2023-12-05 20:58:21,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 282 transitions, 573 flow [2023-12-05 20:58:21,428 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 20:58:21,436 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;@4ac2f881, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 20:58:21,437 INFO L363 AbstractCegarLoop]: Starting to check reachability of 100 error locations. [2023-12-05 20:58:21,445 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 20:58:21,445 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2023-12-05 20:58:21,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:58:21,445 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:21,446 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:21,446 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:21,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash 258200551, now seen corresponding path program 1 times [2023-12-05 20:58:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:21,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311795903] [2023-12-05 20:58:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:21,883 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,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:21,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311795903] [2023-12-05 20:58:21,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311795903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:21,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:21,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:21,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45962025] [2023-12-05 20:58:21,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:21,892 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:21,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:21,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:21,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:21,922 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 294 [2023-12-05 20:58:21,928 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,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:21,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 294 [2023-12-05 20:58:21,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:23,329 INFO L124 PetriNetUnfolderBase]: 3483/9979 cut-off events. [2023-12-05 20:58:23,330 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-12-05 20:58:23,350 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:23,398 INFO L140 encePairwiseOnDemand]: 280/294 looper letters, 78 selfloop transitions, 6 changer transitions 0/263 dead transitions. [2023-12-05 20:58:23,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 703 flow [2023-12-05 20:58:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 20:58:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 20:58:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1262 transitions. [2023-12-05 20:58:23,415 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7154195011337868 [2023-12-05 20:58:23,416 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1262 transitions. [2023-12-05 20:58:23,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1262 transitions. [2023-12-05 20:58:23,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:23,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1262 transitions. [2023-12-05 20:58:23,430 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:23,450 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:23,451 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:23,454 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, -8 predicate places. [2023-12-05 20:58:23,455 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 263 transitions, 703 flow [2023-12-05 20:58:23,456 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:23,456 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:23,456 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:23,456 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 20:58:23,456 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:23,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash 258200552, now seen corresponding path program 1 times [2023-12-05 20:58:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:23,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396185360] [2023-12-05 20:58:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:23,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:23,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396185360] [2023-12-05 20:58:23,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396185360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:23,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:23,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305181743] [2023-12-05 20:58:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:23,656 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:23,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:23,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:23,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:23,658 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 294 [2023-12-05 20:58:23,659 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,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:23,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 294 [2023-12-05 20:58:23,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:26,195 INFO L124 PetriNetUnfolderBase]: 9204/20715 cut-off events. [2023-12-05 20:58:26,196 INFO L125 PetriNetUnfolderBase]: For 3521/6937 co-relation queries the response was YES. [2023-12-05 20:58:26,247 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:26,364 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 101 selfloop transitions, 6 changer transitions 0/260 dead transitions. [2023-12-05 20:58:26,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 260 transitions, 905 flow [2023-12-05 20:58:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 20:58:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 20:58:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1124 transitions. [2023-12-05 20:58:26,367 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.63718820861678 [2023-12-05 20:58:26,367 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1124 transitions. [2023-12-05 20:58:26,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1124 transitions. [2023-12-05 20:58:26,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:26,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1124 transitions. [2023-12-05 20:58:26,369 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:26,371 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:26,372 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:26,373 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, -6 predicate places. [2023-12-05 20:58:26,373 INFO L500 AbstractCegarLoop]: Abstraction has has 268 places, 260 transitions, 905 flow [2023-12-05 20:58:26,373 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:26,374 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:26,374 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:26,374 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 20:58:26,374 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:26,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash 950976742, now seen corresponding path program 1 times [2023-12-05 20:58:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:26,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437705145] [2023-12-05 20:58:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:26,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:26,511 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:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:26,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437705145] [2023-12-05 20:58:26,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437705145] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:26,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:26,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539041191] [2023-12-05 20:58:26,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:26,513 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:26,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:26,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:26,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:26,515 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 294 [2023-12-05 20:58:26,516 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:26,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:26,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 294 [2023-12-05 20:58:26,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:29,102 INFO L124 PetriNetUnfolderBase]: 9204/20713 cut-off events. [2023-12-05 20:58:29,103 INFO L125 PetriNetUnfolderBase]: For 14037/21741 co-relation queries the response was YES. [2023-12-05 20:58:29,165 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:29,379 INFO L140 encePairwiseOnDemand]: 282/294 looper letters, 74 selfloop transitions, 10 changer transitions 0/258 dead transitions. [2023-12-05 20:58:29,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 258 transitions, 1065 flow [2023-12-05 20:58:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 20:58:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 20:58:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2006 transitions. [2023-12-05 20:58:29,395 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.682312925170068 [2023-12-05 20:58:29,395 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2006 transitions. [2023-12-05 20:58:29,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2006 transitions. [2023-12-05 20:58:29,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:29,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2006 transitions. [2023-12-05 20:58:29,399 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:29,403 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:29,404 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:29,420 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 1 predicate places. [2023-12-05 20:58:29,421 INFO L500 AbstractCegarLoop]: Abstraction has has 275 places, 258 transitions, 1065 flow [2023-12-05 20:58:29,421 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:29,421 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:29,422 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:29,422 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 20:58:29,422 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:29,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash 950976741, now seen corresponding path program 1 times [2023-12-05 20:58:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710694455] [2023-12-05 20:58:29,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:29,571 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:29,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:29,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710694455] [2023-12-05 20:58:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710694455] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:29,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:29,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:29,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161096803] [2023-12-05 20:58:29,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:29,574 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:29,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:29,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:29,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:29,577 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 294 [2023-12-05 20:58:29,579 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:29,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:29,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 294 [2023-12-05 20:58:29,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:31,939 INFO L124 PetriNetUnfolderBase]: 9204/20711 cut-off events. [2023-12-05 20:58:31,939 INFO L125 PetriNetUnfolderBase]: For 27630/39701 co-relation queries the response was YES. [2023-12-05 20:58:31,981 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:32,077 INFO L140 encePairwiseOnDemand]: 283/294 looper letters, 74 selfloop transitions, 9 changer transitions 0/256 dead transitions. [2023-12-05 20:58:32,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 256 transitions, 1215 flow [2023-12-05 20:58:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 20:58:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 20:58:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1786 transitions. [2023-12-05 20:58:32,081 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6749811035525322 [2023-12-05 20:58:32,081 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1786 transitions. [2023-12-05 20:58:32,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1786 transitions. [2023-12-05 20:58:32,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:32,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1786 transitions. [2023-12-05 20:58:32,084 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:32,088 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:32,088 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:32,089 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 7 predicate places. [2023-12-05 20:58:32,089 INFO L500 AbstractCegarLoop]: Abstraction has has 281 places, 256 transitions, 1215 flow [2023-12-05 20:58:32,090 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:32,090 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:32,090 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:32,090 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 20:58:32,090 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:32,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:32,090 INFO L85 PathProgramCache]: Analyzing trace with hash -670837734, now seen corresponding path program 1 times [2023-12-05 20:58:32,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:32,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390056275] [2023-12-05 20:58:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:32,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:32,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:32,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:32,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390056275] [2023-12-05 20:58:32,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390056275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:32,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:32,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 20:58:32,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916741791] [2023-12-05 20:58:32,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:32,423 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-05 20:58:32,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:32,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-05 20:58:32,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-05 20:58:32,425 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 294 [2023-12-05 20:58:32,427 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:32,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:32,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 294 [2023-12-05 20:58:32,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:34,737 INFO L124 PetriNetUnfolderBase]: 9203/20707 cut-off events. [2023-12-05 20:58:34,737 INFO L125 PetriNetUnfolderBase]: For 43654/56932 co-relation queries the response was YES. [2023-12-05 20:58:34,778 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:34,881 INFO L140 encePairwiseOnDemand]: 277/294 looper letters, 46 selfloop transitions, 16 changer transitions 0/252 dead transitions. [2023-12-05 20:58:34,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 252 transitions, 1331 flow [2023-12-05 20:58:34,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 20:58:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 20:58:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2571 transitions. [2023-12-05 20:58:34,885 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7287414965986394 [2023-12-05 20:58:34,885 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2571 transitions. [2023-12-05 20:58:34,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2571 transitions. [2023-12-05 20:58:34,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:34,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2571 transitions. [2023-12-05 20:58:34,890 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:34,894 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:34,895 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:34,895 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-12-05 20:58:34,895 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 252 transitions, 1331 flow [2023-12-05 20:58:34,896 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:34,896 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:34,897 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:34,897 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 20:58:34,897 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:34,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:34,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1502147520, now seen corresponding path program 1 times [2023-12-05 20:58:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199040131] [2023-12-05 20:58:34,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:34,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:35,014 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,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199040131] [2023-12-05 20:58:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199040131] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:35,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:35,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31840360] [2023-12-05 20:58:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:35,017 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:58:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:35,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:58:35,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:58:35,018 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 294 [2023-12-05 20:58:35,018 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:35,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:35,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 294 [2023-12-05 20:58:35,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:36,309 INFO L124 PetriNetUnfolderBase]: 4139/10279 cut-off events. [2023-12-05 20:58:36,309 INFO L125 PetriNetUnfolderBase]: For 33183/40095 co-relation queries the response was YES. [2023-12-05 20:58:36,331 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:36,386 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 88 selfloop transitions, 1 changer transitions 0/248 dead transitions. [2023-12-05 20:58:36,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 248 transitions, 1481 flow [2023-12-05 20:58:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-12-05 20:58:36,388 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7074829931972789 [2023-12-05 20:58:36,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-12-05 20:58:36,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-12-05 20:58:36,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:36,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-12-05 20:58:36,389 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:36,390 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,391 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,391 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-12-05 20:58:36,391 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 248 transitions, 1481 flow [2023-12-05 20:58:36,391 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:36,392 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:36,392 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,392 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 20:58:36,392 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:36,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1389959763, now seen corresponding path program 1 times [2023-12-05 20:58:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:36,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413893228] [2023-12-05 20:58:36,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:36,452 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,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:36,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413893228] [2023-12-05 20:58:36,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413893228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:36,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:36,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:36,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709093288] [2023-12-05 20:58:36,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:36,453 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:36,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:36,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:36,454 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 294 [2023-12-05 20:58:36,455 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:36,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:36,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 294 [2023-12-05 20:58:36,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:37,567 INFO L124 PetriNetUnfolderBase]: 4064/10048 cut-off events. [2023-12-05 20:58:37,567 INFO L125 PetriNetUnfolderBase]: For 41845/49521 co-relation queries the response was YES. [2023-12-05 20:58:37,588 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:37,637 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 65 selfloop transitions, 1 changer transitions 0/246 dead transitions. [2023-12-05 20:58:37,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 246 transitions, 1597 flow [2023-12-05 20:58:37,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:37,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2023-12-05 20:58:37,639 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2023-12-05 20:58:37,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2023-12-05 20:58:37,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2023-12-05 20:58:37,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:37,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2023-12-05 20:58:37,640 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:37,642 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,642 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,642 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-12-05 20:58:37,642 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 246 transitions, 1597 flow [2023-12-05 20:58:37,643 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:37,643 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:37,643 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:37,643 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 20:58:37,643 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:37,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:37,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1389959764, now seen corresponding path program 1 times [2023-12-05 20:58:37,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:37,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531968483] [2023-12-05 20:58:37,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:37,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:37,688 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,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:37,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531968483] [2023-12-05 20:58:37,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531968483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:37,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:37,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:37,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057621222] [2023-12-05 20:58:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:37,689 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:37,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:37,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:37,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:37,690 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 294 [2023-12-05 20:58:37,691 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:37,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:37,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 294 [2023-12-05 20:58:37,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:39,085 INFO L124 PetriNetUnfolderBase]: 3989/9817 cut-off events. [2023-12-05 20:58:39,086 INFO L125 PetriNetUnfolderBase]: For 54101/62638 co-relation queries the response was YES. [2023-12-05 20:58:39,114 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:39,195 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 64 selfloop transitions, 1 changer transitions 0/244 dead transitions. [2023-12-05 20:58:39,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 244 transitions, 1703 flow [2023-12-05 20:58:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2023-12-05 20:58:39,203 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7698412698412699 [2023-12-05 20:58:39,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2023-12-05 20:58:39,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2023-12-05 20:58:39,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:39,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2023-12-05 20:58:39,205 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:39,206 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:39,206 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:39,206 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-12-05 20:58:39,207 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 244 transitions, 1703 flow [2023-12-05 20:58:39,207 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:39,207 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:39,207 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:39,207 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 20:58:39,207 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:39,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash -287713448, now seen corresponding path program 1 times [2023-12-05 20:58:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:39,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171430958] [2023-12-05 20:58:39,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:39,297 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,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:39,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171430958] [2023-12-05 20:58:39,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171430958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:39,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:39,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2784020] [2023-12-05 20:58:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:39,299 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:39,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:39,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:39,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:39,301 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 294 [2023-12-05 20:58:39,301 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:39,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:39,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 294 [2023-12-05 20:58:39,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:39,558 INFO L124 PetriNetUnfolderBase]: 618/1889 cut-off events. [2023-12-05 20:58:39,559 INFO L125 PetriNetUnfolderBase]: For 12983/13865 co-relation queries the response was YES. [2023-12-05 20:58:39,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10186 conditions, 1889 events. 618/1889 cut-off events. For 12983/13865 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:39,570 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 13 selfloop transitions, 3 changer transitions 3/250 dead transitions. [2023-12-05 20:58:39,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 250 transitions, 1839 flow [2023-12-05 20:58:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 833 transitions. [2023-12-05 20:58:39,572 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2023-12-05 20:58:39,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 833 transitions. [2023-12-05 20:58:39,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 833 transitions. [2023-12-05 20:58:39,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:39,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 833 transitions. [2023-12-05 20:58:39,574 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:39,575 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:39,585 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:39,585 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-12-05 20:58:39,586 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 250 transitions, 1839 flow [2023-12-05 20:58:39,586 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:39,586 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:39,586 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:39,586 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 20:58:39,587 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:39,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:39,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1576458658, now seen corresponding path program 1 times [2023-12-05 20:58:39,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:39,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023312817] [2023-12-05 20:58:39,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:39,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:39,714 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,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:39,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023312817] [2023-12-05 20:58:39,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023312817] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:39,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:39,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104068395] [2023-12-05 20:58:39,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:39,718 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:39,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:39,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:39,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:39,720 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 294 [2023-12-05 20:58:39,721 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:39,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:39,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 294 [2023-12-05 20:58:39,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:40,036 INFO L124 PetriNetUnfolderBase]: 563/1713 cut-off events. [2023-12-05 20:58:40,036 INFO L125 PetriNetUnfolderBase]: For 16350/17004 co-relation queries the response was YES. [2023-12-05 20:58:40,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10195 conditions, 1713 events. 563/1713 cut-off events. For 16350/17004 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:40,048 INFO L140 encePairwiseOnDemand]: 277/294 looper letters, 83 selfloop transitions, 9 changer transitions 3/252 dead transitions. [2023-12-05 20:58:40,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 252 transitions, 2129 flow [2023-12-05 20:58:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 20:58:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 20:58:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1744 transitions. [2023-12-05 20:58:40,051 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6591080876795162 [2023-12-05 20:58:40,052 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1744 transitions. [2023-12-05 20:58:40,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1744 transitions. [2023-12-05 20:58:40,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:40,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1744 transitions. [2023-12-05 20:58:40,055 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:40,057 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:40,057 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:40,058 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-12-05 20:58:40,058 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 252 transitions, 2129 flow [2023-12-05 20:58:40,058 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:40,058 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:40,059 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:40,059 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 20:58:40,059 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:40,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1576458659, now seen corresponding path program 1 times [2023-12-05 20:58:40,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:40,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480569072] [2023-12-05 20:58:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:40,332 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:40,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:40,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480569072] [2023-12-05 20:58:40,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480569072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:40,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:40,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-05 20:58:40,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724655156] [2023-12-05 20:58:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:40,333 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 20:58:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 20:58:40,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-05 20:58:40,335 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 294 [2023-12-05 20:58:40,336 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:40,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:40,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 294 [2023-12-05 20:58:40,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:40,758 INFO L124 PetriNetUnfolderBase]: 493/1580 cut-off events. [2023-12-05 20:58:40,760 INFO L125 PetriNetUnfolderBase]: For 17245/17971 co-relation queries the response was YES. [2023-12-05 20:58:40,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9884 conditions, 1580 events. 493/1580 cut-off events. For 17245/17971 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:40,771 INFO L140 encePairwiseOnDemand]: 273/294 looper letters, 74 selfloop transitions, 14 changer transitions 3/245 dead transitions. [2023-12-05 20:58:40,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 245 transitions, 2225 flow [2023-12-05 20:58:40,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 20:58:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 20:58:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2252 transitions. [2023-12-05 20:58:40,775 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6383219954648526 [2023-12-05 20:58:40,775 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2252 transitions. [2023-12-05 20:58:40,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2252 transitions. [2023-12-05 20:58:40,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:40,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2252 transitions. [2023-12-05 20:58:40,780 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:40,784 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:40,785 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:40,785 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 19 predicate places. [2023-12-05 20:58:40,785 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 245 transitions, 2225 flow [2023-12-05 20:58:40,786 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:40,786 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:40,786 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:40,786 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 20:58:40,786 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:40,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:40,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1625578810, now seen corresponding path program 1 times [2023-12-05 20:58:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:40,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768657709] [2023-12-05 20:58:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:40,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:41,460 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,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768657709] [2023-12-05 20:58:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768657709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:41,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:41,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-05 20:58:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260039076] [2023-12-05 20:58:41,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:41,461 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 20:58:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:41,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 20:58:41,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-05 20:58:41,463 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 294 [2023-12-05 20:58:41,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 245 transitions, 2225 flow. Second operand has 15 states, 15 states have (on average 151.8) internal successors, (2277), 15 states have internal predecessors, (2277), 0 states have call successors, (0), 0 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,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:41,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 294 [2023-12-05 20:58:41,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:42,244 INFO L124 PetriNetUnfolderBase]: 543/1689 cut-off events. [2023-12-05 20:58:42,244 INFO L125 PetriNetUnfolderBase]: For 20955/21840 co-relation queries the response was YES. [2023-12-05 20:58:42,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11627 conditions, 1689 events. 543/1689 cut-off events. For 20955/21840 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:42,257 INFO L140 encePairwiseOnDemand]: 273/294 looper letters, 111 selfloop transitions, 24 changer transitions 4/270 dead transitions. [2023-12-05 20:58:42,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 270 transitions, 2988 flow [2023-12-05 20:58:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-05 20:58:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-12-05 20:58:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2657 transitions. [2023-12-05 20:58:42,262 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5316126450580232 [2023-12-05 20:58:42,263 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2657 transitions. [2023-12-05 20:58:42,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2657 transitions. [2023-12-05 20:58:42,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:42,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2657 transitions. [2023-12-05 20:58:42,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 156.2941176470588) internal successors, (2657), 17 states have internal predecessors, (2657), 0 states have call successors, (0), 0 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,272 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,273 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,273 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 35 predicate places. [2023-12-05 20:58:42,273 INFO L500 AbstractCegarLoop]: Abstraction has has 309 places, 270 transitions, 2988 flow [2023-12-05 20:58:42,274 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 151.8) internal successors, (2277), 15 states have internal predecessors, (2277), 0 states have call successors, (0), 0 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,274 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:42,274 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:42,274 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 20:58:42,274 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:42,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash 680851560, now seen corresponding path program 1 times [2023-12-05 20:58:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:42,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140216916] [2023-12-05 20:58:42,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:42,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:42,987 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,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:42,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140216916] [2023-12-05 20:58:42,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140216916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:42,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:42,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-05 20:58:42,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151538101] [2023-12-05 20:58:42,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:42,988 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-05 20:58:42,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:42,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-05 20:58:42,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-05 20:58:42,990 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 294 [2023-12-05 20:58:42,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 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:42,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:42,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 294 [2023-12-05 20:58:42,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:44,023 INFO L124 PetriNetUnfolderBase]: 808/2582 cut-off events. [2023-12-05 20:58:44,023 INFO L125 PetriNetUnfolderBase]: For 37912/38869 co-relation queries the response was YES. [2023-12-05 20:58:44,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18805 conditions, 2582 events. 808/2582 cut-off events. For 37912/38869 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 18096 event pairs, 219 based on Foata normal form. 8/2459 useless extension candidates. Maximal degree in co-relation 14999. Up to 1388 conditions per place. [2023-12-05 20:58:44,040 INFO L140 encePairwiseOnDemand]: 272/294 looper letters, 162 selfloop transitions, 28 changer transitions 4/326 dead transitions. [2023-12-05 20:58:44,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 326 transitions, 4601 flow [2023-12-05 20:58:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-05 20:58:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-12-05 20:58:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2670 transitions. [2023-12-05 20:58:44,044 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5342136854741897 [2023-12-05 20:58:44,044 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2670 transitions. [2023-12-05 20:58:44,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2670 transitions. [2023-12-05 20:58:44,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:44,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2670 transitions. [2023-12-05 20:58:44,049 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:44,053 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:44,054 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:44,055 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 51 predicate places. [2023-12-05 20:58:44,055 INFO L500 AbstractCegarLoop]: Abstraction has has 325 places, 326 transitions, 4601 flow [2023-12-05 20:58:44,055 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:44,056 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:44,056 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:44,056 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 20:58:44,056 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-12-05 20:58:44,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash -572052910, now seen corresponding path program 1 times [2023-12-05 20:58:44,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:44,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123140241] [2023-12-05 20:58:44,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:44,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:44,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:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123140241] [2023-12-05 20:58:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123140241] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:44,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:44,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840819238] [2023-12-05 20:58:44,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:44,089 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:44,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:44,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:44,090 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 294 [2023-12-05 20:58:44,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 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:44,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:44,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 294 [2023-12-05 20:58:44,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:44,347 INFO L124 PetriNetUnfolderBase]: 702/2152 cut-off events. [2023-12-05 20:58:44,348 INFO L125 PetriNetUnfolderBase]: For 37623/37935 co-relation queries the response was YES. [2023-12-05 20:58:44,352 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 13292 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:44,365 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 56 selfloop transitions, 2 changer transitions 5/317 dead transitions. [2023-12-05 20:58:44,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 317 transitions, 4547 flow [2023-12-05 20:58:44,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-12-05 20:58:44,368 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9421768707482994 [2023-12-05 20:58:44,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-12-05 20:58:44,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-12-05 20:58:44,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:44,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-12-05 20:58:44,370 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:44,371 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:44,371 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:44,372 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 53 predicate places. [2023-12-05 20:58:44,372 INFO L500 AbstractCegarLoop]: Abstraction has has 327 places, 317 transitions, 4547 flow [2023-12-05 20:58:44,372 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:44,372 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:44,372 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:44,372 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 20:58:44,372 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:44,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash 345468283, now seen corresponding path program 1 times [2023-12-05 20:58:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:44,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499352813] [2023-12-05 20:58:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:44,509 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,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499352813] [2023-12-05 20:58:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499352813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:44,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680168335] [2023-12-05 20:58:44,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:44,509 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:44,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:44,511 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 294 [2023-12-05 20:58:44,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 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:44,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:44,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 294 [2023-12-05 20:58:44,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:44,904 INFO L124 PetriNetUnfolderBase]: 678/2106 cut-off events. [2023-12-05 20:58:44,904 INFO L125 PetriNetUnfolderBase]: For 43453/43765 co-relation queries the response was YES. [2023-12-05 20:58:44,908 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 12921 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:44,922 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 127 selfloop transitions, 2 changer transitions 5/315 dead transitions. [2023-12-05 20:58:44,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 315 transitions, 4779 flow [2023-12-05 20:58:44,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 20:58:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 20:58:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 861 transitions. [2023-12-05 20:58:44,923 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-12-05 20:58:44,923 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 861 transitions. [2023-12-05 20:58:44,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 861 transitions. [2023-12-05 20:58:44,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:44,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 861 transitions. [2023-12-05 20:58:44,925 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:44,926 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:44,926 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:44,926 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 54 predicate places. [2023-12-05 20:58:44,927 INFO L500 AbstractCegarLoop]: Abstraction has has 328 places, 315 transitions, 4779 flow [2023-12-05 20:58:44,927 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:44,927 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:44,927 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:44,927 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 20:58:44,927 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:44,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash 345468284, now seen corresponding path program 1 times [2023-12-05 20:58:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:44,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938325846] [2023-12-05 20:58:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:45,607 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:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938325846] [2023-12-05 20:58:45,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938325846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:45,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:45,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-05 20:58:45,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243886997] [2023-12-05 20:58:45,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:45,611 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-05 20:58:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:45,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-05 20:58:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-12-05 20:58:45,613 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 294 [2023-12-05 20:58:45,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 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:45,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:45,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 294 [2023-12-05 20:58:45,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:46,486 INFO L124 PetriNetUnfolderBase]: 754/2241 cut-off events. [2023-12-05 20:58:46,487 INFO L125 PetriNetUnfolderBase]: For 57238/57589 co-relation queries the response was YES. [2023-12-05 20:58:46,492 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 13610 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:46,508 INFO L140 encePairwiseOnDemand]: 269/294 looper letters, 156 selfloop transitions, 33 changer transitions 5/338 dead transitions. [2023-12-05 20:58:46,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 338 transitions, 5775 flow [2023-12-05 20:58:46,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-05 20:58:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-05 20:58:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3145 transitions. [2023-12-05 20:58:46,512 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5630146795560329 [2023-12-05 20:58:46,512 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3145 transitions. [2023-12-05 20:58:46,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3145 transitions. [2023-12-05 20:58:46,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:46,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3145 transitions. [2023-12-05 20:58:46,520 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:46,524 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:46,524 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:46,524 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 72 predicate places. [2023-12-05 20:58:46,524 INFO L500 AbstractCegarLoop]: Abstraction has has 346 places, 338 transitions, 5775 flow [2023-12-05 20:58:46,525 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:46,525 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:46,525 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:46,525 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 20:58:46,525 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:46,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:46,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1161989109, now seen corresponding path program 1 times [2023-12-05 20:58:46,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:46,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691132811] [2023-12-05 20:58:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:46,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:46,755 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:46,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691132811] [2023-12-05 20:58:46,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691132811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:46,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:46,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307359355] [2023-12-05 20:58:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:46,757 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:46,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:46,758 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 294 [2023-12-05 20:58:46,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 338 transitions, 5775 flow. Second operand has 7 states, 7 states have (on average 173.28571428571428) internal successors, (1213), 7 states have internal predecessors, (1213), 0 states have call successors, (0), 0 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:46,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:46,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 294 [2023-12-05 20:58:46,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:47,241 INFO L124 PetriNetUnfolderBase]: 823/2405 cut-off events. [2023-12-05 20:58:47,242 INFO L125 PetriNetUnfolderBase]: For 72145/72353 co-relation queries the response was YES. [2023-12-05 20:58:47,247 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 14577 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:47,265 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 169 selfloop transitions, 6 changer transitions 6/346 dead transitions. [2023-12-05 20:58:47,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 346 transitions, 6387 flow [2023-12-05 20:58:47,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 20:58:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 20:58:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1277 transitions. [2023-12-05 20:58:47,266 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6205053449951409 [2023-12-05 20:58:47,267 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1277 transitions. [2023-12-05 20:58:47,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1277 transitions. [2023-12-05 20:58:47,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:47,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1277 transitions. [2023-12-05 20:58:47,268 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:47,269 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:47,270 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:47,270 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 78 predicate places. [2023-12-05 20:58:47,270 INFO L500 AbstractCegarLoop]: Abstraction has has 352 places, 346 transitions, 6387 flow [2023-12-05 20:58:47,270 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 173.28571428571428) internal successors, (1213), 7 states have internal predecessors, (1213), 0 states have call successors, (0), 0 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:47,270 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:47,270 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:47,270 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 20:58:47,271 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:47,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1921399839, now seen corresponding path program 1 times [2023-12-05 20:58:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:47,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532251443] [2023-12-05 20:58:47,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:47,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:50,263 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,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:50,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532251443] [2023-12-05 20:58:50,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532251443] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 20:58:50,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852884333] [2023-12-05 20:58:50,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:50,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 20:58:50,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:58:50,266 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:50,271 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:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:50,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-05 20:58:50,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 20:58:50,577 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 20:58:50,578 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:50,750 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:50,811 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 19 treesize of output 18 [2023-12-05 20:58:51,200 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 20:58:51,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-05 20:58:51,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 14 [2023-12-05 20:58:51,936 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:52,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 20:58:52,046 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:52,329 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:52,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 20:58:52,690 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_345 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_345 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-12-05 20:58:52,701 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_345 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_345 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-12-05 20:58:53,616 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.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| 3204))) (and (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (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 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= (+ |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 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-05 20:58:53,914 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| 3204))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse3 .cse2)))) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse5) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-12-05 20:58:55,945 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse5 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse2) 4))))))) is different from false [2023-12-05 20:58:56,034 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_345 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_340))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_341)))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_345 (Array Int Int))) (<= (+ (* 4 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_340))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_341)))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-12-05 20:58:56,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:58:56,189 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 276 treesize of output 280 [2023-12-05 20:59:02,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:02,898 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 159 treesize of output 105 [2023-12-05 20:59:02,904 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 128 treesize of output 120 [2023-12-05 20:59:02,910 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:02,915 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 108 treesize of output 100 [2023-12-05 20:59:02,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:02,933 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 81 treesize of output 79 [2023-12-05 20:59:03,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:03,025 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 157 treesize of output 103 [2023-12-05 20:59:03,027 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 20:59:03,028 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 20:59:03,030 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 48 treesize of output 40 [2023-12-05 20:59:03,040 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-12-05 20:59:03,040 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 54 treesize of output 38 [2023-12-05 20:59:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-12-05 20:59:03,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852884333] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 20:59:03,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 20:59:03,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2023-12-05 20:59:03,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193735122] [2023-12-05 20:59:03,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 20:59:03,555 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-05 20:59:03,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-05 20:59:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=3153, Unknown=75, NotChecked=726, Total=4290 [2023-12-05 20:59:03,562 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 294 [2023-12-05 20:59:03,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 346 transitions, 6387 flow. Second operand has 66 states, 66 states have (on average 147.36363636363637) internal successors, (9726), 66 states have internal predecessors, (9726), 0 states have call successors, (0), 0 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:03,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:03,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 294 [2023-12-05 20:59:03,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:13,715 INFO L124 PetriNetUnfolderBase]: 1710/4866 cut-off events. [2023-12-05 20:59:13,716 INFO L125 PetriNetUnfolderBase]: For 171359/172186 co-relation queries the response was YES. [2023-12-05 20:59:13,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47742 conditions, 4866 events. 1710/4866 cut-off events. For 171359/172186 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 35327 event pairs, 344 based on Foata normal form. 32/4729 useless extension candidates. Maximal degree in co-relation 40949. Up to 2690 conditions per place. [2023-12-05 20:59:13,776 INFO L140 encePairwiseOnDemand]: 259/294 looper letters, 324 selfloop transitions, 95 changer transitions 10/563 dead transitions. [2023-12-05 20:59:13,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 563 transitions, 13637 flow [2023-12-05 20:59:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-05 20:59:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-12-05 20:59:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 6975 transitions. [2023-12-05 20:59:13,781 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5157497781721384 [2023-12-05 20:59:13,781 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 6975 transitions. [2023-12-05 20:59:13,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 6975 transitions. [2023-12-05 20:59:13,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:13,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 6975 transitions. [2023-12-05 20:59:13,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 151.6304347826087) internal successors, (6975), 46 states have internal predecessors, (6975), 0 states have call successors, (0), 0 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:13,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 294.0) internal successors, (13818), 47 states have internal predecessors, (13818), 0 states have call successors, (0), 0 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:13,798 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 294.0) internal successors, (13818), 47 states have internal predecessors, (13818), 0 states have call successors, (0), 0 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:13,798 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 123 predicate places. [2023-12-05 20:59:13,799 INFO L500 AbstractCegarLoop]: Abstraction has has 397 places, 563 transitions, 13637 flow [2023-12-05 20:59:13,800 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 147.36363636363637) internal successors, (9726), 66 states have internal predecessors, (9726), 0 states have call successors, (0), 0 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:13,800 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:13,800 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:13,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-05 20:59:14,006 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:14,006 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:14,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash -68706586, now seen corresponding path program 1 times [2023-12-05 20:59:14,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:14,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133670542] [2023-12-05 20:59:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:14,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:16,664 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:16,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:16,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133670542] [2023-12-05 20:59:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133670542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:16,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-05 20:59:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812865977] [2023-12-05 20:59:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:16,665 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-05 20:59:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:16,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-05 20:59:16,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-12-05 20:59:16,667 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-12-05 20:59:16,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 563 transitions, 13637 flow. Second operand has 20 states, 20 states have (on average 146.9) internal successors, (2938), 20 states have internal predecessors, (2938), 0 states have call successors, (0), 0 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:16,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:16,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-12-05 20:59:16,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:20,231 INFO L124 PetriNetUnfolderBase]: 1834/5160 cut-off events. [2023-12-05 20:59:20,232 INFO L125 PetriNetUnfolderBase]: For 199272/200306 co-relation queries the response was YES. [2023-12-05 20:59:20,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54448 conditions, 5160 events. 1834/5160 cut-off events. For 199272/200306 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 37514 event pairs, 346 based on Foata normal form. 1/4993 useless extension candidates. Maximal degree in co-relation 47251. Up to 2897 conditions per place. [2023-12-05 20:59:20,289 INFO L140 encePairwiseOnDemand]: 269/294 looper letters, 432 selfloop transitions, 45 changer transitions 10/630 dead transitions. [2023-12-05 20:59:20,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 630 transitions, 16930 flow [2023-12-05 20:59:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-05 20:59:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-12-05 20:59:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3633 transitions. [2023-12-05 20:59:20,292 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5148809523809523 [2023-12-05 20:59:20,292 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3633 transitions. [2023-12-05 20:59:20,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3633 transitions. [2023-12-05 20:59:20,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:20,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3633 transitions. [2023-12-05 20:59:20,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 151.375) internal successors, (3633), 24 states have internal predecessors, (3633), 0 states have call successors, (0), 0 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:20,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 294.0) internal successors, (7350), 25 states have internal predecessors, (7350), 0 states have call successors, (0), 0 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:20,299 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 294.0) internal successors, (7350), 25 states have internal predecessors, (7350), 0 states have call successors, (0), 0 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:20,299 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 146 predicate places. [2023-12-05 20:59:20,299 INFO L500 AbstractCegarLoop]: Abstraction has has 420 places, 630 transitions, 16930 flow [2023-12-05 20:59:20,299 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 146.9) internal successors, (2938), 20 states have internal predecessors, (2938), 0 states have call successors, (0), 0 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:20,300 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:20,300 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:20,300 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-05 20:59:20,300 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:20,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1741720656, now seen corresponding path program 2 times [2023-12-05 20:59:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:20,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167386189] [2023-12-05 20:59:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:20,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:21,140 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:21,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:21,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167386189] [2023-12-05 20:59:21,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167386189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:21,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:21,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-05 20:59:21,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927305441] [2023-12-05 20:59:21,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:21,141 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-05 20:59:21,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:21,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-05 20:59:21,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-12-05 20:59:21,142 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-12-05 20:59:21,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 630 transitions, 16930 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:21,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:21,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-12-05 20:59:21,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:23,259 INFO L124 PetriNetUnfolderBase]: 1954/5444 cut-off events. [2023-12-05 20:59:23,259 INFO L125 PetriNetUnfolderBase]: For 234845/236070 co-relation queries the response was YES. [2023-12-05 20:59:23,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61321 conditions, 5444 events. 1954/5444 cut-off events. For 234845/236070 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 40027 event pairs, 388 based on Foata normal form. 14/5284 useless extension candidates. Maximal degree in co-relation 53720. Up to 3080 conditions per place. [2023-12-05 20:59:23,316 INFO L140 encePairwiseOnDemand]: 268/294 looper letters, 464 selfloop transitions, 58 changer transitions 10/675 dead transitions. [2023-12-05 20:59:23,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 675 transitions, 19590 flow [2023-12-05 20:59:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-05 20:59:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-12-05 20:59:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3190 transitions. [2023-12-05 20:59:23,318 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5166828636216392 [2023-12-05 20:59:23,319 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3190 transitions. [2023-12-05 20:59:23,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3190 transitions. [2023-12-05 20:59:23,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:23,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3190 transitions. [2023-12-05 20:59:23,322 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:23,325 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:23,325 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:23,325 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 166 predicate places. [2023-12-05 20:59:23,325 INFO L500 AbstractCegarLoop]: Abstraction has has 440 places, 675 transitions, 19590 flow [2023-12-05 20:59:23,326 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:23,326 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:23,326 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:23,326 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-05 20:59:23,326 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:23,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1276130532, now seen corresponding path program 3 times [2023-12-05 20:59:23,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:23,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392470965] [2023-12-05 20:59:23,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:23,918 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:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392470965] [2023-12-05 20:59:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392470965] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 20:59:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685571116] [2023-12-05 20:59:23,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-05 20:59:23,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 20:59:23,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:59:23,920 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:23,922 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 20:59:24,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-05 20:59:24,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 20:59:24,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-05 20:59:24,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 20:59:24,293 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2023-12-05 20:59:24,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2023-12-05 20:59:24,366 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-12-05 20:59:24,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2023-12-05 20:59:24,630 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 20:59:24,689 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 19 treesize of output 18 [2023-12-05 20:59:25,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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 20:59:25,787 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-12-05 20:59:25,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2023-12-05 20:59:25,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 14 [2023-12-05 20:59:25,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:59:25,973 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 15 treesize of output 7 [2023-12-05 20:59:25,996 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:25,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-05 20:59:25,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685571116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:25,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-05 20:59:25,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [15] total 36 [2023-12-05 20:59:25,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667402887] [2023-12-05 20:59:25,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:25,997 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-05 20:59:25,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:25,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-05 20:59:25,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2023-12-05 20:59:25,999 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 294 [2023-12-05 20:59:26,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 675 transitions, 19590 flow. Second operand has 22 states, 22 states have (on average 161.5909090909091) internal successors, (3555), 22 states have internal predecessors, (3555), 0 states have call successors, (0), 0 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:26,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:26,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 294 [2023-12-05 20:59:26,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:28,388 INFO L124 PetriNetUnfolderBase]: 1923/5354 cut-off events. [2023-12-05 20:59:28,388 INFO L125 PetriNetUnfolderBase]: For 247766/248994 co-relation queries the response was YES. [2023-12-05 20:59:28,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63631 conditions, 5354 events. 1923/5354 cut-off events. For 247766/248994 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 39454 event pairs, 368 based on Foata normal form. 10/5200 useless extension candidates. Maximal degree in co-relation 55673. Up to 3042 conditions per place. [2023-12-05 20:59:28,446 INFO L140 encePairwiseOnDemand]: 269/294 looper letters, 449 selfloop transitions, 51 changer transitions 10/680 dead transitions. [2023-12-05 20:59:28,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 680 transitions, 20755 flow [2023-12-05 20:59:28,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-05 20:59:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-12-05 20:59:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3632 transitions. [2023-12-05 20:59:28,453 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5615337043908473 [2023-12-05 20:59:28,453 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3632 transitions. [2023-12-05 20:59:28,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3632 transitions. [2023-12-05 20:59:28,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:28,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3632 transitions. [2023-12-05 20:59:28,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 165.0909090909091) internal successors, (3632), 22 states have internal predecessors, (3632), 0 states have call successors, (0), 0 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:28,482 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:28,482 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:28,482 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 187 predicate places. [2023-12-05 20:59:28,482 INFO L500 AbstractCegarLoop]: Abstraction has has 461 places, 680 transitions, 20755 flow [2023-12-05 20:59:28,483 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 161.5909090909091) internal successors, (3555), 22 states have internal predecessors, (3555), 0 states have call successors, (0), 0 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:28,483 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:28,483 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:28,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-05 20:59:28,687 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,SelfDestructingSolverStorable20 [2023-12-05 20:59:28,688 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:28,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1198348365, now seen corresponding path program 1 times [2023-12-05 20:59:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:28,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080051200] [2023-12-05 20:59:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:28,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:30,247 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:30,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:30,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080051200] [2023-12-05 20:59:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080051200] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 20:59:30,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511742223] [2023-12-05 20:59:30,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:30,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 20:59:30,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:59:30,249 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 20:59:30,251 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 20:59:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:30,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-05 20:59:30,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 20:59:30,449 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-05 20:59:30,449 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 20:59:30,482 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 20:59:30,482 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:59:30,638 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 20:59:30,689 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 19 treesize of output 18 [2023-12-05 20:59:31,058 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 20:59:31,193 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 20:59:31,517 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-12-05 20:59:31,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2023-12-05 20:59:31,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 14 [2023-12-05 20:59:31,830 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:59:31,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 20:59:31,925 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:59:32,058 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:32,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 20:59:32,283 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_533 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_533 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_533) |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 20:59:32,407 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_533 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_533 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-12-05 20:59:32,434 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_533 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_533 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2023-12-05 20:59:33,305 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_528 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_528))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|) (< .cse2 0) (forall ((v_ArrVal_530 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_533 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 .cse2 v_ArrVal_530))) (store (store .cse4 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_528 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_528))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|) (forall ((v_ArrVal_530 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_533 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 .cse9 v_ArrVal_530))) (store (store .cse8 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4)))) (< .cse9 0))))))) is different from false [2023-12-05 20:59:34,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:34,096 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 284 treesize of output 288 [2023-12-05 20:59:34,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (and (or (and (forall ((v_ArrVal_528 (Array Int Int)) (v_ArrVal_527 (Array Int Int))) (< (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_528) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|) 0)) (forall ((v_prenex_5 Int) (v_prenex_10 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_8 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse4 (store (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_6))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| (* v_prenex_9 4)))) (or (< (select .cse2 .cse1) v_prenex_9) (< .cse3 0) (< 0 (+ |c_~#queue~0.offset| 1 (* 4 (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 .cse3 v_prenex_5))) (store (store .cse5 .cse6 (+ v_prenex_8 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_prenex_10) |c_~#queue~0.base|) .cse1))))))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|)) (forall ((v_ArrVal_530 Int) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_533 (Array Int Int))) (let ((.cse7 (store (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_528))) (let ((.cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))) (.cse9 (select .cse7 |c_~#queue~0.base|))) (or (< (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 .cse10 v_ArrVal_530))) (store (store .cse8 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|) (+ 3209 |c_ULTIMATE.start_init_~q#1.offset|)) (< .cse10 0) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))))) (forall ((v_prenex_5 Int) (v_prenex_10 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse13 (store (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_6))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|)) (.cse12 (+ |c_~#queue~0.offset| (* v_prenex_9 4)))) (or (< (select .cse11 .cse1) v_prenex_9) (< .cse12 0) (< 0 (+ |c_~#queue~0.offset| 1 (* 4 (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse11 .cse12 v_prenex_5))) (store (store .cse14 .cse6 (+ v_prenex_8 1)) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_prenex_10) |c_~#queue~0.base|) .cse1)))))))))) is different from false [2023-12-05 20:59:34,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:34,182 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 512 treesize of output 338 [2023-12-05 20:59:34,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:34,206 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 1176 treesize of output 1162 [2023-12-05 20:59:34,233 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 904 treesize of output 888 [2023-12-05 20:59:34,245 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 888 treesize of output 872 [2023-12-05 20:59:34,258 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 883 treesize of output 875 [2023-12-05 20:59:34,271 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 875 treesize of output 867 [2023-12-05 20:59:34,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 867 treesize of output 863 [2023-12-05 20:59:34,298 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 874 treesize of output 866 [2023-12-05 20:59:34,311 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 878 treesize of output 870 [2023-12-05 20:59:34,320 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-12-05 20:59:34,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 894 treesize of output 878 [2023-12-05 20:59:34,339 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 878 treesize of output 862 [2023-12-05 20:59:34,353 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 884 treesize of output 868 [2023-12-05 20:59:34,367 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 868 treesize of output 852 [2023-12-05 20:59:34,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 8 [2023-12-05 20:59:34,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:34,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 157 [2023-12-05 20:59:35,362 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-12-05 20:59:35,362 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 20:59:35,413 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:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511742223] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 20:59:35,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 20:59:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 24] total 70 [2023-12-05 20:59:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630309621] [2023-12-05 20:59:35,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 20:59:35,417 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-12-05 20:59:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:35,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-12-05 20:59:35,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=3901, Unknown=32, NotChecked=660, Total=4970 [2023-12-05 20:59:35,422 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-12-05 20:59:35,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 680 transitions, 20755 flow. Second operand has 71 states, 71 states have (on average 146.2394366197183) internal successors, (10383), 71 states have internal predecessors, (10383), 0 states have call successors, (0), 0 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:35,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:35,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-12-05 20:59:35,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:43,034 INFO L124 PetriNetUnfolderBase]: 2731/7710 cut-off events. [2023-12-05 20:59:43,034 INFO L125 PetriNetUnfolderBase]: For 384946/387441 co-relation queries the response was YES. [2023-12-05 20:59:43,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94725 conditions, 7710 events. 2731/7710 cut-off events. For 384946/387441 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 62969 event pairs, 482 based on Foata normal form. 40/7486 useless extension candidates. Maximal degree in co-relation 82158. Up to 4353 conditions per place. [2023-12-05 20:59:43,137 INFO L140 encePairwiseOnDemand]: 259/294 looper letters, 627 selfloop transitions, 123 changer transitions 14/907 dead transitions. [2023-12-05 20:59:43,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 907 transitions, 30917 flow [2023-12-05 20:59:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-05 20:59:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-12-05 20:59:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5794 transitions. [2023-12-05 20:59:43,153 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5186179735051916 [2023-12-05 20:59:43,153 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5794 transitions. [2023-12-05 20:59:43,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5794 transitions. [2023-12-05 20:59:43,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:43,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5794 transitions. [2023-12-05 20:59:43,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 152.47368421052633) internal successors, (5794), 38 states have internal predecessors, (5794), 0 states have call successors, (0), 0 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,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 294.0) internal successors, (11466), 39 states have internal predecessors, (11466), 0 states have call successors, (0), 0 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,198 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 294.0) internal successors, (11466), 39 states have internal predecessors, (11466), 0 states have call successors, (0), 0 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,199 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 224 predicate places. [2023-12-05 20:59:43,199 INFO L500 AbstractCegarLoop]: Abstraction has has 498 places, 907 transitions, 30917 flow [2023-12-05 20:59:43,200 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 146.2394366197183) internal successors, (10383), 71 states have internal predecessors, (10383), 0 states have call successors, (0), 0 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,200 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:43,200 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 20:59:43,217 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 20:59:43,404 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 20:59:43,405 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 20:59:43,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash -204489033, now seen corresponding path program 1 times [2023-12-05 20:59:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:43,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782424645] [2023-12-05 20:59:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:43,474 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 20:59:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782424645] [2023-12-05 20:59:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782424645] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 20:59:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544391840] [2023-12-05 20:59:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:43,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 20:59:43,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:59:43,476 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 20:59:43,477 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 20:59:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:43,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-05 20:59:43,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 20:59:43,855 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 20:59:43,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 20:59:43,910 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 20:59:43,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544391840] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 20:59:43,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 20:59:43,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 20:59:43,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15988859] [2023-12-05 20:59:43,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 20:59:43,912 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 20:59:43,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:43,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 20:59:43,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-05 20:59:43,915 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 294 [2023-12-05 20:59:43,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 907 transitions, 30917 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 20:59:43,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:43,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 294 [2023-12-05 20:59:43,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:46,945 INFO L124 PetriNetUnfolderBase]: 3548/9681 cut-off events. [2023-12-05 20:59:46,945 INFO L125 PetriNetUnfolderBase]: For 547790/550846 co-relation queries the response was YES. [2023-12-05 20:59:46,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123784 conditions, 9681 events. 3548/9681 cut-off events. For 547790/550846 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 77277 event pairs, 548 based on Foata normal form. 3/9399 useless extension candidates. Maximal degree in co-relation 111135. Up to 5562 conditions per place. [2023-12-05 20:59:47,062 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 497 selfloop transitions, 9 changer transitions 14/1083 dead transitions. [2023-12-05 20:59:47,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 1083 transitions, 39869 flow [2023-12-05 20:59:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 20:59:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 20:59:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2463 transitions. [2023-12-05 20:59:47,064 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9308390022675737 [2023-12-05 20:59:47,064 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2463 transitions. [2023-12-05 20:59:47,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2463 transitions. [2023-12-05 20:59:47,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:47,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2463 transitions. [2023-12-05 20:59:47,067 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 20:59:47,068 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:59:47,068 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:59:47,068 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 232 predicate places. [2023-12-05 20:59:47,068 INFO L500 AbstractCegarLoop]: Abstraction has has 506 places, 1083 transitions, 39869 flow [2023-12-05 20:59:47,069 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 20:59:47,069 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:47,069 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 20:59:47,075 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 20:59:47,273 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 20:59:47,273 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 20:59:47,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1314089673, now seen corresponding path program 1 times [2023-12-05 20:59:47,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:47,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490605397] [2023-12-05 20:59:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:47,512 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 20:59:47,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490605397] [2023-12-05 20:59:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490605397] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 20:59:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278181878] [2023-12-05 20:59:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:47,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 20:59:47,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:59:47,514 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 20:59:47,541 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 20:59:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:47,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-05 20:59:47,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 20:59:47,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 20:59:47,718 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 20:59:47,729 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-05 20:59:47,730 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 20:59:47,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 20:59:47,741 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 20:59:48,265 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 20:59:48,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 20:59:48,722 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 20:59:48,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278181878] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 20:59:48,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 20:59:48,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2023-12-05 20:59:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844945450] [2023-12-05 20:59:48,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 20:59:48,723 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-05 20:59:48,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:48,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-05 20:59:48,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-12-05 20:59:48,725 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 294 [2023-12-05 20:59:48,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 1083 transitions, 39869 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 20:59:48,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:48,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 294 [2023-12-05 20:59:48,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:53,608 INFO L124 PetriNetUnfolderBase]: 4452/11904 cut-off events. [2023-12-05 20:59:53,608 INFO L125 PetriNetUnfolderBase]: For 754836/758531 co-relation queries the response was YES. [2023-12-05 20:59:53,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161431 conditions, 11904 events. 4452/11904 cut-off events. For 754836/758531 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 100715 event pairs, 571 based on Foata normal form. 83/11674 useless extension candidates. Maximal degree in co-relation 148226. Up to 7007 conditions per place. [2023-12-05 20:59:53,758 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 1120 selfloop transitions, 16 changer transitions 14/1388 dead transitions. [2023-12-05 20:59:53,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 1388 transitions, 55872 flow [2023-12-05 20:59:53,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 20:59:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 20:59:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2166 transitions. [2023-12-05 20:59:53,760 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6139455782312925 [2023-12-05 20:59:53,760 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2166 transitions. [2023-12-05 20:59:53,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2166 transitions. [2023-12-05 20:59:53,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:53,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2166 transitions. [2023-12-05 20:59:53,762 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 20:59:53,764 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:59:53,764 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:59:53,764 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 243 predicate places. [2023-12-05 20:59:53,765 INFO L500 AbstractCegarLoop]: Abstraction has has 517 places, 1388 transitions, 55872 flow [2023-12-05 20:59:53,765 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 20:59:53,765 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:53,765 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 20:59:53,784 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 20:59:53,969 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,SelfDestructingSolverStorable23 [2023-12-05 20:59:53,970 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 20:59:53,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash -576271438, now seen corresponding path program 2 times [2023-12-05 20:59:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:53,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735208946] [2023-12-05 20:59:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:55,860 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 20:59:55,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:55,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735208946] [2023-12-05 20:59:55,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735208946] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 20:59:55,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495157645] [2023-12-05 20:59:55,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-05 20:59:55,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 20:59:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:59:55,861 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 20:59:55,864 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 20:59:56,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-05 20:59:56,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 20:59:56,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-05 20:59:56,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 20:59:56,166 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-05 20:59:56,167 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:59:56,301 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 20:59:56,343 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 19 treesize of output 18 [2023-12-05 20:59:56,580 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 20:59:56,866 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-12-05 20:59:56,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2023-12-05 20:59:56,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 14 [2023-12-05 20:59:57,106 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 25 treesize of output 13 [2023-12-05 20:59:57,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 20:59:57,170 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:59:57,328 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-05 20:59:57,328 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2023-12-05 20:59:57,390 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 20:59:57,440 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 20:59:57,554 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 20:59:57,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 20:59:57,621 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 20:59:57,776 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 20:59:57,809 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 20:59:57,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 20:59:57,859 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 20:59:57,975 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_746 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_746) |c_~#queue~0.base|) .cse0) 801)) (forall ((v_ArrVal_746 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_746) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2023-12-05 20:59:58,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:58,014 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 20:59:58,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:58,019 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 38 treesize of output 37 [2023-12-05 20:59:58,027 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 7 treesize of output 3 [2023-12-05 20:59:58,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 20:59:58,030 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 20:59:58,031 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-05 20:59:58,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 20:59:58,033 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 27 treesize of output 15 [2023-12-05 21:00:35,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:35,092 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 951 treesize of output 567 [2023-12-05 21:00:35,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:35,108 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 887 treesize of output 861 [2023-12-05 21:00:35,124 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 817 treesize of output 785 [2023-12-05 21:00:35,138 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 805 treesize of output 773 [2023-12-05 21:00:35,148 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 801 treesize of output 777 [2023-12-05 21:00:35,160 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 803 treesize of output 779 [2023-12-05 21:00:35,174 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 785 treesize of output 777 [2023-12-05 21:00:35,186 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 777 treesize of output 769 [2023-12-05 21:00:35,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 8 [2023-12-05 21:00:36,261 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-12-05 21:00:36,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:00:36,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 893 treesize of output 723 [2023-12-05 21:00:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-12-05 21:00:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495157645] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:00:36,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:00:36,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 32] total 90 [2023-12-05 21:00:36,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833899564] [2023-12-05 21:00:36,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:00:36,974 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2023-12-05 21:00:36,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:36,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2023-12-05 21:00:36,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=7326, Unknown=54, NotChecked=176, Total=8190 [2023-12-05 21:00:36,982 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 294 [2023-12-05 21:00:36,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 1388 transitions, 55872 flow. Second operand has 91 states, 91 states have (on average 143.43956043956044) internal successors, (13053), 91 states have internal predecessors, (13053), 0 states have call successors, (0), 0 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:36,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:36,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 294 [2023-12-05 21:00:36,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:01:19,192 INFO L124 PetriNetUnfolderBase]: 7248/19650 cut-off events. [2023-12-05 21:01:19,192 INFO L125 PetriNetUnfolderBase]: For 1288599/1295641 co-relation queries the response was YES. [2023-12-05 21:01:19,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272785 conditions, 19650 events. 7248/19650 cut-off events. For 1288599/1295641 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 186832 event pairs, 1030 based on Foata normal form. 170/19259 useless extension candidates. Maximal degree in co-relation 247348. Up to 11336 conditions per place. [2023-12-05 21:01:19,501 INFO L140 encePairwiseOnDemand]: 257/294 looper letters, 1866 selfloop transitions, 294 changer transitions 24/2317 dead transitions. [2023-12-05 21:01:19,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 2317 transitions, 101488 flow [2023-12-05 21:01:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-12-05 21:01:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2023-12-05 21:01:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 11000 transitions. [2023-12-05 21:01:19,511 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5056076484647913 [2023-12-05 21:01:19,511 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 11000 transitions. [2023-12-05 21:01:19,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 11000 transitions. [2023-12-05 21:01:19,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:01:19,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 11000 transitions. [2023-12-05 21:01:19,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 75 states, 74 states have (on average 148.64864864864865) internal successors, (11000), 74 states have internal predecessors, (11000), 0 states have call successors, (0), 0 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:19,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 75 states, 75 states have (on average 294.0) internal successors, (22050), 75 states have internal predecessors, (22050), 0 states have call successors, (0), 0 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:19,542 INFO L81 ComplementDD]: Finished complementDD. Result has 75 states, 75 states have (on average 294.0) internal successors, (22050), 75 states have internal predecessors, (22050), 0 states have call successors, (0), 0 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:19,542 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 316 predicate places. [2023-12-05 21:01:19,542 INFO L500 AbstractCegarLoop]: Abstraction has has 590 places, 2317 transitions, 101488 flow [2023-12-05 21:01:19,544 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 143.43956043956044) internal successors, (13053), 91 states have internal predecessors, (13053), 0 states have call successors, (0), 0 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:19,544 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:01:19,545 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:19,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-05 21:01:19,750 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:01:19,750 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:19,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:01:19,750 INFO L85 PathProgramCache]: Analyzing trace with hash 743015464, now seen corresponding path program 3 times [2023-12-05 21:01:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:01:19,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44243846] [2023-12-05 21:01:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:01:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:01:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:01:21,974 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:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:01:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44243846] [2023-12-05 21:01:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44243846] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:01:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360707938] [2023-12-05 21:01:21,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-05 21:01:21,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:01:21,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:01:21,976 INFO L229 MonitoredProcess]: Starting monitored process 8 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:21,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-05 21:01:22,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-05 21:01:22,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-05 21:01:22,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 94 conjunts are in the unsatisfiable core [2023-12-05 21:01:22,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:01:22,304 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-05 21:01:22,304 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:01:22,347 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-05 21:01:22,347 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:01:22,495 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:01:22,543 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 19 treesize of output 18 [2023-12-05 21:01:22,906 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 23 treesize of output 16 [2023-12-05 21:01:23,227 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-12-05 21:01:23,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2023-12-05 21:01:23,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 14 [2023-12-05 21:01:23,493 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 25 treesize of output 13 [2023-12-05 21:01:23,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:01:23,580 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:01:23,800 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-05 21:01:23,800 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2023-12-05 21:01:23,884 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:01:24,089 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 32 treesize of output 16 [2023-12-05 21:01:24,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:01:24,198 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:01:24,359 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:01:24,470 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:01:24,507 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:24,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:01:24,727 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_834 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_834 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-12-05 21:01:24,899 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-12-05 21:01:24,906 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |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:01:24,912 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |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:01:24,964 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-12-05 21:01:25,486 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)))) (or (< .cse0 0) (forall ((v_ArrVal_830 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* 4 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse0 v_ArrVal_830))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (let ((.cse5 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)))) (or (< .cse5 0) (forall ((v_ArrVal_830 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* 4 (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse7 .cse5 v_ArrVal_830))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))) is different from false [2023-12-05 21:01:25,641 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse5 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_830 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_830))) (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse7 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (let ((.cse8 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_830 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store (store (store .cse1 |c_~#queue~0.base| (let ((.cse6 (store .cse7 .cse8 v_ArrVal_830))) (store (store .cse6 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse6 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse8 0))))))) is different from false [2023-12-05 21:01:25,661 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (let ((.cse5 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)))) (or (forall ((v_ArrVal_830 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_830))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse5 0))))) (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (let ((.cse8 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)))) (or (forall ((v_ArrVal_830 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse6 (store .cse7 .cse8 v_ArrVal_830))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse8 0))))))) is different from false [2023-12-05 21:02:15,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_823 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_823))) (let ((.cse8 (select .cse1 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_825 Int)) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_825))) (let ((.cse7 (select .cse6 .cse4))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse5 (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse6 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 0) (forall ((v_ArrVal_830 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_subst_2 Int)) (<= (+ (* (select (select (store (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_830))) (store (store .cse2 .cse3 (+ v_subst_2 1)) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (= 800 .cse7))))) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_823 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_823))) (let ((.cse15 (select .cse9 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_825 Int)) (let ((.cse13 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_825))) (let ((.cse14 (select .cse13 .cse4))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse11 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse13 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (let ((.cse12 (+ |c_~#queue~0.offset| (* (select .cse11 .cse4) 4)))) (or (forall ((v_ArrVal_830 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_subst_1 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 v_ArrVal_830))) (store (store .cse10 .cse3 (+ v_subst_1 1)) .cse4 (+ (select .cse10 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_834) |c_~#queue~0.base|) .cse4) 4)))) (< .cse12 0))))) (= 800 .cse14))))) (< (select .cse15 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|))))))) is different from false [2023-12-05 21:02:15,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:02:15,996 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 1118 treesize of output 1122 [2023-12-05 21:02:19,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:02:19,085 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 1464 treesize of output 870 [2023-12-05 21:02:19,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:02:19,108 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 1570 treesize of output 1538 [2023-12-05 21:02:19,134 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 983 treesize of output 959 [2023-12-05 21:02:19,148 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 959 treesize of output 943 [2023-12-05 21:02:19,161 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 943 treesize of output 935 [2023-12-05 21:02:19,179 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 935 treesize of output 927 [2023-12-05 21:02:19,192 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 927 treesize of output 919 [2023-12-05 21:02:19,207 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 955 treesize of output 931 [2023-12-05 21:02:19,222 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 931 treesize of output 927 [2023-12-05 21:02:19,232 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-12-05 21:02:19,238 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 927 treesize of output 919 [2023-12-05 21:02:19,267 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 919 treesize of output 911 [2023-12-05 21:02:19,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 928 treesize of output 916 [2023-12-05 21:02:19,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 8 [2023-12-05 21:02:21,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-05 21:02:21,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2332 treesize of output 1942 [2023-12-05 21:02:22,659 INFO L349 Elim1Store]: treesize reduction 18, result has 63.3 percent of original size [2023-12-05 21:02:22,659 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 44 treesize of output 64 [2023-12-05 21:02:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2023-12-05 21:02:22,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360707938] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:02:22,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:02:22,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 35] total 96 [2023-12-05 21:02:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899231915] [2023-12-05 21:02:22,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:02:22,736 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2023-12-05 21:02:22,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-12-05 21:02:22,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=6936, Unknown=122, NotChecked=1620, Total=9312 [2023-12-05 21:02:22,744 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 294 [2023-12-05 21:02:22,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 2317 transitions, 101488 flow. Second operand has 97 states, 97 states have (on average 142.28865979381445) internal successors, (13802), 97 states have internal predecessors, (13802), 0 states have call successors, (0), 0 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:02:22,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:22,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 294 [2023-12-05 21:02:22,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-05 21:02:32,397 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-05 21:02:32,397 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:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-05 21:02:32,410 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 100 remaining) [2023-12-05 21:02:32,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-05 21:02:32,616 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:02:32,616 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). [2023-12-05 21:02:32,618 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 100 remaining) [2023-12-05 21:02:32,618 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 100 remaining) [2023-12-05 21:02:32,619 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (79 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 100 remaining) [2023-12-05 21:02:32,620 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 100 remaining) [2023-12-05 21:02:32,621 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 100 remaining) [2023-12-05 21:02:32,621 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 100 remaining) [2023-12-05 21:02:32,621 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 100 remaining) [2023-12-05 21:02:32,621 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 100 remaining) [2023-12-05 21:02:32,621 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 100 remaining) [2023-12-05 21:02:32,622 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 100 remaining) [2023-12-05 21:02:32,623 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 100 remaining) [2023-12-05 21:02:32,624 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 100 remaining) [2023-12-05 21:02:32,625 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 100 remaining) [2023-12-05 21:02:32,626 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 100 remaining) [2023-12-05 21:02:32,626 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 100 remaining) [2023-12-05 21:02:32,626 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 100 remaining) [2023-12-05 21:02:32,626 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 100 remaining) [2023-12-05 21:02:32,626 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 100 remaining) [2023-12-05 21:02:32,626 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:32,632 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:02:32,632 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:02:32,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:02:32 BasicIcfg [2023-12-05 21:02:32,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:02:32,636 INFO L158 Benchmark]: Toolchain (without parser) took 253095.89ms. Allocated memory was 184.5MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 118.2MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-12-05 21:02:32,636 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:02:32,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.60ms. Allocated memory was 184.5MB in the beginning and 283.1MB in the end (delta: 98.6MB). Free memory was 117.9MB in the beginning and 238.4MB in the end (delta: -120.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-05 21:02:32,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.44ms. Allocated memory is still 283.1MB. Free memory was 238.4MB in the beginning and 235.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:02:32,636 INFO L158 Benchmark]: Boogie Preprocessor took 45.85ms. Allocated memory is still 283.1MB. Free memory was 235.3MB in the beginning and 233.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:02:32,636 INFO L158 Benchmark]: RCFGBuilder took 692.94ms. Allocated memory is still 283.1MB. Free memory was 233.1MB in the beginning and 201.8MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-05 21:02:32,637 INFO L158 Benchmark]: TraceAbstraction took 251762.41ms. Allocated memory was 283.1MB in the beginning and 6.8GB in the end (delta: 6.5GB). Free memory was 200.7MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-12-05 21:02:32,638 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 184.5MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 539.60ms. Allocated memory was 184.5MB in the beginning and 283.1MB in the end (delta: 98.6MB). Free memory was 117.9MB in the beginning and 238.4MB in the end (delta: -120.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.44ms. Allocated memory is still 283.1MB. Free memory was 238.4MB in the beginning and 235.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.85ms. Allocated memory is still 283.1MB. Free memory was 235.3MB in the beginning and 233.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 692.94ms. Allocated memory is still 283.1MB. Free memory was 233.1MB in the beginning and 201.8MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 251762.41ms. Allocated memory was 283.1MB in the beginning and 6.8GB in the end (delta: 6.5GB). Free memory was 200.7MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 3.0GB. 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 enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (97states, 140/294 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 926 conditions, 81 events (3/80 cut-off events. For 3788/3790 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 80 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 859. Up to 19 conditions per place.). - 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: 251.5s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 108.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10666 SdHoareTripleChecker+Valid, 20.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10666 mSDsluCounter, 5222 SdHoareTripleChecker+Invalid, 18.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4244 IncrementalHoareTripleChecker+Unchecked, 4671 mSDsCounter, 655 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25154 IncrementalHoareTripleChecker+Invalid, 30053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 655 mSolverCounterUnsat, 551 mSDtfsCounter, 25154 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2370 GetRequests, 1516 SyntacticMatches, 42 SemanticMatches, 812 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 18535 ImplicationChecksByTransitivity, 152.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101488occurred in iteration=25, InterpolantAutomatonStates: 389, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 139.9s InterpolantComputationTime, 3149 NumberOfCodeBlocks, 3149 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3895 ConstructedInterpolants, 374 QuantifiedInterpolants, 159676 SizeOfPredicates, 159 NumberOfNonLiveVariables, 2665 ConjunctsInSsa, 397 ConjunctsInUnsatCore, 39 InterpolantComputations, 20 PerfectInterpolantSequences, 43/564 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