/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/chl-match-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:19:37,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:19:37,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:19:37,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:19:37,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:19:37,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:19:37,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:19:37,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:19:37,330 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:19:37,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:19:37,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:19:37,331 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:19:37,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:19:37,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:19:37,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:19:37,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:19:37,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:19:37,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:19:37,332 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:19:37,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:19:37,333 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:19:37,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:19:37,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:19:37,339 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:19:37,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:19:37,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:19:37,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:19:37,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:19:37,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:19:37,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:19:37,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:19:37,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:19:37,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:19:37,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:19:37,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:19:37,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:19:37,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:19:37,547 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:19:37,547 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:19:37,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-subst.wvr.c [2023-12-05 21:19:38,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:19:38,726 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:19:38,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-subst.wvr.c [2023-12-05 21:19:38,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598d69c59/71b56a5fe7fd43a19fcffb5bb718f726/FLAG590d00eb9 [2023-12-05 21:19:38,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598d69c59/71b56a5fe7fd43a19fcffb5bb718f726 [2023-12-05 21:19:38,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:19:38,745 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:19:38,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:19:38,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:19:38,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:19:38,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:38,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc8f921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38, skipping insertion in model container [2023-12-05 21:19:38,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:38,773 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:19:38,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:19:38,901 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:19:38,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:19:38,935 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:19:38,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38 WrapperNode [2023-12-05 21:19:38,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:19:38,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:19:38,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:19:38,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:19:38,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:38,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:38,968 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 13, calls inlined = 23, statements flattened = 219 [2023-12-05 21:19:38,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:19:38,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:19:38,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:19:38,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:19:38,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:38,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:38,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:38,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:38,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:38,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:39,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:39,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:39,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:19:39,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:19:39,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:19:39,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:19:39,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (1/1) ... [2023-12-05 21:19:39,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:19:39,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:19:39,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:19:39,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:19:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:19:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-05 21:19:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-05 21:19:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-05 21:19:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-05 21:19:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-05 21:19:39,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-05 21:19:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:19:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:19:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:19:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:19:39,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:19:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:19:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:19:39,079 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:19:39,192 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:19:39,194 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:19:39,510 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:19:39,531 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:19:39,531 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:19:39,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:19:39 BoogieIcfgContainer [2023-12-05 21:19:39,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:19:39,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:19:39,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:19:39,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:19:39,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:19:38" (1/3) ... [2023-12-05 21:19:39,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c419bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:19:39, skipping insertion in model container [2023-12-05 21:19:39,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:38" (2/3) ... [2023-12-05 21:19:39,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c419bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:19:39, skipping insertion in model container [2023-12-05 21:19:39,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:19:39" (3/3) ... [2023-12-05 21:19:39,538 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2023-12-05 21:19:39,552 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:19:39,552 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-12-05 21:19:39,553 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:19:39,657 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:19:39,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 311 transitions, 643 flow [2023-12-05 21:19:39,809 INFO L124 PetriNetUnfolderBase]: 14/308 cut-off events. [2023-12-05 21:19:39,809 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:19:39,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 308 events. 14/308 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 462 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 205. Up to 2 conditions per place. [2023-12-05 21:19:39,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 311 transitions, 643 flow [2023-12-05 21:19:39,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 276 transitions, 567 flow [2023-12-05 21:19:39,840 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:19:39,848 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;@7f206b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:19:39,848 INFO L363 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-12-05 21:19:39,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:19:39,857 INFO L124 PetriNetUnfolderBase]: 0/62 cut-off events. [2023-12-05 21:19:39,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:19:39,858 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:39,858 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:39,859 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:19:39,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1333410795, now seen corresponding path program 1 times [2023-12-05 21:19:39,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:39,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912600424] [2023-12-05 21:19:39,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:39,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:40,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:40,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912600424] [2023-12-05 21:19:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912600424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:40,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:40,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:40,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337977953] [2023-12-05 21:19:40,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:40,243 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:40,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:40,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:40,280 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 311 [2023-12-05 21:19:40,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 276 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:40,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 311 [2023-12-05 21:19:40,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:40,378 INFO L124 PetriNetUnfolderBase]: 0/262 cut-off events. [2023-12-05 21:19:40,378 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2023-12-05 21:19:40,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 262 events. 0/262 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 430 event pairs, 0 based on Foata normal form. 53/297 useless extension candidates. Maximal degree in co-relation 0. Up to 20 conditions per place. [2023-12-05 21:19:40,380 INFO L140 encePairwiseOnDemand]: 296/311 looper letters, 22 selfloop transitions, 1 changer transitions 1/262 dead transitions. [2023-12-05 21:19:40,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 262 transitions, 587 flow [2023-12-05 21:19:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 830 transitions. [2023-12-05 21:19:40,396 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8896034297963559 [2023-12-05 21:19:40,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 830 transitions. [2023-12-05 21:19:40,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 830 transitions. [2023-12-05 21:19:40,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:40,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 830 transitions. [2023-12-05 21:19:40,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.6666666666667) internal successors, (830), 3 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,414 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 0 predicate places. [2023-12-05 21:19:40,415 INFO L500 AbstractCegarLoop]: Abstraction has has 274 places, 262 transitions, 587 flow [2023-12-05 21:19:40,415 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,415 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:40,415 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:40,416 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:19:40,416 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:19:40,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1333410794, now seen corresponding path program 1 times [2023-12-05 21:19:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:40,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915271453] [2023-12-05 21:19:40,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:40,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:40,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915271453] [2023-12-05 21:19:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915271453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:40,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:40,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:19:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37958034] [2023-12-05 21:19:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:40,677 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:19:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:19:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:19:40,679 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 311 [2023-12-05 21:19:40,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 262 transitions, 587 flow. Second operand has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:40,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 311 [2023-12-05 21:19:40,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:40,754 INFO L124 PetriNetUnfolderBase]: 0/260 cut-off events. [2023-12-05 21:19:40,755 INFO L125 PetriNetUnfolderBase]: For 25/104 co-relation queries the response was YES. [2023-12-05 21:19:40,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 260 events. 0/260 cut-off events. For 25/104 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 424 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 0. Up to 22 conditions per place. [2023-12-05 21:19:40,756 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 24 selfloop transitions, 1 changer transitions 1/260 dead transitions. [2023-12-05 21:19:40,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 260 transitions, 631 flow [2023-12-05 21:19:40,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 808 transitions. [2023-12-05 21:19:40,759 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8660235798499464 [2023-12-05 21:19:40,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 808 transitions. [2023-12-05 21:19:40,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 808 transitions. [2023-12-05 21:19:40,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:40,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 808 transitions. [2023-12-05 21:19:40,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,764 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 0 predicate places. [2023-12-05 21:19:40,764 INFO L500 AbstractCegarLoop]: Abstraction has has 274 places, 260 transitions, 631 flow [2023-12-05 21:19:40,765 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,765 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:40,765 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:40,765 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:19:40,766 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:19:40,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1155063797, now seen corresponding path program 1 times [2023-12-05 21:19:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:40,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825658913] [2023-12-05 21:19:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825658913] [2023-12-05 21:19:40,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825658913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:40,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:40,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509676348] [2023-12-05 21:19:40,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:40,907 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:40,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:40,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:40,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:40,911 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 311 [2023-12-05 21:19:40,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 260 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:40,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 311 [2023-12-05 21:19:40,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:40,968 INFO L124 PetriNetUnfolderBase]: 0/258 cut-off events. [2023-12-05 21:19:40,969 INFO L125 PetriNetUnfolderBase]: For 64/189 co-relation queries the response was YES. [2023-12-05 21:19:40,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 258 events. 0/258 cut-off events. For 64/189 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 417 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 0. Up to 20 conditions per place. [2023-12-05 21:19:40,974 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 20 selfloop transitions, 1 changer transitions 1/258 dead transitions. [2023-12-05 21:19:40,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 258 transitions, 663 flow [2023-12-05 21:19:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2023-12-05 21:19:40,976 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8745980707395499 [2023-12-05 21:19:40,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2023-12-05 21:19:40,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2023-12-05 21:19:40,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:40,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2023-12-05 21:19:40,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.0) internal successors, (816), 3 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-12-05 21:19:40,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,981 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 0 predicate places. [2023-12-05 21:19:40,981 INFO L500 AbstractCegarLoop]: Abstraction has has 274 places, 258 transitions, 663 flow [2023-12-05 21:19:40,981 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:40,981 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:40,982 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:40,982 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:19:40,982 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:19:40,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1155063796, now seen corresponding path program 1 times [2023-12-05 21:19:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:40,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419120233] [2023-12-05 21:19:40,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:40,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:41,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:41,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419120233] [2023-12-05 21:19:41,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419120233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:41,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:41,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961357964] [2023-12-05 21:19:41,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:41,108 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:41,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:41,113 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 311 [2023-12-05 21:19:41,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 258 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:41,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 311 [2023-12-05 21:19:41,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:41,186 INFO L124 PetriNetUnfolderBase]: 0/256 cut-off events. [2023-12-05 21:19:41,186 INFO L125 PetriNetUnfolderBase]: For 130/282 co-relation queries the response was YES. [2023-12-05 21:19:41,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 256 events. 0/256 cut-off events. For 130/282 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 411 event pairs, 0 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 0. Up to 18 conditions per place. [2023-12-05 21:19:41,187 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 17 selfloop transitions, 1 changer transitions 1/256 dead transitions. [2023-12-05 21:19:41,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 256 transitions, 689 flow [2023-12-05 21:19:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2023-12-05 21:19:41,189 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8810289389067524 [2023-12-05 21:19:41,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 822 transitions. [2023-12-05 21:19:41,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 822 transitions. [2023-12-05 21:19:41,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:41,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 822 transitions. [2023-12-05 21:19:41,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,194 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 0 predicate places. [2023-12-05 21:19:41,195 INFO L500 AbstractCegarLoop]: Abstraction has has 274 places, 256 transitions, 689 flow [2023-12-05 21:19:41,195 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,195 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:41,195 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:41,195 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:19:41,199 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:19:41,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:41,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1022927570, now seen corresponding path program 1 times [2023-12-05 21:19:41,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:41,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563367704] [2023-12-05 21:19:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:41,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:41,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563367704] [2023-12-05 21:19:41,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563367704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:41,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:41,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173488535] [2023-12-05 21:19:41,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:41,271 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:41,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:41,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:41,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:41,272 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 311 [2023-12-05 21:19:41,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 256 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:41,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 311 [2023-12-05 21:19:41,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:41,328 INFO L124 PetriNetUnfolderBase]: 0/254 cut-off events. [2023-12-05 21:19:41,329 INFO L125 PetriNetUnfolderBase]: For 190/357 co-relation queries the response was YES. [2023-12-05 21:19:41,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 254 events. 0/254 cut-off events. For 190/357 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 407 event pairs, 0 based on Foata normal form. 2/244 useless extension candidates. Maximal degree in co-relation 0. Up to 16 conditions per place. [2023-12-05 21:19:41,330 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 17 selfloop transitions, 1 changer transitions 1/254 dead transitions. [2023-12-05 21:19:41,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 254 transitions, 715 flow [2023-12-05 21:19:41,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2023-12-05 21:19:41,331 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8810289389067524 [2023-12-05 21:19:41,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 822 transitions. [2023-12-05 21:19:41,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 822 transitions. [2023-12-05 21:19:41,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:41,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 822 transitions. [2023-12-05 21:19:41,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,336 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 0 predicate places. [2023-12-05 21:19:41,337 INFO L500 AbstractCegarLoop]: Abstraction has has 274 places, 254 transitions, 715 flow [2023-12-05 21:19:41,337 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,337 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:41,337 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:41,337 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:19:41,337 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-05 21:19:41,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1022927569, now seen corresponding path program 1 times [2023-12-05 21:19:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:41,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360429864] [2023-12-05 21:19:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:19:41,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:41,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360429864] [2023-12-05 21:19:41,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360429864] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:41,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:41,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095815381] [2023-12-05 21:19:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:41,390 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:41,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:41,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:41,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:41,392 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 311 [2023-12-05 21:19:41,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 254 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:41,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 311 [2023-12-05 21:19:41,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:41,460 INFO L124 PetriNetUnfolderBase]: 0/252 cut-off events. [2023-12-05 21:19:41,461 INFO L125 PetriNetUnfolderBase]: For 259/414 co-relation queries the response was YES. [2023-12-05 21:19:41,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 252 events. 0/252 cut-off events. For 259/414 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 400 event pairs, 0 based on Foata normal form. 2/242 useless extension candidates. Maximal degree in co-relation 0. Up to 14 conditions per place. [2023-12-05 21:19:41,461 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 0 selfloop transitions, 0 changer transitions 252/252 dead transitions. [2023-12-05 21:19:41,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 252 transitions, 731 flow [2023-12-05 21:19:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2023-12-05 21:19:41,463 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8703108252947481 [2023-12-05 21:19:41,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2023-12-05 21:19:41,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2023-12-05 21:19:41,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:41,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2023-12-05 21:19:41,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,468 INFO L308 CegarLoopForPetriNet]: 274 programPoint places, 0 predicate places. [2023-12-05 21:19:41,469 INFO L500 AbstractCegarLoop]: Abstraction has has 274 places, 252 transitions, 731 flow [2023-12-05 21:19:41,469 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:19:41,480 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/chl-match-subst.wvr.c_BEv2_AllErrorsAtOnce [2023-12-05 21:19:41,512 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2023-12-05 21:19:41,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2023-12-05 21:19:41,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-12-05 21:19:41,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-12-05 21:19:41,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-12-05 21:19:41,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-12-05 21:19:41,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-12-05 21:19:41,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-12-05 21:19:41,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-12-05 21:19:41,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-12-05 21:19:41,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2023-12-05 21:19:41,514 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2023-12-05 21:19:41,514 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-12-05 21:19:41,514 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-12-05 21:19:41,514 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 15 remaining) [2023-12-05 21:19:41,514 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:19:41,514 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:19:41,516 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:19:41,516 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:19:41,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:19:41 BasicIcfg [2023-12-05 21:19:41,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:19:41,524 INFO L158 Benchmark]: Toolchain (without parser) took 2778.75ms. Allocated memory was 217.1MB in the beginning and 300.9MB in the end (delta: 83.9MB). Free memory was 152.5MB in the beginning and 229.3MB in the end (delta: -76.8MB). Peak memory consumption was 150.1MB. Max. memory is 8.0GB. [2023-12-05 21:19:41,525 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 217.1MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:19:41,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.18ms. Allocated memory is still 217.1MB. Free memory was 152.1MB in the beginning and 140.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-05 21:19:41,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.86ms. Allocated memory is still 217.1MB. Free memory was 140.6MB in the beginning and 138.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:19:41,525 INFO L158 Benchmark]: Boogie Preprocessor took 40.98ms. Allocated memory was 217.1MB in the beginning and 300.9MB in the end (delta: 83.9MB). Free memory was 138.0MB in the beginning and 266.9MB in the end (delta: -128.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-05 21:19:41,525 INFO L158 Benchmark]: RCFGBuilder took 522.58ms. Allocated memory is still 300.9MB. Free memory was 266.9MB in the beginning and 242.6MB in the end (delta: 24.3MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-05 21:19:41,526 INFO L158 Benchmark]: TraceAbstraction took 1988.99ms. Allocated memory is still 300.9MB. Free memory was 241.6MB in the beginning and 229.3MB in the end (delta: 12.3MB). Peak memory consumption was 154.3MB. Max. memory is 8.0GB. [2023-12-05 21:19:41,527 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 217.1MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.18ms. Allocated memory is still 217.1MB. Free memory was 152.1MB in the beginning and 140.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.86ms. Allocated memory is still 217.1MB. Free memory was 140.6MB in the beginning and 138.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.98ms. Allocated memory was 217.1MB in the beginning and 300.9MB in the end (delta: 83.9MB). Free memory was 138.0MB in the beginning and 266.9MB in the end (delta: -128.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 522.58ms. Allocated memory is still 300.9MB. Free memory was 266.9MB in the beginning and 242.6MB in the end (delta: 24.3MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1988.99ms. Allocated memory is still 300.9MB. Free memory was 241.6MB in the beginning and 229.3MB in the end (delta: 12.3MB). Peak memory consumption was 154.3MB. Max. memory is 8.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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 472 locations, 15 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: 1.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 34 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=731occurred in iteration=6, InterpolantAutomatonStates: 18, 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.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 402 ConstructedInterpolants, 0 QuantifiedInterpolants, 2063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:19:41,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...