/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:31:22,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:31:22,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 05:31:22,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:31:22,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:31:22,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:31:22,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:31:22,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:31:22,543 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:31:22,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:31:22,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:31:22,544 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:31:22,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:31:22,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:31:22,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:31:22,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:31:22,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:31:22,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:31:22,546 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:31:22,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:31:22,547 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:31:22,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:31:22,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:31:22,548 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:31:22,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:31:22,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:31:22,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:31:22,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:31:22,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:31:22,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:31:22,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:31:22,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:31:22,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:31:22,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 05:31:22,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:31:22,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:31:22,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:31:22,750 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:31:22,751 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:31:22,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2023-11-30 05:31:23,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:31:23,964 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:31:23,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2023-11-30 05:31:23,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba2fe565/f170c3b164ec4d84aa96916bd21b6171/FLAG1e24b6852 [2023-11-30 05:31:23,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba2fe565/f170c3b164ec4d84aa96916bd21b6171 [2023-11-30 05:31:23,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:31:23,987 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:31:23,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:31:23,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:31:23,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:31:23,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:31:23" (1/1) ... [2023-11-30 05:31:23,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c26bdf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:23, skipping insertion in model container [2023-11-30 05:31:23,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:31:23" (1/1) ... [2023-11-30 05:31:24,012 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:31:24,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:31:24,152 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:31:24,173 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:31:24,186 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:31:24,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24 WrapperNode [2023-11-30 05:31:24,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:31:24,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:31:24,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:31:24,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:31:24,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,220 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2023-11-30 05:31:24,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:31:24,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:31:24,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:31:24,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:31:24,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:31:24,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:31:24,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:31:24,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:31:24,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (1/1) ... [2023-11-30 05:31:24,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:31:24,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:31:24,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 05:31:24,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 05:31:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:31:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 05:31:24,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 05:31:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 05:31:24,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 05:31:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 05:31:24,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 05:31:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 05:31:24,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 05:31:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:31:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-30 05:31:24,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-30 05:31:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-30 05:31:24,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-30 05:31:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:31:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:31:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:31:24,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:31:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:31:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:31:24,318 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 05:31:24,407 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:31:24,409 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:31:24,766 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:31:24,777 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:31:24,777 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-30 05:31:24,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:31:24 BoogieIcfgContainer [2023-11-30 05:31:24,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:31:24,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:31:24,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:31:24,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:31:24,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:31:23" (1/3) ... [2023-11-30 05:31:24,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fc8332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:31:24, skipping insertion in model container [2023-11-30 05:31:24,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:31:24" (2/3) ... [2023-11-30 05:31:24,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fc8332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:31:24, skipping insertion in model container [2023-11-30 05:31:24,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:31:24" (3/3) ... [2023-11-30 05:31:24,786 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2023-11-30 05:31:24,799 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:31:24,799 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-11-30 05:31:24,800 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:31:24,891 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-30 05:31:24,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 204 transitions, 450 flow [2023-11-30 05:31:24,992 INFO L124 PetriNetUnfolderBase]: 14/198 cut-off events. [2023-11-30 05:31:24,992 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 05:31:25,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 198 events. 14/198 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 144 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 140. Up to 2 conditions per place. [2023-11-30 05:31:25,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 204 transitions, 450 flow [2023-11-30 05:31:25,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 168 transitions, 369 flow [2023-11-30 05:31:25,014 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:31:25,020 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;@5239f52e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:31:25,020 INFO L363 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-11-30 05:31:25,043 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:31:25,043 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2023-11-30 05:31:25,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:31:25,044 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:25,044 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:25,045 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:25,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2101352699, now seen corresponding path program 1 times [2023-11-30 05:31:25,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:25,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436821397] [2023-11-30 05:31:25,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:25,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:25,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436821397] [2023-11-30 05:31:25,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436821397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:25,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:25,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805488778] [2023-11-30 05:31:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:25,939 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:25,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:25,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:25,977 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 204 [2023-11-30 05:31:25,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 168 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:25,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:25,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 204 [2023-11-30 05:31:25,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:26,122 INFO L124 PetriNetUnfolderBase]: 6/159 cut-off events. [2023-11-30 05:31:26,122 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-30 05:31:26,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 159 events. 6/159 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 109/249 useless extension candidates. Maximal degree in co-relation 160. Up to 41 conditions per place. [2023-11-30 05:31:26,129 INFO L140 encePairwiseOnDemand]: 194/204 looper letters, 44 selfloop transitions, 1 changer transitions 1/159 dead transitions. [2023-11-30 05:31:26,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 159 transitions, 441 flow [2023-11-30 05:31:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-11-30 05:31:26,147 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7696078431372549 [2023-11-30 05:31:26,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-11-30 05:31:26,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-11-30 05:31:26,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:26,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-11-30 05:31:26,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:26,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:26,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:26,166 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 05:31:26,167 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 159 transitions, 441 flow [2023-11-30 05:31:26,167 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:26,168 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:26,168 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:26,168 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:31:26,169 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:26,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2101352698, now seen corresponding path program 1 times [2023-11-30 05:31:26,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:26,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855855398] [2023-11-30 05:31:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:26,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:26,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:26,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855855398] [2023-11-30 05:31:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855855398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:26,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:26,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 05:31:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770704558] [2023-11-30 05:31:26,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:26,596 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 05:31:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:26,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 05:31:26,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-30 05:31:26,598 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 204 [2023-11-30 05:31:26,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 159 transitions, 441 flow. Second operand has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:26,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:26,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 204 [2023-11-30 05:31:26,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:26,708 INFO L124 PetriNetUnfolderBase]: 6/157 cut-off events. [2023-11-30 05:31:26,709 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-30 05:31:26,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 157 events. 6/157 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 189. Up to 49 conditions per place. [2023-11-30 05:31:26,710 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 52 selfloop transitions, 1 changer transitions 1/157 dead transitions. [2023-11-30 05:31:26,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 157 transitions, 539 flow [2023-11-30 05:31:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-11-30 05:31:26,713 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-30 05:31:26,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-11-30 05:31:26,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-11-30 05:31:26,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:26,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-11-30 05:31:26,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:26,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:26,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:26,717 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 05:31:26,718 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 157 transitions, 539 flow [2023-11-30 05:31:26,718 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:26,718 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:26,718 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:26,719 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:31:26,720 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:26,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1077671333, now seen corresponding path program 1 times [2023-11-30 05:31:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:26,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702315848] [2023-11-30 05:31:26,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:26,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:26,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:26,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702315848] [2023-11-30 05:31:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702315848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:26,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:26,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:26,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743196951] [2023-11-30 05:31:26,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:26,936 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:26,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:26,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:26,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:26,939 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 204 [2023-11-30 05:31:26,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 157 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:26,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:26,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 204 [2023-11-30 05:31:26,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:27,023 INFO L124 PetriNetUnfolderBase]: 6/155 cut-off events. [2023-11-30 05:31:27,023 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-30 05:31:27,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 155 events. 6/155 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 212. Up to 47 conditions per place. [2023-11-30 05:31:27,025 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 42 selfloop transitions, 1 changer transitions 1/155 dead transitions. [2023-11-30 05:31:27,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 155 transitions, 613 flow [2023-11-30 05:31:27,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2023-11-30 05:31:27,027 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7549019607843137 [2023-11-30 05:31:27,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2023-11-30 05:31:27,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2023-11-30 05:31:27,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:27,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2023-11-30 05:31:27,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,031 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 05:31:27,031 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 155 transitions, 613 flow [2023-11-30 05:31:27,032 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,032 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:27,032 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:27,032 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:31:27,032 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:27,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:27,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1077671334, now seen corresponding path program 1 times [2023-11-30 05:31:27,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:27,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515161754] [2023-11-30 05:31:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:27,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515161754] [2023-11-30 05:31:27,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515161754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:27,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:27,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:31:27,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217769297] [2023-11-30 05:31:27,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:27,297 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:31:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:27,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:31:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:31:27,302 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 204 [2023-11-30 05:31:27,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 155 transitions, 613 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:27,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 204 [2023-11-30 05:31:27,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:27,391 INFO L124 PetriNetUnfolderBase]: 6/153 cut-off events. [2023-11-30 05:31:27,391 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-11-30 05:31:27,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 153 events. 6/153 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 2/140 useless extension candidates. Maximal degree in co-relation 238. Up to 45 conditions per place. [2023-11-30 05:31:27,393 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 48 selfloop transitions, 1 changer transitions 1/153 dead transitions. [2023-11-30 05:31:27,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 153 transitions, 699 flow [2023-11-30 05:31:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-30 05:31:27,394 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2023-11-30 05:31:27,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-30 05:31:27,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-30 05:31:27,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:27,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-30 05:31:27,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,399 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 05:31:27,399 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 153 transitions, 699 flow [2023-11-30 05:31:27,399 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,399 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:27,400 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:27,400 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:31:27,400 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:27,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:27,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1922145531, now seen corresponding path program 1 times [2023-11-30 05:31:27,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:27,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286586456] [2023-11-30 05:31:27,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:27,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:27,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286586456] [2023-11-30 05:31:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286586456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:27,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:27,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:27,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683692038] [2023-11-30 05:31:27,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:27,568 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:27,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:27,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:27,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:27,569 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 204 [2023-11-30 05:31:27,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 153 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:27,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 204 [2023-11-30 05:31:27,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:27,627 INFO L124 PetriNetUnfolderBase]: 6/151 cut-off events. [2023-11-30 05:31:27,628 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2023-11-30 05:31:27,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 151 events. 6/151 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 258. Up to 43 conditions per place. [2023-11-30 05:31:27,629 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 40 selfloop transitions, 1 changer transitions 1/151 dead transitions. [2023-11-30 05:31:27,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 151 transitions, 761 flow [2023-11-30 05:31:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-11-30 05:31:27,631 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7516339869281046 [2023-11-30 05:31:27,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-11-30 05:31:27,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-11-30 05:31:27,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:27,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-11-30 05:31:27,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,635 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 05:31:27,635 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 151 transitions, 761 flow [2023-11-30 05:31:27,635 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,635 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:27,635 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:27,636 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:31:27,636 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:27,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1922145530, now seen corresponding path program 1 times [2023-11-30 05:31:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:27,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839176427] [2023-11-30 05:31:27,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:27,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:27,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839176427] [2023-11-30 05:31:27,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839176427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:27,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:27,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:31:27,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282775503] [2023-11-30 05:31:27,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:27,880 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:31:27,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:27,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:31:27,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:31:27,882 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 204 [2023-11-30 05:31:27,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 151 transitions, 761 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:27,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 204 [2023-11-30 05:31:27,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:27,969 INFO L124 PetriNetUnfolderBase]: 6/149 cut-off events. [2023-11-30 05:31:27,969 INFO L125 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2023-11-30 05:31:27,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 149 events. 6/149 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 281. Up to 41 conditions per place. [2023-11-30 05:31:27,971 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 44 selfloop transitions, 1 changer transitions 1/149 dead transitions. [2023-11-30 05:31:27,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 149 transitions, 835 flow [2023-11-30 05:31:27,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-11-30 05:31:27,973 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7091503267973857 [2023-11-30 05:31:27,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-11-30 05:31:27,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-11-30 05:31:27,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:27,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-11-30 05:31:27,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,979 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2023-11-30 05:31:27,979 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 149 transitions, 835 flow [2023-11-30 05:31:27,980 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:27,980 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:27,980 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:27,980 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:31:27,980 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:27,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1692750145, now seen corresponding path program 1 times [2023-11-30 05:31:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:27,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559467206] [2023-11-30 05:31:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559467206] [2023-11-30 05:31:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559467206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:28,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:28,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:31:28,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287337511] [2023-11-30 05:31:28,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:28,203 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:31:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:28,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:31:28,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:31:28,207 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 204 [2023-11-30 05:31:28,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 149 transitions, 835 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:28,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 204 [2023-11-30 05:31:28,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:28,279 INFO L124 PetriNetUnfolderBase]: 6/145 cut-off events. [2023-11-30 05:31:28,279 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2023-11-30 05:31:28,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 145 events. 6/145 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 295. Up to 37 conditions per place. [2023-11-30 05:31:28,281 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 40 selfloop transitions, 1 changer transitions 1/145 dead transitions. [2023-11-30 05:31:28,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 145 transitions, 873 flow [2023-11-30 05:31:28,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-11-30 05:31:28,283 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2023-11-30 05:31:28,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-11-30 05:31:28,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-11-30 05:31:28,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:28,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-11-30 05:31:28,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,287 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -2 predicate places. [2023-11-30 05:31:28,287 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 145 transitions, 873 flow [2023-11-30 05:31:28,287 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,288 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:28,288 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:28,288 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 05:31:28,288 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:28,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1526765144, now seen corresponding path program 1 times [2023-11-30 05:31:28,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:28,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253589562] [2023-11-30 05:31:28,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:28,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:28,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:28,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253589562] [2023-11-30 05:31:28,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253589562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:28,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:28,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:28,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352305607] [2023-11-30 05:31:28,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:28,452 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:28,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:28,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:28,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:28,453 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 204 [2023-11-30 05:31:28,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 145 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:28,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 204 [2023-11-30 05:31:28,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:28,513 INFO L124 PetriNetUnfolderBase]: 6/143 cut-off events. [2023-11-30 05:31:28,514 INFO L125 PetriNetUnfolderBase]: For 507/507 co-relation queries the response was YES. [2023-11-30 05:31:28,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 143 events. 6/143 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 312. Up to 35 conditions per place. [2023-11-30 05:31:28,516 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 35 selfloop transitions, 1 changer transitions 1/143 dead transitions. [2023-11-30 05:31:28,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 143 transitions, 925 flow [2023-11-30 05:31:28,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2023-11-30 05:31:28,517 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7728758169934641 [2023-11-30 05:31:28,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2023-11-30 05:31:28,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2023-11-30 05:31:28,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:28,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2023-11-30 05:31:28,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,521 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -2 predicate places. [2023-11-30 05:31:28,521 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 143 transitions, 925 flow [2023-11-30 05:31:28,521 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,521 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:28,522 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:28,522 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 05:31:28,522 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:28,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:28,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1526765143, now seen corresponding path program 1 times [2023-11-30 05:31:28,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:28,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364936375] [2023-11-30 05:31:28,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:28,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:28,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:28,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364936375] [2023-11-30 05:31:28,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364936375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:28,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:28,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:28,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483452718] [2023-11-30 05:31:28,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:28,611 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:28,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:28,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:28,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:28,613 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 204 [2023-11-30 05:31:28,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 143 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:28,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 204 [2023-11-30 05:31:28,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:28,667 INFO L124 PetriNetUnfolderBase]: 6/141 cut-off events. [2023-11-30 05:31:28,667 INFO L125 PetriNetUnfolderBase]: For 621/621 co-relation queries the response was YES. [2023-11-30 05:31:28,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 141 events. 6/141 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 325. Up to 33 conditions per place. [2023-11-30 05:31:28,669 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 34 selfloop transitions, 1 changer transitions 1/141 dead transitions. [2023-11-30 05:31:28,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 141 transitions, 959 flow [2023-11-30 05:31:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-11-30 05:31:28,670 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7418300653594772 [2023-11-30 05:31:28,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-11-30 05:31:28,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-11-30 05:31:28,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:28,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-11-30 05:31:28,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,673 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -2 predicate places. [2023-11-30 05:31:28,673 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 141 transitions, 959 flow [2023-11-30 05:31:28,674 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,674 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:28,674 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:28,674 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:31:28,674 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:28,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:28,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1139990050, now seen corresponding path program 1 times [2023-11-30 05:31:28,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:28,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70944992] [2023-11-30 05:31:28,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:28,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:28,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70944992] [2023-11-30 05:31:28,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70944992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:28,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:28,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:28,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152167069] [2023-11-30 05:31:28,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:28,768 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:28,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:28,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:28,769 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 204 [2023-11-30 05:31:28,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 141 transitions, 959 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:28,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 204 [2023-11-30 05:31:28,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:28,824 INFO L124 PetriNetUnfolderBase]: 6/139 cut-off events. [2023-11-30 05:31:28,824 INFO L125 PetriNetUnfolderBase]: For 782/782 co-relation queries the response was YES. [2023-11-30 05:31:28,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 139 events. 6/139 cut-off events. For 782/782 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 340. Up to 31 conditions per place. [2023-11-30 05:31:28,826 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 33 selfloop transitions, 1 changer transitions 1/139 dead transitions. [2023-11-30 05:31:28,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 139 transitions, 1003 flow [2023-11-30 05:31:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-11-30 05:31:28,828 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7696078431372549 [2023-11-30 05:31:28,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-11-30 05:31:28,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-11-30 05:31:28,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:28,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-11-30 05:31:28,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,831 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -2 predicate places. [2023-11-30 05:31:28,831 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 139 transitions, 1003 flow [2023-11-30 05:31:28,831 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,831 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:28,832 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:28,832 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 05:31:28,832 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:31:28,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1139990049, now seen corresponding path program 1 times [2023-11-30 05:31:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:28,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441834458] [2023-11-30 05:31:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:28,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:28,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441834458] [2023-11-30 05:31:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441834458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:28,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:28,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105116337] [2023-11-30 05:31:28,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:28,900 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:28,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:28,901 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 204 [2023-11-30 05:31:28,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 139 transitions, 1003 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:28,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 204 [2023-11-30 05:31:28,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:28,950 INFO L124 PetriNetUnfolderBase]: 6/137 cut-off events. [2023-11-30 05:31:28,950 INFO L125 PetriNetUnfolderBase]: For 920/920 co-relation queries the response was YES. [2023-11-30 05:31:28,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 137 events. 6/137 cut-off events. For 920/920 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 2/132 useless extension candidates. Maximal degree in co-relation 351. Up to 29 conditions per place. [2023-11-30 05:31:28,951 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 0 selfloop transitions, 0 changer transitions 137/137 dead transitions. [2023-11-30 05:31:28,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 137 transitions, 1029 flow [2023-11-30 05:31:28,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-11-30 05:31:28,953 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2023-11-30 05:31:28,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-11-30 05:31:28,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-11-30 05:31:28,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:28,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-11-30 05:31:28,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,957 INFO L307 CegarLoopForPetriNet]: 174 programPoint places, -2 predicate places. [2023-11-30 05:31:28,957 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 137 transitions, 1029 flow [2023-11-30 05:31:28,957 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:31:28,965 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bench-exp3x3.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 05:31:28,993 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 30 remaining) [2023-11-30 05:31:28,994 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2023-11-30 05:31:28,994 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2023-11-30 05:31:28,994 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2023-11-30 05:31:28,994 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2023-11-30 05:31:28,994 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2023-11-30 05:31:28,994 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2023-11-30 05:31:28,994 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2023-11-30 05:31:28,994 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2023-11-30 05:31:28,994 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2023-11-30 05:31:28,995 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2023-11-30 05:31:28,995 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2023-11-30 05:31:28,995 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2023-11-30 05:31:28,995 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2023-11-30 05:31:28,995 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2023-11-30 05:31:28,995 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2023-11-30 05:31:28,995 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2023-11-30 05:31:28,995 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2023-11-30 05:31:28,996 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2023-11-30 05:31:28,996 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2023-11-30 05:31:28,996 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2023-11-30 05:31:28,996 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2023-11-30 05:31:28,996 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 30 remaining) [2023-11-30 05:31:28,996 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2023-11-30 05:31:28,996 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 30 remaining) [2023-11-30 05:31:28,996 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 30 remaining) [2023-11-30 05:31:28,997 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 30 remaining) [2023-11-30 05:31:28,997 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 30 remaining) [2023-11-30 05:31:28,997 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 30 remaining) [2023-11-30 05:31:28,997 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 30 remaining) [2023-11-30 05:31:28,997 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 05:31:28,998 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:29,000 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 05:31:29,000 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 05:31:29,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 05:31:29 BasicIcfg [2023-11-30 05:31:29,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 05:31:29,006 INFO L158 Benchmark]: Toolchain (without parser) took 5019.97ms. Allocated memory was 331.4MB in the beginning and 656.4MB in the end (delta: 325.1MB). Free memory was 274.4MB in the beginning and 372.7MB in the end (delta: -98.3MB). Peak memory consumption was 228.6MB. Max. memory is 16.0GB. [2023-11-30 05:31:29,007 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 331.4MB. Free memory is still 281.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 05:31:29,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.12ms. Allocated memory is still 331.4MB. Free memory was 274.1MB in the beginning and 262.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 05:31:29,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.18ms. Allocated memory is still 331.4MB. Free memory was 262.3MB in the beginning and 260.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 05:31:29,007 INFO L158 Benchmark]: Boogie Preprocessor took 37.82ms. Allocated memory is still 331.4MB. Free memory was 260.5MB in the beginning and 258.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 05:31:29,008 INFO L158 Benchmark]: RCFGBuilder took 518.87ms. Allocated memory was 331.4MB in the beginning and 545.3MB in the end (delta: 213.9MB). Free memory was 258.6MB in the beginning and 505.2MB in the end (delta: -246.6MB). Peak memory consumption was 24.2MB. Max. memory is 16.0GB. [2023-11-30 05:31:29,008 INFO L158 Benchmark]: TraceAbstraction took 4225.53ms. Allocated memory was 545.3MB in the beginning and 656.4MB in the end (delta: 111.1MB). Free memory was 504.8MB in the beginning and 372.7MB in the end (delta: 132.0MB). Peak memory consumption was 244.2MB. Max. memory is 16.0GB. [2023-11-30 05:31:29,009 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.14ms. Allocated memory is still 331.4MB. Free memory is still 281.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 199.12ms. Allocated memory is still 331.4MB. Free memory was 274.1MB in the beginning and 262.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.18ms. Allocated memory is still 331.4MB. Free memory was 262.3MB in the beginning and 260.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 37.82ms. Allocated memory is still 331.4MB. Free memory was 260.5MB in the beginning and 258.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 518.87ms. Allocated memory was 331.4MB in the beginning and 545.3MB in the end (delta: 213.9MB). Free memory was 258.6MB in the beginning and 505.2MB in the end (delta: -246.6MB). Peak memory consumption was 24.2MB. Max. memory is 16.0GB. * TraceAbstraction took 4225.53ms. Allocated memory was 545.3MB in the beginning and 656.4MB in the end (delta: 111.1MB). Free memory was 504.8MB in the beginning and 372.7MB in the end (delta: 132.0MB). Peak memory consumption was 244.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 233 locations, 30 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: 4.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 441 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 441 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 440 IncrementalHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 80 mSDtfsCounter, 440 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1029occurred in iteration=11, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 723 NumberOfCodeBlocks, 723 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 3973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 05:31:29,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...