/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:13:33,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:13:33,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:13:33,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:13:33,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:13:33,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:13:33,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:13:33,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:13:33,747 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:13:33,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:13:33,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:13:33,750 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:13:33,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:13:33,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:13:33,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:13:33,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:13:33,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:13:33,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:13:33,752 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:13:33,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:13:33,752 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:13:33,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:13:33,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:13:33,753 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:13:33,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:13:33,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:13:33,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:13:33,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:13:33,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:13:33,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:13:33,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:13:33,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:13:33,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:13:33,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:13:33,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:13:33,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:13:33,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:13:33,984 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:13:33,985 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:13:33,985 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-12-05 21:13:35,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:13:35,277 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:13:35,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i [2023-12-05 21:13:35,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf455154/5def91f49d6745f5a6b1a408ff2130c9/FLAGbf2f8e3ae [2023-12-05 21:13:35,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf455154/5def91f49d6745f5a6b1a408ff2130c9 [2023-12-05 21:13:35,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:13:35,304 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:13:35,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:13:35,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:13:35,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:13:35,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@902f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35, skipping insertion in model container [2023-12-05 21:13:35,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,351 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:13:35,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:13:35,579 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:13:35,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:13:35,670 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:13:35,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35 WrapperNode [2023-12-05 21:13:35,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:13:35,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:13:35,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:13:35,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:13:35,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,706 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2023-12-05 21:13:35,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:13:35,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:13:35,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:13:35,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:13:35,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:13:35,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:13:35,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:13:35,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:13:35,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (1/1) ... [2023-12-05 21:13:35,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:13:35,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:35,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:13:35,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:13:35,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:13:35,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:13:35,823 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:13:35,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:13:35,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:13:35,824 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:13:35,824 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:13:35,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:13:35,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:13:35,825 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:13:35,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:13:35,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:13:35,826 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:13:35,957 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:13:35,959 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:13:36,108 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:13:36,136 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:13:36,137 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-05 21:13:36,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:13:36 BoogieIcfgContainer [2023-12-05 21:13:36,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:13:36,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:13:36,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:13:36,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:13:36,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:13:35" (1/3) ... [2023-12-05 21:13:36,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526dcfeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:13:36, skipping insertion in model container [2023-12-05 21:13:36,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:35" (2/3) ... [2023-12-05 21:13:36,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526dcfeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:13:36, skipping insertion in model container [2023-12-05 21:13:36,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:13:36" (3/3) ... [2023-12-05 21:13:36,172 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2023-12-05 21:13:36,231 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:13:36,231 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:13:36,231 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:13:36,305 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:13:36,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 253 flow [2023-12-05 21:13:36,403 INFO L124 PetriNetUnfolderBase]: 19/171 cut-off events. [2023-12-05 21:13:36,404 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:13:36,412 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-12-05 21:13:36,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 123 transitions, 253 flow [2023-12-05 21:13:36,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 123 transitions, 253 flow [2023-12-05 21:13:36,432 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:13:36,438 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;@4e5fa7dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:13:36,439 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:13:36,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:13:36,454 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-12-05 21:13:36,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:36,454 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:36,455 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:36,455 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-12-05 21:13:36,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:36,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1130281453, now seen corresponding path program 1 times [2023-12-05 21:13:36,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:36,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588523409] [2023-12-05 21:13:36,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:36,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:36,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588523409] [2023-12-05 21:13:36,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588523409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:36,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:36,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:13:36,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117347856] [2023-12-05 21:13:36,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:36,759 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:13:36,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:36,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:13:36,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:13:36,784 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 123 [2023-12-05 21:13:36,786 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-12-05 21:13:36,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:36,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 123 [2023-12-05 21:13:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:36,902 INFO L124 PetriNetUnfolderBase]: 67/431 cut-off events. [2023-12-05 21:13:36,902 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:13:36,904 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-12-05 21:13:36,907 INFO L140 encePairwiseOnDemand]: 107/123 looper letters, 23 selfloop transitions, 1 changer transitions 17/112 dead transitions. [2023-12-05 21:13:36,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 297 flow [2023-12-05 21:13:36,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:13:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:13:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-12-05 21:13:36,921 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8021680216802168 [2023-12-05 21:13:36,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-12-05 21:13:36,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-12-05 21:13:36,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:36,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-12-05 21:13:36,929 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-12-05 21:13:36,932 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-12-05 21:13:36,932 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-12-05 21:13:36,936 INFO L308 CegarLoopForPetriNet]: 113 programPoint places, -3 predicate places. [2023-12-05 21:13:36,937 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 297 flow [2023-12-05 21:13:36,937 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-12-05 21:13:36,937 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:36,937 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:36,937 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:13:36,938 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-12-05 21:13:36,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1130281452, now seen corresponding path program 1 times [2023-12-05 21:13:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:36,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460005426] [2023-12-05 21:13:36,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:36,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:37,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:37,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460005426] [2023-12-05 21:13:37,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460005426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:37,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:37,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:13:37,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232552498] [2023-12-05 21:13:37,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:37,052 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:13:37,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:37,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:13:37,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:13:37,054 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 123 [2023-12-05 21:13:37,055 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-12-05 21:13:37,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:37,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 123 [2023-12-05 21:13:37,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:37,201 INFO L124 PetriNetUnfolderBase]: 96/481 cut-off events. [2023-12-05 21:13:37,201 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-12-05 21:13:37,204 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-12-05 21:13:37,207 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 34 selfloop transitions, 3 changer transitions 17/126 dead transitions. [2023-12-05 21:13:37,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 126 transitions, 455 flow [2023-12-05 21:13:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:13:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:13:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2023-12-05 21:13:37,209 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7154471544715447 [2023-12-05 21:13:37,209 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 352 transitions. [2023-12-05 21:13:37,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 352 transitions. [2023-12-05 21:13:37,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:37,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 352 transitions. [2023-12-05 21:13:37,210 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-12-05 21:13:37,212 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-12-05 21:13:37,213 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-12-05 21:13:37,214 INFO L308 CegarLoopForPetriNet]: 113 programPoint places, 0 predicate places. [2023-12-05 21:13:37,214 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 126 transitions, 455 flow [2023-12-05 21:13:37,214 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-12-05 21:13:37,214 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:37,215 INFO L233 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-12-05 21:13:37,215 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:13:37,215 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-12-05 21:13:37,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash 42689789, now seen corresponding path program 1 times [2023-12-05 21:13:37,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:37,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634525071] [2023-12-05 21:13:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:37,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:37,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634525071] [2023-12-05 21:13:37,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634525071] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:13:37,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788944566] [2023-12-05 21:13:37,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:37,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:37,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:37,470 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-12-05 21:13:37,491 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-12-05 21:13:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:37,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:13:37,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:13:37,607 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-12-05 21:13:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:37,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:13:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:37,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788944566] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:13:37,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:13:37,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:13:37,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707051671] [2023-12-05 21:13:37,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:13:37,877 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:13:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:37,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:13:37,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:13:37,879 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 123 [2023-12-05 21:13:37,880 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-12-05 21:13:37,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:37,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 123 [2023-12-05 21:13:37,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:38,000 INFO L124 PetriNetUnfolderBase]: 30/172 cut-off events. [2023-12-05 21:13:38,000 INFO L125 PetriNetUnfolderBase]: For 117/141 co-relation queries the response was YES. [2023-12-05 21:13:38,000 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-12-05 21:13:38,001 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 35 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2023-12-05 21:13:38,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 408 flow [2023-12-05 21:13:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:13:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:13:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2023-12-05 21:13:38,002 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6585365853658537 [2023-12-05 21:13:38,002 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 567 transitions. [2023-12-05 21:13:38,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 567 transitions. [2023-12-05 21:13:38,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:38,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 567 transitions. [2023-12-05 21:13:38,004 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-12-05 21:13:38,005 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-12-05 21:13:38,005 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-12-05 21:13:38,006 INFO L308 CegarLoopForPetriNet]: 113 programPoint places, -31 predicate places. [2023-12-05 21:13:38,006 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 408 flow [2023-12-05 21:13:38,007 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-12-05 21:13:38,007 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:38,007 INFO L233 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-12-05 21:13:38,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-05 21:13:38,213 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-12-05 21:13:38,214 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-12-05 21:13:38,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1323383770, now seen corresponding path program 1 times [2023-12-05 21:13:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:38,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419816194] [2023-12-05 21:13:38,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:38,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:38,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:13:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:38,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:13:38,271 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:13:38,272 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:13:38,273 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:13:38,273 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:13:38,273 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:13:38,273 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:13:38,273 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:13:38,274 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:13:38,275 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:13:38,275 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:13:38,296 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:13:38,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 156 transitions, 328 flow [2023-12-05 21:13:38,318 INFO L124 PetriNetUnfolderBase]: 34/280 cut-off events. [2023-12-05 21:13:38,319 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:13:38,319 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-12-05 21:13:38,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 156 transitions, 328 flow [2023-12-05 21:13:38,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 156 transitions, 328 flow [2023-12-05 21:13:38,322 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:13:38,324 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;@4e5fa7dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:13:38,324 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:13:38,328 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:13:38,328 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-12-05 21:13:38,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:38,328 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:38,328 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:38,328 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-12-05 21:13:38,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash 584500499, now seen corresponding path program 1 times [2023-12-05 21:13:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170789162] [2023-12-05 21:13:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:38,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:38,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170789162] [2023-12-05 21:13:38,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170789162] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:38,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:38,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:13:38,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459408868] [2023-12-05 21:13:38,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:38,380 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:13:38,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:38,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:13:38,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:13:38,381 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 156 [2023-12-05 21:13:38,382 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-12-05 21:13:38,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:38,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 156 [2023-12-05 21:13:38,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:38,808 INFO L124 PetriNetUnfolderBase]: 1095/3665 cut-off events. [2023-12-05 21:13:38,808 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-12-05 21:13:38,814 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-12-05 21:13:38,823 INFO L140 encePairwiseOnDemand]: 134/156 looper letters, 31 selfloop transitions, 1 changer transitions 17/145 dead transitions. [2023-12-05 21:13:38,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 145 transitions, 400 flow [2023-12-05 21:13:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:13:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:13:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-12-05 21:13:38,825 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8098290598290598 [2023-12-05 21:13:38,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-12-05 21:13:38,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-12-05 21:13:38,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:38,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-12-05 21:13:38,826 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-12-05 21:13:38,827 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-12-05 21:13:38,827 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-12-05 21:13:38,828 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, -3 predicate places. [2023-12-05 21:13:38,828 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 145 transitions, 400 flow [2023-12-05 21:13:38,828 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-12-05 21:13:38,828 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:38,828 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:38,828 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:13:38,828 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-12-05 21:13:38,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash 584500500, now seen corresponding path program 1 times [2023-12-05 21:13:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:38,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793352007] [2023-12-05 21:13:38,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:38,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:38,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:38,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793352007] [2023-12-05 21:13:38,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793352007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:38,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:38,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:13:38,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595096866] [2023-12-05 21:13:38,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:38,885 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:13:38,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:13:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:13:38,886 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 156 [2023-12-05 21:13:38,887 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-12-05 21:13:38,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:38,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 156 [2023-12-05 21:13:38,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:39,334 INFO L124 PetriNetUnfolderBase]: 1532/4381 cut-off events. [2023-12-05 21:13:39,334 INFO L125 PetriNetUnfolderBase]: For 956/956 co-relation queries the response was YES. [2023-12-05 21:13:39,343 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-12-05 21:13:39,359 INFO L140 encePairwiseOnDemand]: 150/156 looper letters, 44 selfloop transitions, 3 changer transitions 29/167 dead transitions. [2023-12-05 21:13:39,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 167 transitions, 630 flow [2023-12-05 21:13:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:13:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:13:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2023-12-05 21:13:39,361 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2023-12-05 21:13:39,361 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 444 transitions. [2023-12-05 21:13:39,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 444 transitions. [2023-12-05 21:13:39,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:39,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 444 transitions. [2023-12-05 21:13:39,402 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-12-05 21:13:39,402 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-12-05 21:13:39,403 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-12-05 21:13:39,403 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-12-05 21:13:39,403 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 167 transitions, 630 flow [2023-12-05 21:13:39,403 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-12-05 21:13:39,403 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:39,404 INFO L233 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-12-05 21:13:39,404 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:13:39,404 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-12-05 21:13:39,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash -954304450, now seen corresponding path program 1 times [2023-12-05 21:13:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111191770] [2023-12-05 21:13:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:39,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:39,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111191770] [2023-12-05 21:13:39,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111191770] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:13:39,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918575861] [2023-12-05 21:13:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:39,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:39,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:39,508 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-12-05 21:13:39,509 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-12-05 21:13:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:39,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:13:39,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:13:39,581 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-12-05 21:13:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:39,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:13:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:39,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918575861] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:13:39,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:13:39,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:13:39,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540042224] [2023-12-05 21:13:39,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:13:39,754 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:13:39,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:39,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:13:39,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:13:39,757 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 156 [2023-12-05 21:13:39,758 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-12-05 21:13:39,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:39,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 156 [2023-12-05 21:13:39,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:40,033 INFO L124 PetriNetUnfolderBase]: 492/1277 cut-off events. [2023-12-05 21:13:40,033 INFO L125 PetriNetUnfolderBase]: For 1061/1252 co-relation queries the response was YES. [2023-12-05 21:13:40,035 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-12-05 21:13:40,040 INFO L140 encePairwiseOnDemand]: 149/156 looper letters, 80 selfloop transitions, 8 changer transitions 0/155 dead transitions. [2023-12-05 21:13:40,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 155 transitions, 826 flow [2023-12-05 21:13:40,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:13:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:13:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1032 transitions. [2023-12-05 21:13:40,042 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2023-12-05 21:13:40,042 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1032 transitions. [2023-12-05 21:13:40,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1032 transitions. [2023-12-05 21:13:40,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:40,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1032 transitions. [2023-12-05 21:13:40,044 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-12-05 21:13:40,047 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-12-05 21:13:40,047 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-12-05 21:13:40,048 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, -28 predicate places. [2023-12-05 21:13:40,048 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 155 transitions, 826 flow [2023-12-05 21:13:40,049 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-12-05 21:13:40,049 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:40,049 INFO L233 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-12-05 21:13:40,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:13:40,260 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-12-05 21:13:40,260 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-12-05 21:13:40,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:40,261 INFO L85 PathProgramCache]: Analyzing trace with hash -457911605, now seen corresponding path program 1 times [2023-12-05 21:13:40,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:40,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950403298] [2023-12-05 21:13:40,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:40,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:40,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:13:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:40,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:13:40,283 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:13:40,283 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:13:40,283 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:13:40,284 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:13:40,284 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:13:40,284 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:13:40,284 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:13:40,284 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:13:40,284 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:13:40,284 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:13:40,298 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:13:40,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 189 transitions, 405 flow [2023-12-05 21:13:40,325 INFO L124 PetriNetUnfolderBase]: 54/428 cut-off events. [2023-12-05 21:13:40,325 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:13:40,327 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-12-05 21:13:40,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 189 transitions, 405 flow [2023-12-05 21:13:40,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 189 transitions, 405 flow [2023-12-05 21:13:40,330 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:13:40,330 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;@4e5fa7dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:13:40,330 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:13:40,332 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:13:40,332 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-12-05 21:13:40,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:40,332 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:40,332 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:40,332 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-12-05 21:13:40,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash 514541139, now seen corresponding path program 1 times [2023-12-05 21:13:40,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:40,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513043018] [2023-12-05 21:13:40,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513043018] [2023-12-05 21:13:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513043018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:40,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:40,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:13:40,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183510707] [2023-12-05 21:13:40,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:40,354 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:13:40,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:40,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:13:40,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:13:40,355 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 189 [2023-12-05 21:13:40,356 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-12-05 21:13:40,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:40,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 189 [2023-12-05 21:13:40,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:43,767 INFO L124 PetriNetUnfolderBase]: 12668/31576 cut-off events. [2023-12-05 21:13:43,768 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2023-12-05 21:13:43,865 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-12-05 21:13:43,967 INFO L140 encePairwiseOnDemand]: 161/189 looper letters, 39 selfloop transitions, 1 changer transitions 23/178 dead transitions. [2023-12-05 21:13:43,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 178 transitions, 505 flow [2023-12-05 21:13:43,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:13:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:13:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2023-12-05 21:13:43,969 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2023-12-05 21:13:43,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2023-12-05 21:13:43,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2023-12-05 21:13:43,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:43,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2023-12-05 21:13:43,971 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-12-05 21:13:43,974 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-12-05 21:13:43,974 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-12-05 21:13:43,975 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -3 predicate places. [2023-12-05 21:13:43,975 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 178 transitions, 505 flow [2023-12-05 21:13:43,975 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-12-05 21:13:43,975 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:43,975 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:43,975 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:13:43,975 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-12-05 21:13:43,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash 514541140, now seen corresponding path program 1 times [2023-12-05 21:13:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:43,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442816908] [2023-12-05 21:13:43,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:43,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:44,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:44,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442816908] [2023-12-05 21:13:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442816908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:44,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:44,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:13:44,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645116080] [2023-12-05 21:13:44,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:44,033 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:13:44,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:44,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:13:44,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:13:44,034 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 189 [2023-12-05 21:13:44,035 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-12-05 21:13:44,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:44,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 189 [2023-12-05 21:13:44,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:48,032 INFO L124 PetriNetUnfolderBase]: 17431/42246 cut-off events. [2023-12-05 21:13:48,033 INFO L125 PetriNetUnfolderBase]: For 7152/7882 co-relation queries the response was YES. [2023-12-05 21:13:48,179 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-12-05 21:13:48,330 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 52 selfloop transitions, 3 changer transitions 41/206 dead transitions. [2023-12-05 21:13:48,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 206 transitions, 799 flow [2023-12-05 21:13:48,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:13:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:13:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-12-05 21:13:48,332 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7063492063492064 [2023-12-05 21:13:48,332 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-12-05 21:13:48,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-12-05 21:13:48,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:48,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-12-05 21:13:48,333 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-12-05 21:13:48,334 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-12-05 21:13:48,334 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-12-05 21:13:48,336 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 0 predicate places. [2023-12-05 21:13:48,336 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 206 transitions, 799 flow [2023-12-05 21:13:48,337 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-12-05 21:13:48,337 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:48,337 INFO L233 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-12-05 21:13:48,337 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:13:48,337 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-12-05 21:13:48,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash -212762017, now seen corresponding path program 1 times [2023-12-05 21:13:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495111702] [2023-12-05 21:13:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:48,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:48,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495111702] [2023-12-05 21:13:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495111702] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:13:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692567221] [2023-12-05 21:13:48,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:48,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:48,436 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-12-05 21:13:48,464 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-12-05 21:13:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:48,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:13:48,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:13:48,520 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-12-05 21:13:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:48,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:13:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:48,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692567221] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:13:48,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:13:48,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:13:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937688145] [2023-12-05 21:13:48,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:13:48,664 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:13:48,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:48,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:13:48,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:13:48,666 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 189 [2023-12-05 21:13:48,667 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-12-05 21:13:48,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:48,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 189 [2023-12-05 21:13:48,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:52,850 INFO L124 PetriNetUnfolderBase]: 18270/38976 cut-off events. [2023-12-05 21:13:52,850 INFO L125 PetriNetUnfolderBase]: For 20933/24415 co-relation queries the response was YES. [2023-12-05 21:13:52,986 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-12-05 21:13:53,160 INFO L140 encePairwiseOnDemand]: 179/189 looper letters, 121 selfloop transitions, 11 changer transitions 41/282 dead transitions. [2023-12-05 21:13:53,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 282 transitions, 1577 flow [2023-12-05 21:13:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:13:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:13:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1286 transitions. [2023-12-05 21:13:53,168 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6804232804232804 [2023-12-05 21:13:53,168 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1286 transitions. [2023-12-05 21:13:53,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1286 transitions. [2023-12-05 21:13:53,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:53,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1286 transitions. [2023-12-05 21:13:53,172 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-12-05 21:13:53,174 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-12-05 21:13:53,175 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-12-05 21:13:53,176 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 9 predicate places. [2023-12-05 21:13:53,176 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 282 transitions, 1577 flow [2023-12-05 21:13:53,176 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-12-05 21:13:53,176 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:53,176 INFO L233 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-12-05 21:13:53,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-05 21:13:53,381 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-12-05 21:13:53,381 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-12-05 21:13:53,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash -366481966, now seen corresponding path program 1 times [2023-12-05 21:13:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966161119] [2023-12-05 21:13:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:53,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:53,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966161119] [2023-12-05 21:13:53,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966161119] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:13:53,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041784142] [2023-12-05 21:13:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:53,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:53,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:53,590 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-12-05 21:13:53,619 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-12-05 21:13:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:53,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-05 21:13:53,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:13:53,666 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-12-05 21:13:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:53,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:13:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:54,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041784142] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:13:54,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:13:54,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-12-05 21:13:54,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866573632] [2023-12-05 21:13:54,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:13:54,025 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:13:54,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:54,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:13:54,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:13:54,026 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 189 [2023-12-05 21:13:54,028 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-12-05 21:13:54,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:54,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 189 [2023-12-05 21:13:54,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:55,738 INFO L124 PetriNetUnfolderBase]: 5490/11384 cut-off events. [2023-12-05 21:13:55,738 INFO L125 PetriNetUnfolderBase]: For 14056/16749 co-relation queries the response was YES. [2023-12-05 21:13:55,775 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-12-05 21:13:55,852 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 161 selfloop transitions, 11 changer transitions 0/258 dead transitions. [2023-12-05 21:13:55,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 258 transitions, 1878 flow [2023-12-05 21:13:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:13:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:13:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1626 transitions. [2023-12-05 21:13:55,855 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6617826617826618 [2023-12-05 21:13:55,856 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1626 transitions. [2023-12-05 21:13:55,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1626 transitions. [2023-12-05 21:13:55,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:55,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1626 transitions. [2023-12-05 21:13:55,859 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-12-05 21:13:55,862 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-12-05 21:13:55,862 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-12-05 21:13:55,863 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, -16 predicate places. [2023-12-05 21:13:55,863 INFO L500 AbstractCegarLoop]: Abstraction has has 153 places, 258 transitions, 1878 flow [2023-12-05 21:13:55,864 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-12-05 21:13:55,864 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:55,864 INFO L233 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-12-05 21:13:55,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-05 21:13:56,068 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-12-05 21:13:56,069 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-12-05 21:13:56,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:56,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1523961660, now seen corresponding path program 1 times [2023-12-05 21:13:56,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:56,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139435529] [2023-12-05 21:13:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:56,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:56,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:13:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:56,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:13:56,123 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:13:56,123 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:13:56,123 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:13:56,123 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:13:56,124 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:13:56,124 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:13:56,124 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:13:56,124 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-05 21:13:56,124 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:13:56,124 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:13:56,144 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:13:56,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 222 transitions, 484 flow [2023-12-05 21:13:56,196 INFO L124 PetriNetUnfolderBase]: 86/656 cut-off events. [2023-12-05 21:13:56,197 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-05 21:13:56,202 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-12-05 21:13:56,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 222 transitions, 484 flow [2023-12-05 21:13:56,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 222 transitions, 484 flow [2023-12-05 21:13:56,206 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:13:56,207 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;@4e5fa7dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:13:56,207 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:13:56,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:13:56,209 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-12-05 21:13:56,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:56,209 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:56,209 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:56,209 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-12-05 21:13:56,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:56,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1340159533, now seen corresponding path program 1 times [2023-12-05 21:13:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:56,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362747098] [2023-12-05 21:13:56,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:56,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362747098] [2023-12-05 21:13:56,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362747098] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:56,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:56,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:13:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446557235] [2023-12-05 21:13:56,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:56,235 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:13:56,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:56,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:13:56,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:13:56,235 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 222 [2023-12-05 21:13:56,236 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-12-05 21:13:56,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:56,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 222 [2023-12-05 21:13:56,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:29,208 INFO L124 PetriNetUnfolderBase]: 128961/269403 cut-off events. [2023-12-05 21:14:29,208 INFO L125 PetriNetUnfolderBase]: For 10376/10376 co-relation queries the response was YES. [2023-12-05 21:14:31,124 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-12-05 21:14:32,401 INFO L140 encePairwiseOnDemand]: 188/222 looper letters, 47 selfloop transitions, 1 changer transitions 29/211 dead transitions. [2023-12-05 21:14:32,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 211 transitions, 612 flow [2023-12-05 21:14:32,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2023-12-05 21:14:32,424 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8183183183183184 [2023-12-05 21:14:32,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 545 transitions. [2023-12-05 21:14:32,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 545 transitions. [2023-12-05 21:14:32,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:32,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 545 transitions. [2023-12-05 21:14:32,426 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-12-05 21:14:32,427 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-12-05 21:14:32,427 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-12-05 21:14:32,427 INFO L308 CegarLoopForPetriNet]: 197 programPoint places, -3 predicate places. [2023-12-05 21:14:32,427 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 211 transitions, 612 flow [2023-12-05 21:14:32,428 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-12-05 21:14:32,428 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:32,428 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:32,428 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:14:32,428 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-12-05 21:14:32,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1340159532, now seen corresponding path program 1 times [2023-12-05 21:14:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143929259] [2023-12-05 21:14:32,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:14:32,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143929259] [2023-12-05 21:14:32,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143929259] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:32,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:32,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:32,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513477233] [2023-12-05 21:14:32,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:32,512 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:14:32,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:32,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:14:32,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:14:32,513 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 222 [2023-12-05 21:14:32,514 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-12-05 21:14:32,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:32,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 222 [2023-12-05 21:14:32,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand