/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/goblint-regression/28-race_reach_01-simple_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:03:18,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:03:18,401 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:03:18,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:03:18,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:03:18,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:03:18,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:03:18,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:03:18,432 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:03:18,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:03:18,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:03:18,435 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:03:18,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:03:18,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:03:18,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:03:18,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:03:18,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:03:18,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:03:18,436 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:03:18,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:03:18,436 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:03:18,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:03:18,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:03:18,437 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:03:18,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:03:18,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:03:18,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:03:18,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:03:18,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:03:18,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:03:18,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:03:18,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:03:18,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:03:18,439 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:03:18,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:03:18,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:03:18,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:03:18,670 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:03:18,670 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:03:18,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i [2023-11-30 05:03:19,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:03:19,834 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:03:19,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i [2023-11-30 05:03:19,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4058ac890/1cdfdf2d09d64d1db13bee164544bf33/FLAGb744bf3ea [2023-11-30 05:03:19,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4058ac890/1cdfdf2d09d64d1db13bee164544bf33 [2023-11-30 05:03:19,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:03:19,859 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:03:19,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:03:19,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:03:19,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:03:19,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:03:19" (1/1) ... [2023-11-30 05:03:19,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15a3687e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:19, skipping insertion in model container [2023-11-30 05:03:19,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:03:19" (1/1) ... [2023-11-30 05:03:19,889 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:03:20,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:03:20,084 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:03:20,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:03:20,173 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:03:20,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20 WrapperNode [2023-11-30 05:03:20,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:03:20,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:03:20,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:03:20,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:03:20,179 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:03:20" (1/1) ... [2023-11-30 05:03:20,204 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:03:20" (1/1) ... [2023-11-30 05:03:20,222 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2023-11-30 05:03:20,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:03:20,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:03:20,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:03:20,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:03:20,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20" (1/1) ... [2023-11-30 05:03:20,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20" (1/1) ... [2023-11-30 05:03:20,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20" (1/1) ... [2023-11-30 05:03:20,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20" (1/1) ... [2023-11-30 05:03:20,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20" (1/1) ... [2023-11-30 05:03:20,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20" (1/1) ... [2023-11-30 05:03:20,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20" (1/1) ... [2023-11-30 05:03:20,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20" (1/1) ... [2023-11-30 05:03:20,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:03:20,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:03:20,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:03:20,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:03:20,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20" (1/1) ... [2023-11-30 05:03:20,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:03:20,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:03:20,271 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:03:20,274 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:03:20,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:03:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:03:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 05:03:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:03:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:03:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-30 05:03:20,291 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-30 05:03:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:03:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:03:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 05:03:20,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:03:20,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:03:20,292 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:03:20,370 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:03:20,371 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:03:20,566 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:03:20,587 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:03:20,588 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-11-30 05:03:20,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:03:20 BoogieIcfgContainer [2023-11-30 05:03:20,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:03:20,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:03:20,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:03:20,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:03:20,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:03:19" (1/3) ... [2023-11-30 05:03:20,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db4b74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:03:20, skipping insertion in model container [2023-11-30 05:03:20,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:03:20" (2/3) ... [2023-11-30 05:03:20,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db4b74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:03:20, skipping insertion in model container [2023-11-30 05:03:20,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:03:20" (3/3) ... [2023-11-30 05:03:20,594 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2023-11-30 05:03:20,606 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:03:20,607 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-30 05:03:20,607 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:03:20,650 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-30 05:03:20,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 253 flow [2023-11-30 05:03:20,718 INFO L124 PetriNetUnfolderBase]: 19/171 cut-off events. [2023-11-30 05:03:20,718 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 05:03:20,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 171 events. 19/171 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 474 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. [2023-11-30 05:03:20,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 123 transitions, 253 flow [2023-11-30 05:03:20,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 123 transitions, 253 flow [2023-11-30 05:03:20,733 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:03:20,738 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;@70aa4fb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:03:20,738 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-30 05:03:20,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:03:20,746 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-30 05:03:20,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:03:20,747 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:20,747 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] [2023-11-30 05:03:20,748 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:20,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1130281453, now seen corresponding path program 1 times [2023-11-30 05:03:20,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:20,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920539566] [2023-11-30 05:03:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:20,996 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:03:20,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:20,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920539566] [2023-11-30 05:03:20,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920539566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:03:20,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:03:20,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:03:20,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482356404] [2023-11-30 05:03:20,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:03:21,004 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:03:21,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:03:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:03:21,023 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 123 [2023-11-30 05:03:21,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 123 transitions, 253 flow. Second operand has 3 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:03:21,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:21,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 123 [2023-11-30 05:03:21,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:03:21,176 INFO L124 PetriNetUnfolderBase]: 67/431 cut-off events. [2023-11-30 05:03:21,176 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 05:03:21,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 431 events. 67/431 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2221 event pairs, 48 based on Foata normal form. 82/481 useless extension candidates. Maximal degree in co-relation 504. Up to 121 conditions per place. [2023-11-30 05:03:21,179 INFO L140 encePairwiseOnDemand]: 107/123 looper letters, 23 selfloop transitions, 1 changer transitions 17/112 dead transitions. [2023-11-30 05:03:21,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 297 flow [2023-11-30 05:03:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:03:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:03:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-30 05:03:21,188 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8021680216802168 [2023-11-30 05:03:21,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-30 05:03:21,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-30 05:03:21,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:03:21,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-30 05:03:21,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:03:21,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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:03:21,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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:03:21,203 INFO L307 CegarLoopForPetriNet]: 113 programPoint places, -3 predicate places. [2023-11-30 05:03:21,203 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 297 flow [2023-11-30 05:03:21,204 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:03:21,204 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:21,204 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] [2023-11-30 05:03:21,204 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:03:21,204 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:21,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:21,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1130281452, now seen corresponding path program 1 times [2023-11-30 05:03:21,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:21,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310593622] [2023-11-30 05:03:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:21,350 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:03:21,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:21,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310593622] [2023-11-30 05:03:21,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310593622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:03:21,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:03:21,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:03:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659518848] [2023-11-30 05:03:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:03:21,351 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:03:21,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:21,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:03:21,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:03:21,353 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 123 [2023-11-30 05:03:21,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 112 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 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:03:21,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:21,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 123 [2023-11-30 05:03:21,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:03:21,443 INFO L124 PetriNetUnfolderBase]: 96/481 cut-off events. [2023-11-30 05:03:21,443 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-30 05:03:21,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 481 events. 96/481 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2468 event pairs, 6 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 814. Up to 174 conditions per place. [2023-11-30 05:03:21,446 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 34 selfloop transitions, 3 changer transitions 17/126 dead transitions. [2023-11-30 05:03:21,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 126 transitions, 455 flow [2023-11-30 05:03:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:03:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:03:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2023-11-30 05:03:21,449 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7154471544715447 [2023-11-30 05:03:21,449 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 352 transitions. [2023-11-30 05:03:21,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 352 transitions. [2023-11-30 05:03:21,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:03:21,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 352 transitions. [2023-11-30 05:03:21,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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:03:21,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 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:03:21,452 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 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:03:21,452 INFO L307 CegarLoopForPetriNet]: 113 programPoint places, 0 predicate places. [2023-11-30 05:03:21,453 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 126 transitions, 455 flow [2023-11-30 05:03:21,453 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 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:03:21,453 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:21,453 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:21,453 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:03:21,454 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:21,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash 42689789, now seen corresponding path program 1 times [2023-11-30 05:03:21,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:21,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743269279] [2023-11-30 05:03:21,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:21,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:21,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743269279] [2023-11-30 05:03:21,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743269279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:03:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2459521] [2023-11-30 05:03:21,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:21,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:03:21,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:03:21,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:03:21,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-30 05:03:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:21,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:03:21,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:03:21,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 05:03:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:21,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:03:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:22,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2459521] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:03:22,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:03:22,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-30 05:03:22,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981034914] [2023-11-30 05:03:22,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:03:22,028 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 05:03:22,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:22,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 05:03:22,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-30 05:03:22,030 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 123 [2023-11-30 05:03:22,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 126 transitions, 455 flow. Second operand has 14 states, 14 states have (on average 77.57142857142857) internal successors, (1086), 14 states have internal predecessors, (1086), 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:03:22,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:22,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 123 [2023-11-30 05:03:22,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:03:22,151 INFO L124 PetriNetUnfolderBase]: 30/172 cut-off events. [2023-11-30 05:03:22,151 INFO L125 PetriNetUnfolderBase]: For 117/141 co-relation queries the response was YES. [2023-11-30 05:03:22,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 172 events. 30/172 cut-off events. For 117/141 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 474 event pairs, 6 based on Foata normal form. 3/171 useless extension candidates. Maximal degree in co-relation 306. Up to 46 conditions per place. [2023-11-30 05:03:22,153 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 35 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2023-11-30 05:03:22,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 408 flow [2023-11-30 05:03:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:03:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:03:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2023-11-30 05:03:22,155 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6585365853658537 [2023-11-30 05:03:22,155 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 567 transitions. [2023-11-30 05:03:22,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 567 transitions. [2023-11-30 05:03:22,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:03:22,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 567 transitions. [2023-11-30 05:03:22,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 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:03:22,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 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:03:22,159 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 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:03:22,160 INFO L307 CegarLoopForPetriNet]: 113 programPoint places, -31 predicate places. [2023-11-30 05:03:22,160 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 408 flow [2023-11-30 05:03:22,161 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.57142857142857) internal successors, (1086), 14 states have internal predecessors, (1086), 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:03:22,161 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:22,162 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:22,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-30 05:03:22,367 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:03:22,367 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:22,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1323383770, now seen corresponding path program 1 times [2023-11-30 05:03:22,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:22,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203712021] [2023-11-30 05:03:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:03:22,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:03:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:03:22,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:03:22,426 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:03:22,427 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-30 05:03:22,428 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-11-30 05:03:22,428 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-11-30 05:03:22,429 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-11-30 05:03:22,429 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-11-30 05:03:22,429 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:03:22,429 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-30 05:03:22,431 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:03:22,431 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 05:03:22,456 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 05:03:22,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 156 transitions, 328 flow [2023-11-30 05:03:22,481 INFO L124 PetriNetUnfolderBase]: 34/280 cut-off events. [2023-11-30 05:03:22,482 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 05:03:22,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 280 events. 34/280 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 915 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 173. Up to 8 conditions per place. [2023-11-30 05:03:22,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 156 transitions, 328 flow [2023-11-30 05:03:22,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 156 transitions, 328 flow [2023-11-30 05:03:22,493 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:03:22,495 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;@70aa4fb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:03:22,495 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-30 05:03:22,499 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:03:22,499 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-30 05:03:22,500 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:03:22,500 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:22,501 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] [2023-11-30 05:03:22,501 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:22,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash 584500499, now seen corresponding path program 1 times [2023-11-30 05:03:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167199137] [2023-11-30 05:03:22,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:22,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:22,573 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:03:22,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:22,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167199137] [2023-11-30 05:03:22,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167199137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:03:22,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:03:22,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:03:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165364193] [2023-11-30 05:03:22,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:03:22,574 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:03:22,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:22,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:03:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:03:22,575 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 156 [2023-11-30 05:03:22,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 156 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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:03:22,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:22,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 156 [2023-11-30 05:03:22,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:03:22,914 INFO L124 PetriNetUnfolderBase]: 1095/3665 cut-off events. [2023-11-30 05:03:22,914 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-11-30 05:03:22,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5542 conditions, 3665 events. 1095/3665 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 31975 event pairs, 786 based on Foata normal form. 994/4410 useless extension candidates. Maximal degree in co-relation 740. Up to 1341 conditions per place. [2023-11-30 05:03:22,934 INFO L140 encePairwiseOnDemand]: 134/156 looper letters, 31 selfloop transitions, 1 changer transitions 17/145 dead transitions. [2023-11-30 05:03:22,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 145 transitions, 400 flow [2023-11-30 05:03:22,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:03:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:03:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-11-30 05:03:22,936 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8098290598290598 [2023-11-30 05:03:22,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-11-30 05:03:22,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-11-30 05:03:22,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:03:22,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-11-30 05:03:22,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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:03:22,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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:03:22,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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:03:22,940 INFO L307 CegarLoopForPetriNet]: 141 programPoint places, -3 predicate places. [2023-11-30 05:03:22,940 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 145 transitions, 400 flow [2023-11-30 05:03:22,940 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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:03:22,940 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:22,940 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] [2023-11-30 05:03:22,940 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:03:22,941 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:22,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash 584500500, now seen corresponding path program 1 times [2023-11-30 05:03:22,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:22,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913904925] [2023-11-30 05:03:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:23,016 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:03:23,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:23,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913904925] [2023-11-30 05:03:23,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913904925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:03:23,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:03:23,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:03:23,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425837955] [2023-11-30 05:03:23,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:03:23,019 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:03:23,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:23,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:03:23,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:03:23,020 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 156 [2023-11-30 05:03:23,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 145 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 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:03:23,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:23,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 156 [2023-11-30 05:03:23,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:03:23,478 INFO L124 PetriNetUnfolderBase]: 1532/4381 cut-off events. [2023-11-30 05:03:23,478 INFO L125 PetriNetUnfolderBase]: For 956/956 co-relation queries the response was YES. [2023-11-30 05:03:23,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9228 conditions, 4381 events. 1532/4381 cut-off events. For 956/956 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 38155 event pairs, 570 based on Foata normal form. 0/3985 useless extension candidates. Maximal degree in co-relation 1186. Up to 2193 conditions per place. [2023-11-30 05:03:23,499 INFO L140 encePairwiseOnDemand]: 150/156 looper letters, 44 selfloop transitions, 3 changer transitions 29/167 dead transitions. [2023-11-30 05:03:23,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 167 transitions, 630 flow [2023-11-30 05:03:23,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:03:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:03:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2023-11-30 05:03:23,501 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2023-11-30 05:03:23,501 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 444 transitions. [2023-11-30 05:03:23,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 444 transitions. [2023-11-30 05:03:23,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:03:23,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 444 transitions. [2023-11-30 05:03:23,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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:03:23,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 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:03:23,503 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 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:03:23,505 INFO L307 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-11-30 05:03:23,505 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 167 transitions, 630 flow [2023-11-30 05:03:23,505 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 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:03:23,505 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:23,506 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:23,506 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:03:23,506 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:23,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash -954304450, now seen corresponding path program 1 times [2023-11-30 05:03:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870976793] [2023-11-30 05:03:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:23,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870976793] [2023-11-30 05:03:23,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870976793] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:03:23,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361409634] [2023-11-30 05:03:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:03:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:03:23,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:03:23,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-30 05:03:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:23,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:03:23,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:03:23,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 05:03:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:23,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:03:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:23,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361409634] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:03:23,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:03:23,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-30 05:03:23,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132025573] [2023-11-30 05:03:23,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:03:23,852 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 05:03:23,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 05:03:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-30 05:03:23,854 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 156 [2023-11-30 05:03:23,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 167 transitions, 630 flow. Second operand has 14 states, 14 states have (on average 96.57142857142857) internal successors, (1352), 14 states have internal predecessors, (1352), 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:03:23,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:23,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 156 [2023-11-30 05:03:23,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:03:24,114 INFO L124 PetriNetUnfolderBase]: 492/1277 cut-off events. [2023-11-30 05:03:24,114 INFO L125 PetriNetUnfolderBase]: For 1061/1252 co-relation queries the response was YES. [2023-11-30 05:03:24,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 1277 events. 492/1277 cut-off events. For 1061/1252 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8416 event pairs, 0 based on Foata normal form. 6/1268 useless extension candidates. Maximal degree in co-relation 468. Up to 753 conditions per place. [2023-11-30 05:03:24,122 INFO L140 encePairwiseOnDemand]: 149/156 looper letters, 80 selfloop transitions, 8 changer transitions 0/155 dead transitions. [2023-11-30 05:03:24,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 155 transitions, 826 flow [2023-11-30 05:03:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 05:03:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 05:03:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1032 transitions. [2023-11-30 05:03:24,124 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2023-11-30 05:03:24,125 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1032 transitions. [2023-11-30 05:03:24,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1032 transitions. [2023-11-30 05:03:24,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:03:24,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1032 transitions. [2023-11-30 05:03:24,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.2) internal successors, (1032), 10 states have internal predecessors, (1032), 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:03:24,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 156.0) internal successors, (1716), 11 states have internal predecessors, (1716), 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:03:24,130 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 156.0) internal successors, (1716), 11 states have internal predecessors, (1716), 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:03:24,132 INFO L307 CegarLoopForPetriNet]: 141 programPoint places, -28 predicate places. [2023-11-30 05:03:24,132 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 155 transitions, 826 flow [2023-11-30 05:03:24,132 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 96.57142857142857) internal successors, (1352), 14 states have internal predecessors, (1352), 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:03:24,132 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:24,133 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:24,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-30 05:03:24,337 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-30 05:03:24,338 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:24,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash -457911605, now seen corresponding path program 1 times [2023-11-30 05:03:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304883946] [2023-11-30 05:03:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:03:24,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:03:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:03:24,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:03:24,376 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:03:24,376 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-30 05:03:24,377 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-11-30 05:03:24,378 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-11-30 05:03:24,378 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-11-30 05:03:24,378 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-11-30 05:03:24,378 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 05:03:24,379 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-30 05:03:24,380 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:03:24,380 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 05:03:24,403 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 05:03:24,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 189 transitions, 405 flow [2023-11-30 05:03:24,433 INFO L124 PetriNetUnfolderBase]: 54/428 cut-off events. [2023-11-30 05:03:24,434 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-30 05:03:24,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 428 events. 54/428 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1589 event pairs, 1 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 288. Up to 16 conditions per place. [2023-11-30 05:03:24,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 189 transitions, 405 flow [2023-11-30 05:03:24,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 189 transitions, 405 flow [2023-11-30 05:03:24,440 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:03:24,440 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;@70aa4fb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:03:24,440 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-30 05:03:24,443 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:03:24,443 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-30 05:03:24,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:03:24,443 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:24,443 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] [2023-11-30 05:03:24,443 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:24,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash 514541139, now seen corresponding path program 1 times [2023-11-30 05:03:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:24,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089756766] [2023-11-30 05:03:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:24,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:24,474 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:03:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:24,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089756766] [2023-11-30 05:03:24,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089756766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:03:24,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:03:24,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:03:24,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980823701] [2023-11-30 05:03:24,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:03:24,508 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:03:24,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:24,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:03:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:03:24,509 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 189 [2023-11-30 05:03:24,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 189 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:03:24,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:24,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 189 [2023-11-30 05:03:24,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:03:27,413 INFO L124 PetriNetUnfolderBase]: 12668/31576 cut-off events. [2023-11-30 05:03:27,413 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2023-11-30 05:03:27,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50187 conditions, 31576 events. 12668/31576 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 351574 event pairs, 9043 based on Foata normal form. 10398/40129 useless extension candidates. Maximal degree in co-relation 5531. Up to 13148 conditions per place. [2023-11-30 05:03:27,657 INFO L140 encePairwiseOnDemand]: 161/189 looper letters, 39 selfloop transitions, 1 changer transitions 23/178 dead transitions. [2023-11-30 05:03:27,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 178 transitions, 505 flow [2023-11-30 05:03:27,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:03:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:03:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2023-11-30 05:03:27,662 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2023-11-30 05:03:27,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2023-11-30 05:03:27,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2023-11-30 05:03:27,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:03:27,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2023-11-30 05:03:27,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:03:27,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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:03:27,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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:03:27,665 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, -3 predicate places. [2023-11-30 05:03:27,665 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 178 transitions, 505 flow [2023-11-30 05:03:27,666 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:03:27,666 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:27,666 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] [2023-11-30 05:03:27,666 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:03:27,666 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:27,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:27,666 INFO L85 PathProgramCache]: Analyzing trace with hash 514541140, now seen corresponding path program 1 times [2023-11-30 05:03:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94124716] [2023-11-30 05:03:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:27,723 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:03:27,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:27,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94124716] [2023-11-30 05:03:27,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94124716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:03:27,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:03:27,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:03:27,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760371307] [2023-11-30 05:03:27,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:03:27,724 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:03:27,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:27,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:03:27,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:03:27,725 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 189 [2023-11-30 05:03:27,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 178 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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:03:27,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:27,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 189 [2023-11-30 05:03:27,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:03:31,295 INFO L124 PetriNetUnfolderBase]: 17431/42246 cut-off events. [2023-11-30 05:03:31,295 INFO L125 PetriNetUnfolderBase]: For 7152/7882 co-relation queries the response was YES. [2023-11-30 05:03:31,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90471 conditions, 42246 events. 17431/42246 cut-off events. For 7152/7882 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 482389 event pairs, 8953 based on Foata normal form. 0/40247 useless extension candidates. Maximal degree in co-relation 9770. Up to 21545 conditions per place. [2023-11-30 05:03:31,502 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 52 selfloop transitions, 3 changer transitions 41/206 dead transitions. [2023-11-30 05:03:31,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 206 transitions, 799 flow [2023-11-30 05:03:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:03:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:03:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-11-30 05:03:31,504 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7063492063492064 [2023-11-30 05:03:31,504 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-11-30 05:03:31,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-11-30 05:03:31,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:03:31,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-11-30 05:03:31,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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:03:31,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 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:03:31,507 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 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:03:31,508 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 0 predicate places. [2023-11-30 05:03:31,508 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 206 transitions, 799 flow [2023-11-30 05:03:31,508 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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:03:31,508 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:31,508 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:31,509 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 05:03:31,509 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:31,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash -212762017, now seen corresponding path program 1 times [2023-11-30 05:03:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294855785] [2023-11-30 05:03:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294855785] [2023-11-30 05:03:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294855785] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:03:31,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271998930] [2023-11-30 05:03:31,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:31,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:03:31,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:03:31,600 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:03:31,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-30 05:03:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:31,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:03:31,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:03:31,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 05:03:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:31,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:03:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:31,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271998930] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:03:31,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:03:31,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 05:03:31,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252348752] [2023-11-30 05:03:31,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:03:31,790 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 05:03:31,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:31,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 05:03:31,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-30 05:03:31,792 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 189 [2023-11-30 05:03:31,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 206 transitions, 799 flow. Second operand has 11 states, 11 states have (on average 115.72727272727273) internal successors, (1273), 11 states have internal predecessors, (1273), 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:03:31,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:31,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 189 [2023-11-30 05:03:31,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:03:35,452 INFO L124 PetriNetUnfolderBase]: 18270/38976 cut-off events. [2023-11-30 05:03:35,453 INFO L125 PetriNetUnfolderBase]: For 20933/24415 co-relation queries the response was YES. [2023-11-30 05:03:35,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114761 conditions, 38976 events. 18270/38976 cut-off events. For 20933/24415 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 407252 event pairs, 623 based on Foata normal form. 6/36239 useless extension candidates. Maximal degree in co-relation 12073. Up to 22293 conditions per place. [2023-11-30 05:03:35,714 INFO L140 encePairwiseOnDemand]: 179/189 looper letters, 121 selfloop transitions, 11 changer transitions 41/282 dead transitions. [2023-11-30 05:03:35,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 282 transitions, 1577 flow [2023-11-30 05:03:35,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 05:03:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 05:03:35,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1286 transitions. [2023-11-30 05:03:35,719 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6804232804232804 [2023-11-30 05:03:35,719 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1286 transitions. [2023-11-30 05:03:35,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1286 transitions. [2023-11-30 05:03:35,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:03:35,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1286 transitions. [2023-11-30 05:03:35,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 128.6) internal successors, (1286), 10 states have internal predecessors, (1286), 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:03:35,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 189.0) internal successors, (2079), 11 states have internal predecessors, (2079), 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:03:35,725 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 189.0) internal successors, (2079), 11 states have internal predecessors, (2079), 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:03:35,726 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, 9 predicate places. [2023-11-30 05:03:35,726 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 282 transitions, 1577 flow [2023-11-30 05:03:35,726 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 115.72727272727273) internal successors, (1273), 11 states have internal predecessors, (1273), 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:03:35,726 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:35,726 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:35,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-30 05:03:35,931 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:03:35,934 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:35,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:35,934 INFO L85 PathProgramCache]: Analyzing trace with hash -366481966, now seen corresponding path program 1 times [2023-11-30 05:03:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:35,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264164019] [2023-11-30 05:03:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:36,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264164019] [2023-11-30 05:03:36,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264164019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:03:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196156716] [2023-11-30 05:03:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:36,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:03:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:03:36,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:03:36,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-30 05:03:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:36,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-30 05:03:36,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:03:36,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 05:03:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:36,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:03:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:03:36,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196156716] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:03:36,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:03:36,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-11-30 05:03:36,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228843855] [2023-11-30 05:03:36,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:03:36,596 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-30 05:03:36,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:36,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-30 05:03:36,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-11-30 05:03:36,598 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 189 [2023-11-30 05:03:36,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 282 transitions, 1577 flow. Second operand has 23 states, 23 states have (on average 115.8695652173913) internal successors, (2665), 23 states have internal predecessors, (2665), 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:03:36,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:36,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 189 [2023-11-30 05:03:36,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:03:38,271 INFO L124 PetriNetUnfolderBase]: 5490/11384 cut-off events. [2023-11-30 05:03:38,272 INFO L125 PetriNetUnfolderBase]: For 14056/16749 co-relation queries the response was YES. [2023-11-30 05:03:38,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41191 conditions, 11384 events. 5490/11384 cut-off events. For 14056/16749 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 99393 event pairs, 147 based on Foata normal form. 289/11517 useless extension candidates. Maximal degree in co-relation 4404. Up to 7466 conditions per place. [2023-11-30 05:03:38,336 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 161 selfloop transitions, 11 changer transitions 0/258 dead transitions. [2023-11-30 05:03:38,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 258 transitions, 1878 flow [2023-11-30 05:03:38,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 05:03:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 05:03:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1626 transitions. [2023-11-30 05:03:38,340 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6617826617826618 [2023-11-30 05:03:38,340 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1626 transitions. [2023-11-30 05:03:38,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1626 transitions. [2023-11-30 05:03:38,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:03:38,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1626 transitions. [2023-11-30 05:03:38,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 125.07692307692308) internal successors, (1626), 13 states have internal predecessors, (1626), 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:03:38,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 189.0) internal successors, (2646), 14 states have internal predecessors, (2646), 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:03:38,346 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 189.0) internal successors, (2646), 14 states have internal predecessors, (2646), 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:03:38,346 INFO L307 CegarLoopForPetriNet]: 169 programPoint places, -16 predicate places. [2023-11-30 05:03:38,346 INFO L500 AbstractCegarLoop]: Abstraction has has 153 places, 258 transitions, 1878 flow [2023-11-30 05:03:38,347 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 115.8695652173913) internal successors, (2665), 23 states have internal predecessors, (2665), 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:03:38,347 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:38,347 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:38,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-30 05:03:38,551 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:03:38,552 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:38,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1523961660, now seen corresponding path program 1 times [2023-11-30 05:03:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643883282] [2023-11-30 05:03:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:03:38,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:03:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:03:38,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:03:38,595 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:03:38,595 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-30 05:03:38,595 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-11-30 05:03:38,595 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-11-30 05:03:38,596 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-11-30 05:03:38,596 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-11-30 05:03:38,596 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 05:03:38,596 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-30 05:03:38,596 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:03:38,596 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 05:03:38,620 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 05:03:38,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 222 transitions, 484 flow [2023-11-30 05:03:38,661 INFO L124 PetriNetUnfolderBase]: 86/656 cut-off events. [2023-11-30 05:03:38,661 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-30 05:03:38,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 656 events. 86/656 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2753 event pairs, 6 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 448. Up to 32 conditions per place. [2023-11-30 05:03:38,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 222 transitions, 484 flow [2023-11-30 05:03:38,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 222 transitions, 484 flow [2023-11-30 05:03:38,667 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:03:38,667 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;@70aa4fb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:03:38,667 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-30 05:03:38,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:03:38,668 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-30 05:03:38,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:03:38,668 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:03:38,669 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] [2023-11-30 05:03:38,669 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:03:38,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:03:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1340159533, now seen corresponding path program 1 times [2023-11-30 05:03:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:03:38,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054331173] [2023-11-30 05:03:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:03:38,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:03:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:03:38,700 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:03:38,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:03:38,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054331173] [2023-11-30 05:03:38,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054331173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:03:38,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:03:38,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:03:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922749151] [2023-11-30 05:03:38,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:03:38,701 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:03:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:03:38,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:03:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:03:38,701 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 222 [2023-11-30 05:03:38,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 222 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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:03:38,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:03:38,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 222 [2023-11-30 05:03:38,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:04:07,095 INFO L124 PetriNetUnfolderBase]: 128961/269403 cut-off events. [2023-11-30 05:04:07,096 INFO L125 PetriNetUnfolderBase]: For 10376/10376 co-relation queries the response was YES. [2023-11-30 05:04:08,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444083 conditions, 269403 events. 128961/269403 cut-off events. For 10376/10376 co-relation queries the response was YES. Maximal size of possible extension queue 5637. Compared 3446182 event pairs, 90828 based on Foata normal form. 100078/355470 useless extension candidates. Maximal degree in co-relation 50204. Up to 121191 conditions per place. [2023-11-30 05:04:09,480 INFO L140 encePairwiseOnDemand]: 188/222 looper letters, 47 selfloop transitions, 1 changer transitions 29/211 dead transitions. [2023-11-30 05:04:09,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 211 transitions, 612 flow [2023-11-30 05:04:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:04:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:04:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2023-11-30 05:04:09,482 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8183183183183184 [2023-11-30 05:04:09,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 545 transitions. [2023-11-30 05:04:09,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 545 transitions. [2023-11-30 05:04:09,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:04:09,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 545 transitions. [2023-11-30 05:04:09,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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:04:09,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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:04:09,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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:04:09,497 INFO L307 CegarLoopForPetriNet]: 197 programPoint places, -3 predicate places. [2023-11-30 05:04:09,497 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 211 transitions, 612 flow [2023-11-30 05:04:09,497 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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:04:09,497 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:04:09,497 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] [2023-11-30 05:04:09,497 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 05:04:09,497 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:04:09,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:04:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1340159532, now seen corresponding path program 1 times [2023-11-30 05:04:09,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:04:09,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956471529] [2023-11-30 05:04:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:04:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:04:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:04:09,555 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:04:09,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:04:09,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956471529] [2023-11-30 05:04:09,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956471529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:04:09,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:04:09,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:04:09,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219581972] [2023-11-30 05:04:09,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:04:09,556 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:04:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:04:09,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:04:09,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:04:09,557 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 222 [2023-11-30 05:04:09,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 211 transitions, 612 flow. Second operand has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 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:04:09,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:04:09,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 222 [2023-11-30 05:04:09,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:04:46,815 INFO L124 PetriNetUnfolderBase]: 174884/362393 cut-off events. [2023-11-30 05:04:46,816 INFO L125 PetriNetUnfolderBase]: For 58715/64695 co-relation queries the response was YES. [2023-11-30 05:04:48,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813509 conditions, 362393 events. 174884/362393 cut-off events. For 58715/64695 co-relation queries the response was YES. Maximal size of possible extension queue 7218. Compared 4761967 event pairs, 100902 based on Foata normal form. 0/347444 useless extension candidates. Maximal degree in co-relation 91649. Up to 197767 conditions per place. [2023-11-30 05:04:50,236 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 60 selfloop transitions, 3 changer transitions 53/245 dead transitions. [2023-11-30 05:04:50,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 245 transitions, 970 flow [2023-11-30 05:04:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:04:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:04:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2023-11-30 05:04:50,238 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2023-11-30 05:04:50,238 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 624 transitions. [2023-11-30 05:04:50,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 624 transitions. [2023-11-30 05:04:50,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:04:50,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 624 transitions. [2023-11-30 05:04:50,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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:04:50,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 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:04:50,241 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 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:04:50,241 INFO L307 CegarLoopForPetriNet]: 197 programPoint places, 0 predicate places. [2023-11-30 05:04:50,242 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 245 transitions, 970 flow [2023-11-30 05:04:50,242 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 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:04:50,242 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:04:50,242 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:50,242 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 05:04:50,242 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:04:50,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:04:50,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2027650208, now seen corresponding path program 1 times [2023-11-30 05:04:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:04:50,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469652636] [2023-11-30 05:04:50,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:04:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:04:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:04:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:04:50,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:04:50,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469652636] [2023-11-30 05:04:50,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469652636] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:04:50,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697665974] [2023-11-30 05:04:50,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:04:50,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:04:50,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:04:50,324 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:04:50,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-30 05:04:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:04:50,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:04:50,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:04:50,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 05:04:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:04:50,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:04:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:04:50,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697665974] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:04:50,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:04:50,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 05:04:50,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120070521] [2023-11-30 05:04:50,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:04:50,530 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 05:04:50,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:04:50,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 05:04:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-30 05:04:50,531 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 222 [2023-11-30 05:04:50,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 245 transitions, 970 flow. Second operand has 11 states, 11 states have (on average 134.72727272727272) internal successors, (1482), 11 states have internal predecessors, (1482), 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:04:50,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:04:50,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 222 [2023-11-30 05:04:50,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:05:32,655 INFO L124 PetriNetUnfolderBase]: 183479/348712 cut-off events. [2023-11-30 05:05:32,655 INFO L125 PetriNetUnfolderBase]: For 162908/189699 co-relation queries the response was YES. [2023-11-30 05:05:34,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058005 conditions, 348712 events. 183479/348712 cut-off events. For 162908/189699 co-relation queries the response was YES. Maximal size of possible extension queue 6858. Compared 4228019 event pairs, 16157 based on Foata normal form. 3/327702 useless extension candidates. Maximal degree in co-relation 117343. Up to 206033 conditions per place. [2023-11-30 05:05:36,534 INFO L140 encePairwiseOnDemand]: 212/222 looper letters, 135 selfloop transitions, 11 changer transitions 53/327 dead transitions. [2023-11-30 05:05:36,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 327 transitions, 1836 flow [2023-11-30 05:05:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 05:05:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 05:05:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1496 transitions. [2023-11-30 05:05:36,564 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6738738738738739 [2023-11-30 05:05:36,564 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1496 transitions. [2023-11-30 05:05:36,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1496 transitions. [2023-11-30 05:05:36,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:05:36,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1496 transitions. [2023-11-30 05:05:36,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 149.6) internal successors, (1496), 10 states have internal predecessors, (1496), 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:05:36,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 222.0) internal successors, (2442), 11 states have internal predecessors, (2442), 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:05:36,569 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 222.0) internal successors, (2442), 11 states have internal predecessors, (2442), 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:05:36,571 INFO L307 CegarLoopForPetriNet]: 197 programPoint places, 9 predicate places. [2023-11-30 05:05:36,571 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 327 transitions, 1836 flow [2023-11-30 05:05:36,571 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 134.72727272727272) internal successors, (1482), 11 states have internal predecessors, (1482), 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:05:36,571 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:05:36,572 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:36,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 05:05:36,772 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-30 05:05:36,772 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:05:36,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:05:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash 770896405, now seen corresponding path program 1 times [2023-11-30 05:05:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:05:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161574595] [2023-11-30 05:05:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:05:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:05:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:05:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:05:37,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:05:37,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161574595] [2023-11-30 05:05:37,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161574595] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:05:37,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675324710] [2023-11-30 05:05:37,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:05:37,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:05:37,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:05:37,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:05:37,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-30 05:05:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:05:37,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-30 05:05:37,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:05:37,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 05:05:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:05:37,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:05:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:05:37,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675324710] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:05:37,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:05:37,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-11-30 05:05:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645935523] [2023-11-30 05:05:37,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:05:37,682 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-30 05:05:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:05:37,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-30 05:05:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2023-11-30 05:05:37,684 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 222 [2023-11-30 05:05:37,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 327 transitions, 1836 flow. Second operand has 27 states, 27 states have (on average 134.66666666666666) internal successors, (3636), 27 states have internal predecessors, (3636), 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:05:37,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:05:37,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 222 [2023-11-30 05:05:37,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:05:48,402 INFO L124 PetriNetUnfolderBase]: 52824/94797 cut-off events. [2023-11-30 05:05:48,402 INFO L125 PetriNetUnfolderBase]: For 117714/136351 co-relation queries the response was YES. [2023-11-30 05:05:48,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361275 conditions, 94797 events. 52824/94797 cut-off events. For 117714/136351 co-relation queries the response was YES. Maximal size of possible extension queue 2410. Compared 955772 event pairs, 1047 based on Foata normal form. 1435/95095 useless extension candidates. Maximal degree in co-relation 41307. Up to 66805 conditions per place. [2023-11-30 05:05:49,460 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 266 selfloop transitions, 14 changer transitions 0/385 dead transitions. [2023-11-30 05:05:49,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 385 transitions, 2996 flow [2023-11-30 05:05:49,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 05:05:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 05:05:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2355 transitions. [2023-11-30 05:05:49,464 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6630067567567568 [2023-11-30 05:05:49,464 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2355 transitions. [2023-11-30 05:05:49,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2355 transitions. [2023-11-30 05:05:49,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:05:49,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2355 transitions. [2023-11-30 05:05:49,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 147.1875) internal successors, (2355), 16 states have internal predecessors, (2355), 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:05:49,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 222.0) internal successors, (3774), 17 states have internal predecessors, (3774), 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:05:49,472 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 222.0) internal successors, (3774), 17 states have internal predecessors, (3774), 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:05:49,472 INFO L307 CegarLoopForPetriNet]: 197 programPoint places, -13 predicate places. [2023-11-30 05:05:49,472 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 385 transitions, 2996 flow [2023-11-30 05:05:49,473 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 134.66666666666666) internal successors, (3636), 27 states have internal predecessors, (3636), 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:05:49,473 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:05:49,474 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:49,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-30 05:05:49,679 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-30 05:05:49,679 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:05:49,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:05:49,679 INFO L85 PathProgramCache]: Analyzing trace with hash 666360269, now seen corresponding path program 1 times [2023-11-30 05:05:49,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:05:49,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793456343] [2023-11-30 05:05:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:05:49,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:05:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:05:49,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:05:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:05:49,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:05:49,949 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:05:49,949 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-30 05:05:49,949 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-11-30 05:05:49,949 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-11-30 05:05:49,949 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-11-30 05:05:49,949 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-11-30 05:05:49,949 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 05:05:49,950 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-30 05:05:49,950 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:05:49,950 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-30 05:05:49,974 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-11-30 05:05:49,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 255 transitions, 565 flow [2023-11-30 05:05:50,127 INFO L124 PetriNetUnfolderBase]: 146/1048 cut-off events. [2023-11-30 05:05:50,127 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-11-30 05:05:50,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 1048 events. 146/1048 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5250 event pairs, 23 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 701. Up to 80 conditions per place. [2023-11-30 05:05:50,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 255 transitions, 565 flow [2023-11-30 05:05:50,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 255 transitions, 565 flow [2023-11-30 05:05:50,156 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:05:50,156 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;@70aa4fb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:05:50,156 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-30 05:05:50,158 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:05:50,158 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-30 05:05:50,158 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:05:50,158 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:05:50,158 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] [2023-11-30 05:05:50,158 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:05:50,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:05:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash -684634221, now seen corresponding path program 1 times [2023-11-30 05:05:50,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:05:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130484725] [2023-11-30 05:05:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:05:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:05:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:05:50,176 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:05:50,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:05:50,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130484725] [2023-11-30 05:05:50,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130484725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:05:50,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:05:50,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:05:50,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848616808] [2023-11-30 05:05:50,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:05:50,177 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:05:50,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:05:50,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:05:50,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:05:50,178 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 255 [2023-11-30 05:05:50,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 255 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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:05:50,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:05:50,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 255 [2023-11-30 05:05:50,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand