/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/parallel-simple-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:34:54,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:34:54,067 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:34:54,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:34:54,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:34:54,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:34:54,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:34:54,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:34:54,097 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:34:54,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:34:54,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:34:54,098 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:34:54,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:34:54,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:34:54,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:34:54,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:34:54,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:34:54,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:34:54,099 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:34:54,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:34:54,100 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:34:54,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:34:54,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:34:54,101 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:34:54,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:34:54,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:34:54,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:34:54,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:34:54,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:34:54,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:34:54,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:34:54,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:34:54,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:34:54,103 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:34:54,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:34:54,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:34:54,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:34:54,261 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:34:54,262 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:34:54,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-simple-equiv.wvr.c [2023-11-30 05:34:55,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:34:55,311 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:34:55,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-simple-equiv.wvr.c [2023-11-30 05:34:55,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a894184a4/2b3cccc1517945098d40fba020b3f16f/FLAG4cbed0ff0 [2023-11-30 05:34:55,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a894184a4/2b3cccc1517945098d40fba020b3f16f [2023-11-30 05:34:55,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:34:55,731 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:34:55,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:34:55,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:34:55,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:34:55,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4cd348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55, skipping insertion in model container [2023-11-30 05:34:55,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,750 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:34:55,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:34:55,848 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:34:55,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:34:55,864 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 05:34:55,864 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 05:34:55,868 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:34:55,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55 WrapperNode [2023-11-30 05:34:55,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:34:55,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:34:55,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:34:55,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:34:55,874 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:34:55" (1/1) ... [2023-11-30 05:34:55,879 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:34:55" (1/1) ... [2023-11-30 05:34:55,890 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2023-11-30 05:34:55,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:34:55,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:34:55,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:34:55,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:34:55,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:34:55,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:34:55,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:34:55,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:34:55,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55" (1/1) ... [2023-11-30 05:34:55,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:34:55,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:34:55,936 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:34:55,946 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:34:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:34:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 05:34:55,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 05:34:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 05:34:55,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 05:34:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 05:34:55,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 05:34:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:34:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:34:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:34:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 05:34:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 05:34:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:34:55,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:34:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:34:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:34:55,970 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:34:56,075 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:34:56,079 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:34:56,299 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:34:56,324 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:34:56,324 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 05:34:56,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:34:56 BoogieIcfgContainer [2023-11-30 05:34:56,325 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:34:56,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:34:56,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:34:56,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:34:56,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:34:55" (1/3) ... [2023-11-30 05:34:56,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6027a8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:34:56, skipping insertion in model container [2023-11-30 05:34:56,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:34:55" (2/3) ... [2023-11-30 05:34:56,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6027a8eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:34:56, skipping insertion in model container [2023-11-30 05:34:56,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:34:56" (3/3) ... [2023-11-30 05:34:56,330 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-simple-equiv.wvr.c [2023-11-30 05:34:56,341 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:34:56,341 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-30 05:34:56,341 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:34:56,379 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 05:34:56,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 241 flow [2023-11-30 05:34:56,439 INFO L124 PetriNetUnfolderBase]: 2/107 cut-off events. [2023-11-30 05:34:56,439 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 05:34:56,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-30 05:34:56,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 241 flow [2023-11-30 05:34:56,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 82 transitions, 179 flow [2023-11-30 05:34:56,451 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:34:56,455 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;@26bc8434, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:34:56,455 INFO L363 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-30 05:34:56,462 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:34:56,462 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-11-30 05:34:56,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:34:56,462 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:56,462 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] [2023-11-30 05:34:56,463 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-30 05:34:56,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:56,466 INFO L85 PathProgramCache]: Analyzing trace with hash -628302603, now seen corresponding path program 1 times [2023-11-30 05:34:56,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:56,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759216687] [2023-11-30 05:34:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:56,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:56,725 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:34:56,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:56,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759216687] [2023-11-30 05:34:56,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759216687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:56,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:56,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:34:56,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227897493] [2023-11-30 05:34:56,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:56,736 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:34:56,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:56,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:34:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:34:56,756 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 110 [2023-11-30 05:34:56,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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:34:56,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:56,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 110 [2023-11-30 05:34:56,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:56,821 INFO L124 PetriNetUnfolderBase]: 27/177 cut-off events. [2023-11-30 05:34:56,821 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 05:34:56,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 177 events. 27/177 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 566 event pairs, 27 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 190. Up to 70 conditions per place. [2023-11-30 05:34:56,824 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 24 selfloop transitions, 1 changer transitions 1/79 dead transitions. [2023-11-30 05:34:56,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 79 transitions, 223 flow [2023-11-30 05:34:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:34:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:34:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2023-11-30 05:34:56,833 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7484848484848485 [2023-11-30 05:34:56,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 247 transitions. [2023-11-30 05:34:56,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 247 transitions. [2023-11-30 05:34:56,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:56,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 247 transitions. [2023-11-30 05:34:56,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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:34:56,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:56,840 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:56,843 INFO L307 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2023-11-30 05:34:56,843 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 223 flow [2023-11-30 05:34:56,843 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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:34:56,843 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:56,843 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] [2023-11-30 05:34:56,843 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:34:56,844 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-30 05:34:56,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash -628302602, now seen corresponding path program 1 times [2023-11-30 05:34:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:56,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051765784] [2023-11-30 05:34:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:57,073 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:34:57,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:57,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051765784] [2023-11-30 05:34:57,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051765784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:57,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:57,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:34:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156875877] [2023-11-30 05:34:57,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:57,076 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:34:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:57,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:34:57,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:34:57,079 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 110 [2023-11-30 05:34:57,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:34:57,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:57,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 110 [2023-11-30 05:34:57,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:57,160 INFO L124 PetriNetUnfolderBase]: 29/183 cut-off events. [2023-11-30 05:34:57,160 INFO L125 PetriNetUnfolderBase]: For 31/37 co-relation queries the response was YES. [2023-11-30 05:34:57,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 183 events. 29/183 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 619 event pairs, 29 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 249. Up to 76 conditions per place. [2023-11-30 05:34:57,164 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 26 selfloop transitions, 1 changer transitions 1/77 dead transitions. [2023-11-30 05:34:57,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 77 transitions, 269 flow [2023-11-30 05:34:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:34:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:34:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2023-11-30 05:34:57,170 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2023-11-30 05:34:57,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 236 transitions. [2023-11-30 05:34:57,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 236 transitions. [2023-11-30 05:34:57,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:57,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 236 transitions. [2023-11-30 05:34:57,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 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:34:57,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:57,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:57,176 INFO L307 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2023-11-30 05:34:57,176 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 269 flow [2023-11-30 05:34:57,176 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:34:57,176 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:57,176 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] [2023-11-30 05:34:57,177 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:34:57,177 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-30 05:34:57,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1104689593, now seen corresponding path program 1 times [2023-11-30 05:34:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821773184] [2023-11-30 05:34:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:57,301 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:34:57,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:57,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821773184] [2023-11-30 05:34:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821773184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:57,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:57,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:34:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642713032] [2023-11-30 05:34:57,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:57,302 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:34:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:34:57,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:34:57,304 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 110 [2023-11-30 05:34:57,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 77 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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:34:57,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:57,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 110 [2023-11-30 05:34:57,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:57,348 INFO L124 PetriNetUnfolderBase]: 27/175 cut-off events. [2023-11-30 05:34:57,348 INFO L125 PetriNetUnfolderBase]: For 83/105 co-relation queries the response was YES. [2023-11-30 05:34:57,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 175 events. 27/175 cut-off events. For 83/105 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 575 event pairs, 27 based on Foata normal form. 3/166 useless extension candidates. Maximal degree in co-relation 289. Up to 70 conditions per place. [2023-11-30 05:34:57,352 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 21 selfloop transitions, 1 changer transitions 1/75 dead transitions. [2023-11-30 05:34:57,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 75 transitions, 305 flow [2023-11-30 05:34:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:34:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:34:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2023-11-30 05:34:57,353 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2023-11-30 05:34:57,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 252 transitions. [2023-11-30 05:34:57,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 252 transitions. [2023-11-30 05:34:57,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:57,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 252 transitions. [2023-11-30 05:34:57,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:34:57,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:57,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:57,357 INFO L307 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2023-11-30 05:34:57,357 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 305 flow [2023-11-30 05:34:57,357 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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:34:57,358 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:57,358 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] [2023-11-30 05:34:57,358 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:34:57,358 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-30 05:34:57,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1104689594, now seen corresponding path program 1 times [2023-11-30 05:34:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:57,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958018772] [2023-11-30 05:34:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:57,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-11-30 05:34:57,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958018772] [2023-11-30 05:34:57,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958018772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:57,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:57,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:34:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310256037] [2023-11-30 05:34:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:57,455 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:34:57,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:57,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:34:57,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:34:57,457 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 110 [2023-11-30 05:34:57,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:34:57,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:57,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 110 [2023-11-30 05:34:57,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:57,496 INFO L124 PetriNetUnfolderBase]: 25/167 cut-off events. [2023-11-30 05:34:57,497 INFO L125 PetriNetUnfolderBase]: For 152/182 co-relation queries the response was YES. [2023-11-30 05:34:57,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 167 events. 25/167 cut-off events. For 152/182 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 530 event pairs, 25 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 321. Up to 64 conditions per place. [2023-11-30 05:34:57,498 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 20 selfloop transitions, 1 changer transitions 1/73 dead transitions. [2023-11-30 05:34:57,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 73 transitions, 331 flow [2023-11-30 05:34:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:34:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:34:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-11-30 05:34:57,499 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-30 05:34:57,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-11-30 05:34:57,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-11-30 05:34:57,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:57,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-11-30 05:34:57,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:34:57,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:57,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:57,502 INFO L307 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2023-11-30 05:34:57,503 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 331 flow [2023-11-30 05:34:57,503 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:34:57,503 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:57,503 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:34:57,503 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:34:57,504 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-30 05:34:57,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:57,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1302622621, now seen corresponding path program 1 times [2023-11-30 05:34:57,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:57,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199254289] [2023-11-30 05:34:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:57,563 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:34:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199254289] [2023-11-30 05:34:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199254289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:57,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:34:57,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76168874] [2023-11-30 05:34:57,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:57,565 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:34:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:57,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:34:57,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:34:57,566 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 110 [2023-11-30 05:34:57,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 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:34:57,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:57,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 110 [2023-11-30 05:34:57,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:57,599 INFO L124 PetriNetUnfolderBase]: 21/154 cut-off events. [2023-11-30 05:34:57,600 INFO L125 PetriNetUnfolderBase]: For 244/288 co-relation queries the response was YES. [2023-11-30 05:34:57,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 154 events. 21/154 cut-off events. For 244/288 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 441 event pairs, 21 based on Foata normal form. 3/151 useless extension candidates. Maximal degree in co-relation 327. Up to 55 conditions per place. [2023-11-30 05:34:57,601 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 19 selfloop transitions, 1 changer transitions 1/71 dead transitions. [2023-11-30 05:34:57,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 71 transitions, 359 flow [2023-11-30 05:34:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:34:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:34:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2023-11-30 05:34:57,602 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2023-11-30 05:34:57,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 250 transitions. [2023-11-30 05:34:57,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 250 transitions. [2023-11-30 05:34:57,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:57,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 250 transitions. [2023-11-30 05:34:57,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:34:57,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:57,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:57,604 INFO L307 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2023-11-30 05:34:57,604 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 71 transitions, 359 flow [2023-11-30 05:34:57,605 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 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:34:57,605 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:57,605 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:34:57,605 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:34:57,605 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-30 05:34:57,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1302622620, now seen corresponding path program 1 times [2023-11-30 05:34:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:57,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732460972] [2023-11-30 05:34:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:57,646 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:34:57,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:57,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732460972] [2023-11-30 05:34:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732460972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:57,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:57,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:34:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405180964] [2023-11-30 05:34:57,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:57,650 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:34:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:57,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:34:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:34:57,651 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 110 [2023-11-30 05:34:57,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 71 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:34:57,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:57,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 110 [2023-11-30 05:34:57,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:57,688 INFO L124 PetriNetUnfolderBase]: 17/141 cut-off events. [2023-11-30 05:34:57,688 INFO L125 PetriNetUnfolderBase]: For 341/387 co-relation queries the response was YES. [2023-11-30 05:34:57,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 141 events. 17/141 cut-off events. For 341/387 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 361 event pairs, 17 based on Foata normal form. 3/140 useless extension candidates. Maximal degree in co-relation 313. Up to 46 conditions per place. [2023-11-30 05:34:57,688 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 0 selfloop transitions, 0 changer transitions 69/69 dead transitions. [2023-11-30 05:34:57,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 69 transitions, 377 flow [2023-11-30 05:34:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:34:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:34:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2023-11-30 05:34:57,690 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-30 05:34:57,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 240 transitions. [2023-11-30 05:34:57,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 240 transitions. [2023-11-30 05:34:57,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:57,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 240 transitions. [2023-11-30 05:34:57,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:34:57,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:57,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:34:57,694 INFO L307 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2023-11-30 05:34:57,694 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 69 transitions, 377 flow [2023-11-30 05:34:57,694 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:34:57,702 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-simple-equiv.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 05:34:57,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2023-11-30 05:34:57,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2023-11-30 05:34:57,728 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-11-30 05:34:57,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-11-30 05:34:57,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-11-30 05:34:57,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-11-30 05:34:57,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-11-30 05:34:57,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-11-30 05:34:57,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-11-30 05:34:57,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-11-30 05:34:57,729 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2023-11-30 05:34:57,730 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2023-11-30 05:34:57,730 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-11-30 05:34:57,730 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-11-30 05:34:57,730 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 15 remaining) [2023-11-30 05:34:57,730 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:34:57,731 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-30 05:34:57,733 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 05:34:57,733 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 05:34:57,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 05:34:57 BasicIcfg [2023-11-30 05:34:57,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 05:34:57,738 INFO L158 Benchmark]: Toolchain (without parser) took 2007.69ms. Allocated memory was 371.2MB in the beginning and 597.7MB in the end (delta: 226.5MB). Free memory was 314.8MB in the beginning and 344.0MB in the end (delta: -29.2MB). Peak memory consumption was 200.4MB. Max. memory is 16.0GB. [2023-11-30 05:34:57,738 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 371.2MB. Free memory is still 319.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 05:34:57,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.34ms. Allocated memory is still 371.2MB. Free memory was 314.5MB in the beginning and 303.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-11-30 05:34:57,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.91ms. Allocated memory is still 371.2MB. Free memory was 303.6MB in the beginning and 301.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 05:34:57,739 INFO L158 Benchmark]: Boogie Preprocessor took 14.97ms. Allocated memory is still 371.2MB. Free memory was 301.9MB in the beginning and 300.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 05:34:57,740 INFO L158 Benchmark]: RCFGBuilder took 419.26ms. Allocated memory was 371.2MB in the beginning and 597.7MB in the end (delta: 226.5MB). Free memory was 300.6MB in the beginning and 565.2MB in the end (delta: -264.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.0GB. [2023-11-30 05:34:57,745 INFO L158 Benchmark]: TraceAbstraction took 1411.12ms. Allocated memory is still 597.7MB. Free memory was 564.2MB in the beginning and 344.0MB in the end (delta: 220.2MB). Peak memory consumption was 220.2MB. Max. memory is 16.0GB. [2023-11-30 05:34:57,746 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 371.2MB. Free memory is still 319.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 137.34ms. Allocated memory is still 371.2MB. Free memory was 314.5MB in the beginning and 303.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 20.91ms. Allocated memory is still 371.2MB. Free memory was 303.6MB in the beginning and 301.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 14.97ms. Allocated memory is still 371.2MB. Free memory was 301.9MB in the beginning and 300.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 419.26ms. Allocated memory was 371.2MB in the beginning and 597.7MB in the end (delta: 226.5MB). Free memory was 300.6MB in the beginning and 565.2MB in the end (delta: -264.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.0GB. * TraceAbstraction took 1411.12ms. Allocated memory is still 597.7MB. Free memory was 564.2MB in the beginning and 344.0MB in the end (delta: 220.2MB). Peak memory consumption was 220.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 34 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377occurred in iteration=6, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 1127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 05:34:57,766 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...