/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/bench-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:19:21,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:19:21,613 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:21,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:19:21,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:19:21,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:19:21,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:19:21,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:19:21,646 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:19:21,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:19:21,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:19:21,650 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:19:21,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:19:21,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:19:21,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:19:21,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:19:21,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:19:21,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:19:21,651 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:19:21,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:19:21,652 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:19:21,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:19:21,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:19:21,653 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:19:21,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:19:21,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:19:21,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:19:21,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:19:21,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:19:21,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:19:21,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:19:21,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:19:21,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:19:21,655 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:21,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:19:21,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:19:21,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:19:21,863 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:19:21,864 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:19:21,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-12-05 21:19:22,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:19:23,048 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:19:23,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-12-05 21:19:23,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f85562de/02127f3bb4a1433ab3e6ba73236cc9b5/FLAG966f212a2 [2023-12-05 21:19:23,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f85562de/02127f3bb4a1433ab3e6ba73236cc9b5 [2023-12-05 21:19:23,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:19:23,069 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:19:23,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:19:23,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:19:23,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:19:23,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad68bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23, skipping insertion in model container [2023-12-05 21:19:23,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,097 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:19:23,268 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:19:23,279 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:19:23,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:19:23,324 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:19:23,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23 WrapperNode [2023-12-05 21:19:23,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:19:23,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:19:23,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:19:23,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:19:23,331 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:23" (1/1) ... [2023-12-05 21:19:23,346 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:23" (1/1) ... [2023-12-05 21:19:23,372 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2023-12-05 21:19:23,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:19:23,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:19:23,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:19:23,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:19:23,379 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:23" (1/1) ... [2023-12-05 21:19:23,380 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:23" (1/1) ... [2023-12-05 21:19:23,391 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:23" (1/1) ... [2023-12-05 21:19:23,391 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:23" (1/1) ... [2023-12-05 21:19:23,398 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:23" (1/1) ... [2023-12-05 21:19:23,401 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:23" (1/1) ... [2023-12-05 21:19:23,402 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:23" (1/1) ... [2023-12-05 21:19:23,402 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:23" (1/1) ... [2023-12-05 21:19:23,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:19:23,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:19:23,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:19:23,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:19:23,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (1/1) ... [2023-12-05 21:19:23,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:19:23,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:19:23,457 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:23,466 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:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:19:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-05 21:19:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-05 21:19:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-05 21:19:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-05 21:19:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-05 21:19:23,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-05 21:19:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-12-05 21:19:23,484 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-12-05 21:19:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:19:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:19:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:19:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:19:23,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:19:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:19:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:19:23,485 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:23,579 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:19:23,580 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:19:23,815 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:19:23,826 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:19:23,826 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-05 21:19:23,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:19:23 BoogieIcfgContainer [2023-12-05 21:19:23,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:19:23,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:19:23,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:19:23,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:19:23,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:19:23" (1/3) ... [2023-12-05 21:19:23,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae4f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:19:23, skipping insertion in model container [2023-12-05 21:19:23,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:19:23" (2/3) ... [2023-12-05 21:19:23,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae4f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:19:23, skipping insertion in model container [2023-12-05 21:19:23,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:19:23" (3/3) ... [2023-12-05 21:19:23,850 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2023-12-05 21:19:23,863 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:19:23,863 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-12-05 21:19:23,863 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:19:23,956 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:19:23,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 152 transitions, 332 flow [2023-12-05 21:19:24,023 INFO L124 PetriNetUnfolderBase]: 10/148 cut-off events. [2023-12-05 21:19:24,023 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-12-05 21:19:24,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 148 events. 10/148 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-12-05 21:19:24,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 152 transitions, 332 flow [2023-12-05 21:19:24,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 122 transitions, 265 flow [2023-12-05 21:19:24,039 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:19:24,044 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;@332377e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:19:24,045 INFO L363 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-12-05 21:19:24,062 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:19:24,062 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-12-05 21:19:24,062 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:19:24,063 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:24,063 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] [2023-12-05 21:19:24,064 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:24,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1549068521, now seen corresponding path program 1 times [2023-12-05 21:19:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:24,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489725759] [2023-12-05 21:19:24,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:24,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:24,551 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:24,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:24,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489725759] [2023-12-05 21:19:24,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489725759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:24,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:24,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:24,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909355689] [2023-12-05 21:19:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:24,561 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:24,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:24,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:24,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:24,593 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 152 [2023-12-05 21:19:24,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 122 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have 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:24,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:24,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 152 [2023-12-05 21:19:24,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:24,678 INFO L124 PetriNetUnfolderBase]: 4/115 cut-off events. [2023-12-05 21:19:24,678 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:19:24,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 115 events. 4/115 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 49/151 useless extension candidates. Maximal degree in co-relation 113. Up to 27 conditions per place. [2023-12-05 21:19:24,683 INFO L140 encePairwiseOnDemand]: 144/152 looper letters, 30 selfloop transitions, 1 changer transitions 1/115 dead transitions. [2023-12-05 21:19:24,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 115 transitions, 313 flow [2023-12-05 21:19:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-12-05 21:19:24,695 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7741228070175439 [2023-12-05 21:19:24,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-12-05 21:19:24,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-12-05 21:19:24,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:24,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-12-05 21:19:24,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have 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:24,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:24,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:24,708 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2023-12-05 21:19:24,708 INFO L500 AbstractCegarLoop]: Abstraction has has 126 places, 115 transitions, 313 flow [2023-12-05 21:19:24,709 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have 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:24,709 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:24,709 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] [2023-12-05 21:19:24,709 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:19:24,710 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:24,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1549068520, now seen corresponding path program 1 times [2023-12-05 21:19:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:24,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235144488] [2023-12-05 21:19:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:24,937 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:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:24,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235144488] [2023-12-05 21:19:24,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235144488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:24,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:24,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:19:24,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067226649] [2023-12-05 21:19:24,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:24,939 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:19:24,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:24,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:19:24,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:19:24,942 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 152 [2023-12-05 21:19:24,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 115 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:24,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:24,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 152 [2023-12-05 21:19:24,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,032 INFO L124 PetriNetUnfolderBase]: 4/113 cut-off events. [2023-12-05 21:19:25,032 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-12-05 21:19:25,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 113 events. 4/113 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 132. Up to 31 conditions per place. [2023-12-05 21:19:25,036 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 34 selfloop transitions, 1 changer transitions 1/113 dead transitions. [2023-12-05 21:19:25,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 113 transitions, 375 flow [2023-12-05 21:19:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-12-05 21:19:25,041 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7324561403508771 [2023-12-05 21:19:25,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-12-05 21:19:25,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-12-05 21:19:25,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-12-05 21:19:25,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have 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:25,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,046 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2023-12-05 21:19:25,047 INFO L500 AbstractCegarLoop]: Abstraction has has 126 places, 113 transitions, 375 flow [2023-12-05 21:19:25,047 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:25,047 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:25,047 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] [2023-12-05 21:19:25,048 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:19:25,048 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:25,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1065463344, now seen corresponding path program 1 times [2023-12-05 21:19:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:25,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803576879] [2023-12-05 21:19:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:25,258 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:25,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803576879] [2023-12-05 21:19:25,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803576879] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:25,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:25,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:19:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751216546] [2023-12-05 21:19:25,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:25,259 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:19:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:19:25,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:19:25,260 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 152 [2023-12-05 21:19:25,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 113 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have 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:25,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:25,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 152 [2023-12-05 21:19:25,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,376 INFO L124 PetriNetUnfolderBase]: 4/109 cut-off events. [2023-12-05 21:19:25,376 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-12-05 21:19:25,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 109 events. 4/109 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 2/102 useless extension candidates. Maximal degree in co-relation 146. Up to 27 conditions per place. [2023-12-05 21:19:25,377 INFO L140 encePairwiseOnDemand]: 147/152 looper letters, 30 selfloop transitions, 1 changer transitions 1/109 dead transitions. [2023-12-05 21:19:25,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 109 transitions, 417 flow [2023-12-05 21:19:25,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-12-05 21:19:25,379 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7280701754385965 [2023-12-05 21:19:25,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-12-05 21:19:25,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-12-05 21:19:25,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-12-05 21:19:25,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have 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:25,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,383 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, -2 predicate places. [2023-12-05 21:19:25,383 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 109 transitions, 417 flow [2023-12-05 21:19:25,383 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have 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:25,383 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:25,383 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] [2023-12-05 21:19:25,383 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:19:25,384 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:25,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:25,385 INFO L85 PathProgramCache]: Analyzing trace with hash -382539520, now seen corresponding path program 1 times [2023-12-05 21:19:25,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:25,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229835531] [2023-12-05 21:19:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:25,454 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:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:25,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229835531] [2023-12-05 21:19:25,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229835531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:25,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:25,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359679935] [2023-12-05 21:19:25,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:25,455 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:25,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:25,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:25,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:25,456 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 152 [2023-12-05 21:19:25,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 109 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have 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:25,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:25,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 152 [2023-12-05 21:19:25,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,501 INFO L124 PetriNetUnfolderBase]: 4/107 cut-off events. [2023-12-05 21:19:25,502 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-05 21:19:25,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 107 events. 4/107 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 159. Up to 25 conditions per place. [2023-12-05 21:19:25,503 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 26 selfloop transitions, 1 changer transitions 1/107 dead transitions. [2023-12-05 21:19:25,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 107 transitions, 455 flow [2023-12-05 21:19:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-12-05 21:19:25,504 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2023-12-05 21:19:25,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-12-05 21:19:25,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-12-05 21:19:25,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-12-05 21:19:25,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have 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:25,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,507 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, -2 predicate places. [2023-12-05 21:19:25,507 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 455 flow [2023-12-05 21:19:25,507 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have 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:25,507 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:25,507 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] [2023-12-05 21:19:25,508 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:19:25,508 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:25,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash -382539519, now seen corresponding path program 1 times [2023-12-05 21:19:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:25,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199478267] [2023-12-05 21:19:25,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:25,583 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:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199478267] [2023-12-05 21:19:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199478267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:25,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:25,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:25,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138572911] [2023-12-05 21:19:25,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:25,584 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:25,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:25,586 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 152 [2023-12-05 21:19:25,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 107 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have 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:25,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:25,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 152 [2023-12-05 21:19:25,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,618 INFO L124 PetriNetUnfolderBase]: 4/105 cut-off events. [2023-12-05 21:19:25,619 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2023-12-05 21:19:25,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 105 events. 4/105 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 2/102 useless extension candidates. Maximal degree in co-relation 170. Up to 23 conditions per place. [2023-12-05 21:19:25,620 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 23 selfloop transitions, 1 changer transitions 1/105 dead transitions. [2023-12-05 21:19:25,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 105 transitions, 487 flow [2023-12-05 21:19:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-12-05 21:19:25,621 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7741228070175439 [2023-12-05 21:19:25,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-12-05 21:19:25,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-12-05 21:19:25,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-12-05 21:19:25,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have 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:25,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,624 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, -2 predicate places. [2023-12-05 21:19:25,624 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 105 transitions, 487 flow [2023-12-05 21:19:25,624 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have 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:25,624 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:25,624 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] [2023-12-05 21:19:25,624 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:19:25,625 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:25,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1428391243, now seen corresponding path program 1 times [2023-12-05 21:19:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:25,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814609066] [2023-12-05 21:19:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:25,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:25,684 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:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:25,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814609066] [2023-12-05 21:19:25,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814609066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:25,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:25,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:25,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52162887] [2023-12-05 21:19:25,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:25,685 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:25,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:25,686 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 152 [2023-12-05 21:19:25,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 105 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have 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:25,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:25,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 152 [2023-12-05 21:19:25,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,722 INFO L124 PetriNetUnfolderBase]: 4/103 cut-off events. [2023-12-05 21:19:25,723 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2023-12-05 21:19:25,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 103 events. 4/103 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 181. Up to 21 conditions per place. [2023-12-05 21:19:25,724 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 23 selfloop transitions, 1 changer transitions 1/103 dead transitions. [2023-12-05 21:19:25,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 103 transitions, 519 flow [2023-12-05 21:19:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-12-05 21:19:25,725 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7741228070175439 [2023-12-05 21:19:25,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-12-05 21:19:25,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-12-05 21:19:25,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-12-05 21:19:25,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have 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:25,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,728 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, -2 predicate places. [2023-12-05 21:19:25,728 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 103 transitions, 519 flow [2023-12-05 21:19:25,728 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have 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:25,728 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:19:25,728 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] [2023-12-05 21:19:25,728 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:19:25,729 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:19:25,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:19:25,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1428391244, now seen corresponding path program 1 times [2023-12-05 21:19:25,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:19:25,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055890084] [2023-12-05 21:19:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:19:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:19:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:19:25,771 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:25,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:19:25,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055890084] [2023-12-05 21:19:25,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055890084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:19:25,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:19:25,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:19:25,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736593650] [2023-12-05 21:19:25,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:19:25,772 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:19:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:19:25,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:19:25,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:19:25,773 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 152 [2023-12-05 21:19:25,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 103 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have 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:25,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:19:25,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 152 [2023-12-05 21:19:25,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:19:25,832 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2023-12-05 21:19:25,833 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2023-12-05 21:19:25,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 101 events. 4/101 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 2/98 useless extension candidates. Maximal degree in co-relation 190. Up to 19 conditions per place. [2023-12-05 21:19:25,833 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 0 selfloop transitions, 0 changer transitions 101/101 dead transitions. [2023-12-05 21:19:25,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 101 transitions, 541 flow [2023-12-05 21:19:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:19:25,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:19:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-12-05 21:19:25,835 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7456140350877193 [2023-12-05 21:19:25,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-12-05 21:19:25,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-12-05 21:19:25,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:19:25,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-12-05 21:19:25,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have 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:25,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:25,837 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, -2 predicate places. [2023-12-05 21:19:25,837 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 101 transitions, 541 flow [2023-12-05 21:19:25,837 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have 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:25,843 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bench-exp2x4.wvr.c_BEv2_AllErrorsAtOnce [2023-12-05 21:19:25,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 20 remaining) [2023-12-05 21:19:25,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-12-05 21:19:25,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-12-05 21:19:25,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-12-05 21:19:25,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-12-05 21:19:25,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-12-05 21:19:25,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-12-05 21:19:25,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-12-05 21:19:25,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-12-05 21:19:25,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-12-05 21:19:25,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-12-05 21:19:25,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-12-05 21:19:25,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-12-05 21:19:25,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-12-05 21:19:25,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-12-05 21:19:25,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-12-05 21:19:25,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 20 remaining) [2023-12-05 21:19:25,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 20 remaining) [2023-12-05 21:19:25,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 20 remaining) [2023-12-05 21:19:25,862 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 20 remaining) [2023-12-05 21:19:25,862 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:19:25,862 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:19:25,864 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:19:25,865 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:19:25,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:19:25 BasicIcfg [2023-12-05 21:19:25,869 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:19:25,870 INFO L158 Benchmark]: Toolchain (without parser) took 2800.92ms. Allocated memory was 191.9MB in the beginning and 267.4MB in the end (delta: 75.5MB). Free memory was 129.9MB in the beginning and 218.7MB in the end (delta: -88.8MB). Peak memory consumption was 125.7MB. Max. memory is 8.0GB. [2023-12-05 21:19:25,870 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:19:25,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.11ms. Allocated memory is still 191.9MB. Free memory was 129.6MB in the beginning and 118.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-05 21:19:25,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.93ms. Allocated memory is still 191.9MB. Free memory was 118.5MB in the beginning and 116.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:19:25,871 INFO L158 Benchmark]: Boogie Preprocessor took 31.14ms. Allocated memory is still 191.9MB. Free memory was 116.5MB in the beginning and 115.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:19:25,871 INFO L158 Benchmark]: RCFGBuilder took 423.04ms. Allocated memory was 191.9MB in the beginning and 267.4MB in the end (delta: 75.5MB). Free memory was 115.0MB in the beginning and 231.8MB in the end (delta: -116.8MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. [2023-12-05 21:19:25,871 INFO L158 Benchmark]: TraceAbstraction took 2040.31ms. Allocated memory is still 267.4MB. Free memory was 231.3MB in the beginning and 218.7MB in the end (delta: 12.6MB). Peak memory consumption was 149.9MB. Max. memory is 8.0GB. [2023-12-05 21:19:25,873 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.11ms. Allocated memory is still 191.9MB. Free memory was 129.6MB in the beginning and 118.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.93ms. Allocated memory is still 191.9MB. Free memory was 118.5MB in the beginning and 116.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.14ms. Allocated memory is still 191.9MB. Free memory was 116.5MB in the beginning and 115.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 423.04ms. Allocated memory was 191.9MB in the beginning and 267.4MB in the end (delta: 75.5MB). Free memory was 115.0MB in the beginning and 231.8MB in the end (delta: -116.8MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2040.31ms. Allocated memory is still 267.4MB. Free memory was 231.3MB in the beginning and 218.7MB in the end (delta: 12.6MB). Peak memory consumption was 149.9MB. 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 - 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 9 procedures, 175 locations, 20 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.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 44 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=541occurred in iteration=7, InterpolantAutomatonStates: 21, 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.9s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 1889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:19:25,887 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...