/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/spaghetti.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:40:35,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:40:35,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 05:40:35,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:40:35,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:40:35,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:40:35,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:40:35,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:40:35,951 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:40:35,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:40:35,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:40:35,954 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:40:35,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:40:35,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:40:35,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:40:35,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:40:35,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:40:35,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:40:35,955 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:40:35,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:40:35,956 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:40:35,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:40:35,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:40:35,957 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:40:35,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:40:35,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:40:35,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:40:35,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:40:35,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:40:35,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:40:35,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:40:35,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:40:35,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:40:35,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 05:40:36,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:40:36,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:40:36,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:40:36,162 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:40:36,163 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:40:36,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/spaghetti.wvr.c [2023-11-30 05:40:37,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:40:37,419 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:40:37,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c [2023-11-30 05:40:37,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadb2234d/c7e1e5d92c2a43a5bb9b4642bd8cd775/FLAGfae901a87 [2023-11-30 05:40:37,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadb2234d/c7e1e5d92c2a43a5bb9b4642bd8cd775 [2023-11-30 05:40:37,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:40:37,444 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:40:37,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:40:37,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:40:37,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:40:37,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccdd252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37, skipping insertion in model container [2023-11-30 05:40:37,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,472 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:40:37,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:40:37,595 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:40:37,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:40:37,616 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 05:40:37,617 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 05:40:37,621 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:40:37,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37 WrapperNode [2023-11-30 05:40:37,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:40:37,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:40:37,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:40:37,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:40:37,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,643 INFO L138 Inliner]: procedures = 23, calls = 60, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2023-11-30 05:40:37,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:40:37,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:40:37,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:40:37,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:40:37,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:40:37,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:40:37,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:40:37,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:40:37,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (1/1) ... [2023-11-30 05:40:37,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:40:37,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:40:37,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 05:40:37,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 05:40:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:40:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 05:40:37,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 05:40:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 05:40:37,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 05:40:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 05:40:37,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 05:40:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 05:40:37,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 05:40:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:40:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:40:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:40:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 05:40:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 05:40:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:40:37,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:40:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:40:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:40:37,715 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 05:40:37,804 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:40:37,806 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:40:37,991 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:40:38,004 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:40:38,004 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-30 05:40:38,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:40:38 BoogieIcfgContainer [2023-11-30 05:40:38,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:40:38,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:40:38,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:40:38,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:40:38,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:40:37" (1/3) ... [2023-11-30 05:40:38,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ace1988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:40:38, skipping insertion in model container [2023-11-30 05:40:38,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:40:37" (2/3) ... [2023-11-30 05:40:38,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ace1988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:40:38, skipping insertion in model container [2023-11-30 05:40:38,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:40:38" (3/3) ... [2023-11-30 05:40:38,010 INFO L112 eAbstractionObserver]: Analyzing ICFG spaghetti.wvr.c [2023-11-30 05:40:38,020 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:40:38,021 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-11-30 05:40:38,021 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:40:38,080 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 05:40:38,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 150 transitions, 328 flow [2023-11-30 05:40:38,146 INFO L124 PetriNetUnfolderBase]: 9/146 cut-off events. [2023-11-30 05:40:38,146 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 05:40:38,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 146 events. 9/146 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 192 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-30 05:40:38,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 150 transitions, 328 flow [2023-11-30 05:40:38,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 120 transitions, 261 flow [2023-11-30 05:40:38,162 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:40:38,166 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;@54989667, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:40:38,166 INFO L363 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-11-30 05:40:38,171 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:40:38,171 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 05:40:38,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:40:38,171 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:40:38,172 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:40:38,172 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-11-30 05:40:38,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:40:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1645873760, now seen corresponding path program 1 times [2023-11-30 05:40:38,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:40:38,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850000956] [2023-11-30 05:40:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:40:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:40:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:40:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:40:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:40:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850000956] [2023-11-30 05:40:38,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850000956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:40:38,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:40:38,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:40:38,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657638297] [2023-11-30 05:40:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:40:38,566 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:40:38,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:40:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:40:38,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:40:38,593 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 150 [2023-11-30 05:40:38,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:38,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:40:38,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 150 [2023-11-30 05:40:38,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:40:38,755 INFO L124 PetriNetUnfolderBase]: 42/250 cut-off events. [2023-11-30 05:40:38,755 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-30 05:40:38,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 250 events. 42/250 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 991 event pairs, 33 based on Foata normal form. 99/322 useless extension candidates. Maximal degree in co-relation 272. Up to 90 conditions per place. [2023-11-30 05:40:38,759 INFO L140 encePairwiseOnDemand]: 143/150 looper letters, 32 selfloop transitions, 1 changer transitions 0/114 dead transitions. [2023-11-30 05:40:38,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 114 transitions, 315 flow [2023-11-30 05:40:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:40:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:40:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-11-30 05:40:38,780 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2023-11-30 05:40:38,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-11-30 05:40:38,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-11-30 05:40:38,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:40:38,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-11-30 05:40:38,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:38,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:38,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:38,792 INFO L307 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2023-11-30 05:40:38,792 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 114 transitions, 315 flow [2023-11-30 05:40:38,793 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:38,793 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:40:38,793 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:40:38,793 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:40:38,793 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-11-30 05:40:38,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:40:38,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1645873759, now seen corresponding path program 1 times [2023-11-30 05:40:38,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:40:38,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847579593] [2023-11-30 05:40:38,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:40:38,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:40:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:40:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:40:38,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:40:38,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847579593] [2023-11-30 05:40:38,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847579593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:40:38,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:40:38,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:40:38,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301802452] [2023-11-30 05:40:38,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:40:38,992 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:40:38,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:40:38,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:40:38,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:40:38,994 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 150 [2023-11-30 05:40:38,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:38,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:40:38,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 150 [2023-11-30 05:40:38,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:40:39,090 INFO L124 PetriNetUnfolderBase]: 46/252 cut-off events. [2023-11-30 05:40:39,091 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-30 05:40:39,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 252 events. 46/252 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 981 event pairs, 37 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 339. Up to 102 conditions per place. [2023-11-30 05:40:39,094 INFO L140 encePairwiseOnDemand]: 147/150 looper letters, 36 selfloop transitions, 1 changer transitions 0/112 dead transitions. [2023-11-30 05:40:39,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 112 transitions, 381 flow [2023-11-30 05:40:39,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:40:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:40:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-11-30 05:40:39,096 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7266666666666667 [2023-11-30 05:40:39,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-11-30 05:40:39,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-11-30 05:40:39,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:40:39,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-11-30 05:40:39,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,099 INFO L307 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2023-11-30 05:40:39,100 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 112 transitions, 381 flow [2023-11-30 05:40:39,100 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,100 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:40:39,100 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:40:39,100 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:40:39,100 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-11-30 05:40:39,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:40:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1071883518, now seen corresponding path program 1 times [2023-11-30 05:40:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:40:39,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918930470] [2023-11-30 05:40:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:40:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:40:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:40:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:40:39,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:40:39,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918930470] [2023-11-30 05:40:39,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918930470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:40:39,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:40:39,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:40:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264696210] [2023-11-30 05:40:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:40:39,242 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:40:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:40:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:40:39,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:40:39,243 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 150 [2023-11-30 05:40:39,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 112 transitions, 381 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:40:39,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 150 [2023-11-30 05:40:39,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:40:39,315 INFO L124 PetriNetUnfolderBase]: 42/240 cut-off events. [2023-11-30 05:40:39,315 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-30 05:40:39,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 240 events. 42/240 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 912 event pairs, 33 based on Foata normal form. 4/226 useless extension candidates. Maximal degree in co-relation 385. Up to 90 conditions per place. [2023-11-30 05:40:39,319 INFO L140 encePairwiseOnDemand]: 145/150 looper letters, 32 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2023-11-30 05:40:39,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 108 transitions, 427 flow [2023-11-30 05:40:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:40:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:40:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-11-30 05:40:39,322 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-30 05:40:39,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-11-30 05:40:39,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-11-30 05:40:39,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:40:39,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-11-30 05:40:39,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,327 INFO L307 CegarLoopForPetriNet]: 125 programPoint places, -2 predicate places. [2023-11-30 05:40:39,327 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 108 transitions, 427 flow [2023-11-30 05:40:39,328 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,328 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:40:39,328 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:40:39,328 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:40:39,328 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-11-30 05:40:39,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:40:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash -944708709, now seen corresponding path program 1 times [2023-11-30 05:40:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:40:39,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938490205] [2023-11-30 05:40:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:40:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:40:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:40:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:40:39,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:40:39,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938490205] [2023-11-30 05:40:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938490205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:40:39,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:40:39,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:40:39,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505688856] [2023-11-30 05:40:39,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:40:39,379 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:40:39,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:40:39,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:40:39,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:40:39,380 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 150 [2023-11-30 05:40:39,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 108 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:40:39,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 150 [2023-11-30 05:40:39,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:40:39,436 INFO L124 PetriNetUnfolderBase]: 40/234 cut-off events. [2023-11-30 05:40:39,436 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-11-30 05:40:39,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 234 events. 40/234 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 854 event pairs, 31 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 428. Up to 84 conditions per place. [2023-11-30 05:40:39,439 INFO L140 encePairwiseOnDemand]: 147/150 looper letters, 28 selfloop transitions, 1 changer transitions 0/106 dead transitions. [2023-11-30 05:40:39,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 106 transitions, 469 flow [2023-11-30 05:40:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:40:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:40:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-11-30 05:40:39,440 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7488888888888889 [2023-11-30 05:40:39,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-11-30 05:40:39,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-11-30 05:40:39,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:40:39,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-11-30 05:40:39,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,443 INFO L307 CegarLoopForPetriNet]: 125 programPoint places, -2 predicate places. [2023-11-30 05:40:39,443 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 106 transitions, 469 flow [2023-11-30 05:40:39,444 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,444 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:40:39,444 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:40:39,444 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:40:39,444 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-11-30 05:40:39,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:40:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash -944708708, now seen corresponding path program 1 times [2023-11-30 05:40:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:40:39,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141126351] [2023-11-30 05:40:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:40:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:40:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:40:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:40:39,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:40:39,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141126351] [2023-11-30 05:40:39,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141126351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:40:39,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:40:39,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:40:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534751421] [2023-11-30 05:40:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:40:39,546 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:40:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:40:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:40:39,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:40:39,547 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 150 [2023-11-30 05:40:39,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 106 transitions, 469 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:40:39,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 150 [2023-11-30 05:40:39,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:40:39,606 INFO L124 PetriNetUnfolderBase]: 38/228 cut-off events. [2023-11-30 05:40:39,606 INFO L125 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2023-11-30 05:40:39,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 228 events. 38/228 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 832 event pairs, 29 based on Foata normal form. 4/218 useless extension candidates. Maximal degree in co-relation 471. Up to 78 conditions per place. [2023-11-30 05:40:39,608 INFO L140 encePairwiseOnDemand]: 147/150 looper letters, 28 selfloop transitions, 1 changer transitions 0/104 dead transitions. [2023-11-30 05:40:39,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 104 transitions, 511 flow [2023-11-30 05:40:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:40:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:40:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-11-30 05:40:39,609 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7088888888888889 [2023-11-30 05:40:39,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-11-30 05:40:39,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-11-30 05:40:39,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:40:39,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-11-30 05:40:39,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,614 INFO L307 CegarLoopForPetriNet]: 125 programPoint places, -2 predicate places. [2023-11-30 05:40:39,614 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 104 transitions, 511 flow [2023-11-30 05:40:39,615 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,615 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:40:39,615 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:40:39,616 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:40:39,618 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-11-30 05:40:39,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:40:39,619 INFO L85 PathProgramCache]: Analyzing trace with hash -264129598, now seen corresponding path program 1 times [2023-11-30 05:40:39,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:40:39,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625705758] [2023-11-30 05:40:39,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:40:39,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:40:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:40:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:40:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:40:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625705758] [2023-11-30 05:40:39,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625705758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:40:39,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:40:39,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:40:39,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478594958] [2023-11-30 05:40:39,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:40:39,690 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:40:39,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:40:39,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:40:39,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:40:39,691 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 150 [2023-11-30 05:40:39,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 104 transitions, 511 flow. Second operand has 3 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-11-30 05:40:39,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:40:39,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 150 [2023-11-30 05:40:39,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:40:39,735 INFO L124 PetriNetUnfolderBase]: 34/219 cut-off events. [2023-11-30 05:40:39,735 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2023-11-30 05:40:39,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 219 events. 34/219 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 770 event pairs, 25 based on Foata normal form. 5/210 useless extension candidates. Maximal degree in co-relation 479. Up to 69 conditions per place. [2023-11-30 05:40:39,738 INFO L140 encePairwiseOnDemand]: 147/150 looper letters, 25 selfloop transitions, 1 changer transitions 0/102 dead transitions. [2023-11-30 05:40:39,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 102 transitions, 547 flow [2023-11-30 05:40:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:40:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:40:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-11-30 05:40:39,739 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7688888888888888 [2023-11-30 05:40:39,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-11-30 05:40:39,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-11-30 05:40:39,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:40:39,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-11-30 05:40:39,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,743 INFO L307 CegarLoopForPetriNet]: 125 programPoint places, -2 predicate places. [2023-11-30 05:40:39,743 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 547 flow [2023-11-30 05:40:39,743 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-11-30 05:40:39,743 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:40:39,743 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:40:39,743 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:40:39,744 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-11-30 05:40:39,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:40:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash -264129599, now seen corresponding path program 1 times [2023-11-30 05:40:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:40:39,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825133783] [2023-11-30 05:40:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:40:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:40:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:40:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:40:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:40:39,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825133783] [2023-11-30 05:40:39,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825133783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:40:39,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:40:39,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:40:39,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642050285] [2023-11-30 05:40:39,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:40:39,784 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:40:39,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:40:39,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:40:39,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:40:39,785 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 150 [2023-11-30 05:40:39,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:40:39,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 150 [2023-11-30 05:40:39,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:40:39,821 INFO L124 PetriNetUnfolderBase]: 30/210 cut-off events. [2023-11-30 05:40:39,821 INFO L125 PetriNetUnfolderBase]: For 446/446 co-relation queries the response was YES. [2023-11-30 05:40:39,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 210 events. 30/210 cut-off events. For 446/446 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 720 event pairs, 21 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 463. Up to 60 conditions per place. [2023-11-30 05:40:39,823 INFO L140 encePairwiseOnDemand]: 147/150 looper letters, 0 selfloop transitions, 0 changer transitions 100/100 dead transitions. [2023-11-30 05:40:39,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 100 transitions, 569 flow [2023-11-30 05:40:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:40:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:40:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-11-30 05:40:39,824 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.74 [2023-11-30 05:40:39,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-11-30 05:40:39,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-11-30 05:40:39,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:40:39,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-11-30 05:40:39,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,827 INFO L307 CegarLoopForPetriNet]: 125 programPoint places, -2 predicate places. [2023-11-30 05:40:39,827 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 100 transitions, 569 flow [2023-11-30 05:40:39,827 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:40:39,833 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/spaghetti.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 05:40:39,854 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 20 remaining) [2023-11-30 05:40:39,854 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-11-30 05:40:39,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-11-30 05:40:39,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-11-30 05:40:39,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-11-30 05:40:39,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-11-30 05:40:39,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 20 remaining) [2023-11-30 05:40:39,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 20 remaining) [2023-11-30 05:40:39,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 20 remaining) [2023-11-30 05:40:39,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 20 remaining) [2023-11-30 05:40:39,856 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 05:40:39,857 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:40:39,858 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 05:40:39,859 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 05:40:39,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 05:40:39 BasicIcfg [2023-11-30 05:40:39,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 05:40:39,863 INFO L158 Benchmark]: Toolchain (without parser) took 2418.34ms. Allocated memory was 406.8MB in the beginning and 658.5MB in the end (delta: 251.7MB). Free memory was 345.7MB in the beginning and 507.6MB in the end (delta: -161.9MB). Peak memory consumption was 92.5MB. Max. memory is 16.0GB. [2023-11-30 05:40:39,863 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 406.8MB. Free memory is still 356.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 05:40:39,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.09ms. Allocated memory is still 406.8MB. Free memory was 345.3MB in the beginning and 333.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 05:40:39,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.95ms. Allocated memory is still 406.8MB. Free memory was 333.4MB in the beginning and 332.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 05:40:39,864 INFO L158 Benchmark]: Boogie Preprocessor took 17.54ms. Allocated memory is still 406.8MB. Free memory was 332.0MB in the beginning and 330.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 05:40:39,864 INFO L158 Benchmark]: RCFGBuilder took 343.93ms. Allocated memory is still 406.8MB. Free memory was 330.6MB in the beginning and 311.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-11-30 05:40:39,864 INFO L158 Benchmark]: TraceAbstraction took 1855.89ms. Allocated memory was 406.8MB in the beginning and 658.5MB in the end (delta: 251.7MB). Free memory was 311.1MB in the beginning and 507.6MB in the end (delta: -196.5MB). Peak memory consumption was 56.9MB. Max. memory is 16.0GB. [2023-11-30 05:40:39,865 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.09ms. Allocated memory is still 406.8MB. Free memory is still 356.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 175.09ms. Allocated memory is still 406.8MB. Free memory was 345.3MB in the beginning and 333.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 20.95ms. Allocated memory is still 406.8MB. Free memory was 333.4MB in the beginning and 332.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 17.54ms. Allocated memory is still 406.8MB. Free memory was 332.0MB in the beginning and 330.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 343.93ms. Allocated memory is still 406.8MB. Free memory was 330.6MB in the beginning and 311.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 1855.89ms. Allocated memory was 406.8MB in the beginning and 658.5MB in the end (delta: 251.7MB). Free memory was 311.1MB in the beginning and 507.6MB in the end (delta: -196.5MB). Peak memory consumption was 56.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 192 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.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 193 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 208 IncrementalHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 45 mSDtfsCounter, 208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred 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.8s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1103 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-11-30 05:40:39,878 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...