/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_08-cond_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:14:39,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:14:39,486 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:14:39,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:14:39,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:14:39,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:14:39,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:14:39,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:14:39,509 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:14:39,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:14:39,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:14:39,510 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:14:39,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:14:39,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:14:39,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:14:39,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:14:39,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:14:39,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:14:39,512 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:14:39,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:14:39,512 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:14:39,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:14:39,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:14:39,513 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:14:39,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:14:39,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:14:39,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:14:39,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:14:39,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:14:39,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:14:39,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:14:39,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:14:39,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:14:39,515 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:14:39,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:14:39,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:14:39,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:14:39,745 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:14:39,746 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:14:39,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i [2023-12-05 21:14:40,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:14:41,178 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:14:41,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i [2023-12-05 21:14:41,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbee83263/bd5c7c965eda447c9d0c3f8ea5cb3cab/FLAGa15431ef5 [2023-12-05 21:14:41,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbee83263/bd5c7c965eda447c9d0c3f8ea5cb3cab [2023-12-05 21:14:41,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:14:41,219 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:14:41,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:14:41,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:14:41,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:14:41,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139344cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41, skipping insertion in model container [2023-12-05 21:14:41,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,270 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:14:41,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:14:41,623 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:14:41,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:14:41,719 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:14:41,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41 WrapperNode [2023-12-05 21:14:41,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:14:41,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:14:41,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:14:41,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:14:41,726 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:14:41" (1/1) ... [2023-12-05 21:14:41,741 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:14:41" (1/1) ... [2023-12-05 21:14:41,759 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2023-12-05 21:14:41,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:14:41,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:14:41,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:14:41,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:14:41,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:14:41,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:14:41,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:14:41,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:14:41,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41" (1/1) ... [2023-12-05 21:14:41,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:14:41,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:41,839 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:14:41,854 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:14:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:14:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:14:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:14:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:14:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:14:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:14:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:14:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:14:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:14:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:14:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:14:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:14:41,874 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:14:41,969 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:14:41,970 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:14:42,158 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:14:42,192 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:14:42,192 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-05 21:14:42,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:14:42 BoogieIcfgContainer [2023-12-05 21:14:42,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:14:42,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:14:42,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:14:42,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:14:42,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:14:41" (1/3) ... [2023-12-05 21:14:42,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7c9c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:14:42, skipping insertion in model container [2023-12-05 21:14:42,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:41" (2/3) ... [2023-12-05 21:14:42,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7c9c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:14:42, skipping insertion in model container [2023-12-05 21:14:42,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:14:42" (3/3) ... [2023-12-05 21:14:42,209 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2023-12-05 21:14:42,222 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:14:42,222 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:14:42,223 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:14:42,279 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:14:42,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 139 transitions, 285 flow [2023-12-05 21:14:42,396 INFO L124 PetriNetUnfolderBase]: 25/196 cut-off events. [2023-12-05 21:14:42,396 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:14:42,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 196 events. 25/196 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 546 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2023-12-05 21:14:42,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 139 transitions, 285 flow [2023-12-05 21:14:42,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 139 transitions, 285 flow [2023-12-05 21:14:42,412 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:14:42,417 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;@51cf726b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:14:42,418 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:14:42,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:14:42,427 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-12-05 21:14:42,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:14:42,428 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:42,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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:42,429 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:14:42,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash -399990818, now seen corresponding path program 1 times [2023-12-05 21:14:42,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418833485] [2023-12-05 21:14:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:42,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:42,696 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:42,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:42,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418833485] [2023-12-05 21:14:42,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418833485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:42,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:42,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:14:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426189817] [2023-12-05 21:14:42,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:42,711 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:14:42,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:14:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:14:42,751 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 139 [2023-12-05 21:14:42,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 139 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:42,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:42,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 139 [2023-12-05 21:14:42,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:42,863 INFO L124 PetriNetUnfolderBase]: 73/456 cut-off events. [2023-12-05 21:14:42,864 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:14:42,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 456 events. 73/456 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2671 event pairs, 48 based on Foata normal form. 79/487 useless extension candidates. Maximal degree in co-relation 513. Up to 121 conditions per place. [2023-12-05 21:14:42,867 INFO L140 encePairwiseOnDemand]: 123/139 looper letters, 22 selfloop transitions, 1 changer transitions 17/128 dead transitions. [2023-12-05 21:14:42,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 128 transitions, 327 flow [2023-12-05 21:14:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-12-05 21:14:42,878 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.829736211031175 [2023-12-05 21:14:42,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-12-05 21:14:42,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-12-05 21:14:42,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:42,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-12-05 21:14:42,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:42,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 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:42,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 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:42,891 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2023-12-05 21:14:42,891 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 128 transitions, 327 flow [2023-12-05 21:14:42,892 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:42,892 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:42,892 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:42,892 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:14:42,892 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:42,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:42,893 INFO L85 PathProgramCache]: Analyzing trace with hash -399990817, now seen corresponding path program 1 times [2023-12-05 21:14:42,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:42,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736056553] [2023-12-05 21:14:42,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:42,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:43,054 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:43,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:43,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736056553] [2023-12-05 21:14:43,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736056553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:43,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:43,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:43,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974467469] [2023-12-05 21:14:43,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:43,057 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:14:43,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:43,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:14:43,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:14:43,059 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 139 [2023-12-05 21:14:43,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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:43,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:43,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 139 [2023-12-05 21:14:43,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:43,199 INFO L124 PetriNetUnfolderBase]: 117/551 cut-off events. [2023-12-05 21:14:43,199 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2023-12-05 21:14:43,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 551 events. 117/551 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3079 event pairs, 6 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 877. Up to 174 conditions per place. [2023-12-05 21:14:43,206 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 33 selfloop transitions, 3 changer transitions 17/142 dead transitions. [2023-12-05 21:14:43,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 142 transitions, 483 flow [2023-12-05 21:14:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:14:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:14:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-12-05 21:14:43,213 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7535971223021583 [2023-12-05 21:14:43,213 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-12-05 21:14:43,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-12-05 21:14:43,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:43,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-12-05 21:14:43,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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:43,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 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:43,218 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 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:43,218 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2023-12-05 21:14:43,218 INFO L500 AbstractCegarLoop]: Abstraction has has 126 places, 142 transitions, 483 flow [2023-12-05 21:14:43,219 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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:43,219 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:43,219 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:43,219 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:14:43,219 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:14:43,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1175489340, now seen corresponding path program 1 times [2023-12-05 21:14:43,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:43,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750912027] [2023-12-05 21:14:43,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:43,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:43,488 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:14:43,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:43,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750912027] [2023-12-05 21:14:43,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750912027] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:14:43,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946207026] [2023-12-05 21:14:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:43,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:14:43,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:43,494 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:14:43,570 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:14:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:43,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:14:43,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:14:43,672 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:14:43,779 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:14:43,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:14:43,906 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:14:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946207026] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:14:43,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:14:43,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:14:43,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906845245] [2023-12-05 21:14:43,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:14:43,907 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:14:43,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:43,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:14:43,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:14:43,909 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 139 [2023-12-05 21:14:43,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 142 transitions, 483 flow. Second operand has 11 states, 11 states have (on average 94.63636363636364) internal successors, (1041), 11 states have internal predecessors, (1041), 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:43,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:43,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 139 [2023-12-05 21:14:43,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:44,004 INFO L124 PetriNetUnfolderBase]: 30/200 cut-off events. [2023-12-05 21:14:44,004 INFO L125 PetriNetUnfolderBase]: For 111/120 co-relation queries the response was YES. [2023-12-05 21:14:44,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 200 events. 30/200 cut-off events. For 111/120 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 580 event pairs, 6 based on Foata normal form. 6/206 useless extension candidates. Maximal degree in co-relation 330. Up to 46 conditions per place. [2023-12-05 21:14:44,005 INFO L140 encePairwiseOnDemand]: 132/139 looper letters, 34 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-12-05 21:14:44,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 95 transitions, 416 flow [2023-12-05 21:14:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:14:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:14:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-12-05 21:14:44,007 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7040082219938335 [2023-12-05 21:14:44,007 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-12-05 21:14:44,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-12-05 21:14:44,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:44,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-12-05 21:14:44,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 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:44,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 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:44,011 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 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:44,011 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, -37 predicate places. [2023-12-05 21:14:44,011 INFO L500 AbstractCegarLoop]: Abstraction has has 89 places, 95 transitions, 416 flow [2023-12-05 21:14:44,012 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.63636363636364) internal successors, (1041), 11 states have internal predecessors, (1041), 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:44,012 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:44,012 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:44,037 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:14:44,217 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:14:44,218 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:14:44,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:44,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2080431527, now seen corresponding path program 1 times [2023-12-05 21:14:44,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:44,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48319409] [2023-12-05 21:14:44,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:44,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:14:44,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:14:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:14:44,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:14:44,254 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:14:44,254 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:14:44,256 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:14:44,256 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:14:44,256 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:14:44,256 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:14:44,256 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:14:44,257 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:14:44,258 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:14:44,258 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:14:44,273 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:14:44,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 172 transitions, 360 flow [2023-12-05 21:14:44,293 INFO L124 PetriNetUnfolderBase]: 43/314 cut-off events. [2023-12-05 21:14:44,293 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:14:44,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 314 events. 43/314 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1054 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 198. Up to 9 conditions per place. [2023-12-05 21:14:44,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 172 transitions, 360 flow [2023-12-05 21:14:44,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 172 transitions, 360 flow [2023-12-05 21:14:44,298 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:14:44,299 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;@51cf726b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:14:44,299 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:14:44,301 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:14:44,302 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-12-05 21:14:44,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:14:44,302 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:44,302 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:44,302 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:14:44,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash 24382730, now seen corresponding path program 1 times [2023-12-05 21:14:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:44,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221265529] [2023-12-05 21:14:44,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:44,330 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:44,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:44,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221265529] [2023-12-05 21:14:44,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221265529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:44,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:44,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:14:44,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011418584] [2023-12-05 21:14:44,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:44,331 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:14:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:44,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:14:44,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:14:44,334 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 172 [2023-12-05 21:14:44,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 172 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:44,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:44,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 172 [2023-12-05 21:14:44,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:44,717 INFO L124 PetriNetUnfolderBase]: 1122/3753 cut-off events. [2023-12-05 21:14:44,717 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-12-05 21:14:44,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5629 conditions, 3753 events. 1122/3753 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 35370 event pairs, 786 based on Foata normal form. 971/4361 useless extension candidates. Maximal degree in co-relation 749. Up to 1341 conditions per place. [2023-12-05 21:14:44,734 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 30 selfloop transitions, 1 changer transitions 17/161 dead transitions. [2023-12-05 21:14:44,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 161 transitions, 430 flow [2023-12-05 21:14:44,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-12-05 21:14:44,735 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8313953488372093 [2023-12-05 21:14:44,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-12-05 21:14:44,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-12-05 21:14:44,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:44,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-12-05 21:14:44,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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:44,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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:44,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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:44,738 INFO L308 CegarLoopForPetriNet]: 154 programPoint places, -3 predicate places. [2023-12-05 21:14:44,738 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 161 transitions, 430 flow [2023-12-05 21:14:44,739 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:44,739 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:44,739 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:44,739 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:14:44,739 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:44,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash 24382731, now seen corresponding path program 1 times [2023-12-05 21:14:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:44,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697130689] [2023-12-05 21:14:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:44,789 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:44,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:44,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697130689] [2023-12-05 21:14:44,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697130689] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:44,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:44,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:44,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64764474] [2023-12-05 21:14:44,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:44,790 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:14:44,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:44,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:14:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:14:44,791 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 172 [2023-12-05 21:14:44,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 161 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 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:44,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:44,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 172 [2023-12-05 21:14:44,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:45,226 INFO L124 PetriNetUnfolderBase]: 1700/4892 cut-off events. [2023-12-05 21:14:45,226 INFO L125 PetriNetUnfolderBase]: For 1012/1012 co-relation queries the response was YES. [2023-12-05 21:14:45,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9737 conditions, 4892 events. 1700/4892 cut-off events. For 1012/1012 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 44132 event pairs, 570 based on Foata normal form. 0/4329 useless extension candidates. Maximal degree in co-relation 1249. Up to 2193 conditions per place. [2023-12-05 21:14:45,255 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 43 selfloop transitions, 3 changer transitions 29/183 dead transitions. [2023-12-05 21:14:45,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 183 transitions, 658 flow [2023-12-05 21:14:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:14:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:14:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-12-05 21:14:45,257 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7427325581395349 [2023-12-05 21:14:45,257 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-12-05 21:14:45,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-12-05 21:14:45,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:45,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-12-05 21:14:45,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 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:45,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 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:45,260 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 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:45,260 INFO L308 CegarLoopForPetriNet]: 154 programPoint places, 0 predicate places. [2023-12-05 21:14:45,260 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 183 transitions, 658 flow [2023-12-05 21:14:45,261 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 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:45,261 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:45,261 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:45,261 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:14:45,261 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:14:45,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:45,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1317130153, now seen corresponding path program 1 times [2023-12-05 21:14:45,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:45,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127190857] [2023-12-05 21:14:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:45,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:45,440 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:14:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:45,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127190857] [2023-12-05 21:14:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127190857] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:14:45,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025393000] [2023-12-05 21:14:45,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:45,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:14:45,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:45,444 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:14:45,460 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:14:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:45,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:14:45,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:14:45,542 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:14:45,606 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:14:45,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:14:45,682 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:14:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025393000] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:14:45,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:14:45,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:14:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964723573] [2023-12-05 21:14:45,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:14:45,683 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:14:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:14:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:14:45,685 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 172 [2023-12-05 21:14:45,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 183 transitions, 658 flow. Second operand has 11 states, 11 states have (on average 113.63636363636364) internal successors, (1250), 11 states have internal predecessors, (1250), 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:45,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:45,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 172 [2023-12-05 21:14:45,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:46,262 INFO L124 PetriNetUnfolderBase]: 1636/4480 cut-off events. [2023-12-05 21:14:46,262 INFO L125 PetriNetUnfolderBase]: For 2377/2495 co-relation queries the response was YES. [2023-12-05 21:14:46,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11535 conditions, 4480 events. 1636/4480 cut-off events. For 2377/2495 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 38370 event pairs, 28 based on Foata normal form. 3/4106 useless extension candidates. Maximal degree in co-relation 1591. Up to 2059 conditions per place. [2023-12-05 21:14:46,293 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 100 selfloop transitions, 9 changer transitions 29/245 dead transitions. [2023-12-05 21:14:46,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 245 transitions, 1296 flow [2023-12-05 21:14:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:14:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:14:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1237 transitions. [2023-12-05 21:14:46,296 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7191860465116279 [2023-12-05 21:14:46,296 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1237 transitions. [2023-12-05 21:14:46,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1237 transitions. [2023-12-05 21:14:46,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:46,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1237 transitions. [2023-12-05 21:14:46,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.7) internal successors, (1237), 10 states have internal predecessors, (1237), 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:46,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:46,302 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:46,303 INFO L308 CegarLoopForPetriNet]: 154 programPoint places, 8 predicate places. [2023-12-05 21:14:46,303 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 245 transitions, 1296 flow [2023-12-05 21:14:46,305 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.63636363636364) internal successors, (1250), 11 states have internal predecessors, (1250), 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:46,305 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:46,305 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:46,323 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:14:46,510 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:14:46,510 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:14:46,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1852172552, now seen corresponding path program 1 times [2023-12-05 21:14:46,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:46,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377214298] [2023-12-05 21:14:46,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:46,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:14:46,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:14:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:14:46,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:14:46,534 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:14:46,534 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:14:46,534 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:14:46,534 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:14:46,535 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:14:46,535 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:14:46,535 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:14:46,535 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:14:46,535 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:14:46,535 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:14:46,551 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:14:46,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 205 transitions, 437 flow [2023-12-05 21:14:46,582 INFO L124 PetriNetUnfolderBase]: 66/471 cut-off events. [2023-12-05 21:14:46,583 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:14:46,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 471 events. 66/471 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1767 event pairs, 1 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 322. Up to 16 conditions per place. [2023-12-05 21:14:46,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 205 transitions, 437 flow [2023-12-05 21:14:46,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 205 transitions, 437 flow [2023-12-05 21:14:46,588 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:14:46,589 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;@51cf726b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:14:46,589 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:14:46,591 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:14:46,591 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-12-05 21:14:46,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:14:46,591 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:46,591 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:46,591 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:14:46,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1966897225, now seen corresponding path program 1 times [2023-12-05 21:14:46,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:46,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277558859] [2023-12-05 21:14:46,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:46,619 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:46,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:46,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277558859] [2023-12-05 21:14:46,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277558859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:46,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:46,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:14:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958721614] [2023-12-05 21:14:46,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:46,620 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:14:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:46,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:14:46,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:14:46,621 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 205 [2023-12-05 21:14:46,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 205 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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:46,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:46,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 205 [2023-12-05 21:14:46,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:49,978 INFO L124 PetriNetUnfolderBase]: 12842/32105 cut-off events. [2023-12-05 21:14:49,978 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2023-12-05 21:14:50,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50715 conditions, 32105 events. 12842/32105 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 373806 event pairs, 9043 based on Foata normal form. 10178/39589 useless extension candidates. Maximal degree in co-relation 5618. Up to 13148 conditions per place. [2023-12-05 21:14:50,290 INFO L140 encePairwiseOnDemand]: 177/205 looper letters, 38 selfloop transitions, 1 changer transitions 23/194 dead transitions. [2023-12-05 21:14:50,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 194 transitions, 535 flow [2023-12-05 21:14:50,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-12-05 21:14:50,292 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.832520325203252 [2023-12-05 21:14:50,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-12-05 21:14:50,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-12-05 21:14:50,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:50,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-12-05 21:14:50,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:50,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:50,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:50,295 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, -3 predicate places. [2023-12-05 21:14:50,295 INFO L500 AbstractCegarLoop]: Abstraction has has 179 places, 194 transitions, 535 flow [2023-12-05 21:14:50,295 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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:50,295 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:50,295 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:50,296 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:14:50,296 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:50,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:50,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1966897224, now seen corresponding path program 1 times [2023-12-05 21:14:50,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:50,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299623578] [2023-12-05 21:14:50,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:50,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:50,353 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:50,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:50,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299623578] [2023-12-05 21:14:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299623578] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317867444] [2023-12-05 21:14:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:50,353 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:14:50,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:50,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:14:50,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:14:50,355 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 205 [2023-12-05 21:14:50,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 194 transitions, 535 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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:50,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:50,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 205 [2023-12-05 21:14:50,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:54,451 INFO L124 PetriNetUnfolderBase]: 17746/43198 cut-off events. [2023-12-05 21:14:54,452 INFO L125 PetriNetUnfolderBase]: For 7453/8771 co-relation queries the response was YES. [2023-12-05 21:14:54,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91421 conditions, 43198 events. 17746/43198 cut-off events. For 7453/8771 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 507025 event pairs, 8953 based on Foata normal form. 0/40688 useless extension candidates. Maximal degree in co-relation 9905. Up to 21545 conditions per place. [2023-12-05 21:14:54,712 INFO L140 encePairwiseOnDemand]: 199/205 looper letters, 51 selfloop transitions, 3 changer transitions 41/222 dead transitions. [2023-12-05 21:14:54,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 222 transitions, 827 flow [2023-12-05 21:14:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:14:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:14:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2023-12-05 21:14:54,715 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7329268292682927 [2023-12-05 21:14:54,715 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 601 transitions. [2023-12-05 21:14:54,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 601 transitions. [2023-12-05 21:14:54,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:54,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 601 transitions. [2023-12-05 21:14:54,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 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:54,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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:54,717 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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:54,719 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, 0 predicate places. [2023-12-05 21:14:54,719 INFO L500 AbstractCegarLoop]: Abstraction has has 182 places, 222 transitions, 827 flow [2023-12-05 21:14:54,719 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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:54,719 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:54,719 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:54,719 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:14:54,720 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:14:54,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1081587959, now seen corresponding path program 1 times [2023-12-05 21:14:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794124084] [2023-12-05 21:14:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:54,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:54,824 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:14:54,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794124084] [2023-12-05 21:14:54,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794124084] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:14:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350601882] [2023-12-05 21:14:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:54,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:14:54,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:54,826 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:14:54,854 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:14:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:54,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:14:54,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:14:54,906 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:14:54,966 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:14:54,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:14:55,035 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:14:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350601882] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:14:55,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:14:55,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:14:55,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373940307] [2023-12-05 21:14:55,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:14:55,036 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:14:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:14:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:14:55,037 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 205 [2023-12-05 21:14:55,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 222 transitions, 827 flow. Second operand has 11 states, 11 states have (on average 132.63636363636363) internal successors, (1459), 11 states have internal predecessors, (1459), 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:55,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:55,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 205 [2023-12-05 21:14:55,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:59,320 INFO L124 PetriNetUnfolderBase]: 19446/43318 cut-off events. [2023-12-05 21:14:59,320 INFO L125 PetriNetUnfolderBase]: For 22148/26790 co-relation queries the response was YES. [2023-12-05 21:14:59,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119100 conditions, 43318 events. 19446/43318 cut-off events. For 22148/26790 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 474536 event pairs, 1127 based on Foata normal form. 3/39247 useless extension candidates. Maximal degree in co-relation 12695. Up to 22293 conditions per place. [2023-12-05 21:14:59,641 INFO L140 encePairwiseOnDemand]: 195/205 looper letters, 120 selfloop transitions, 11 changer transitions 41/298 dead transitions. [2023-12-05 21:14:59,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 298 transitions, 1603 flow [2023-12-05 21:14:59,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:14:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:14:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1455 transitions. [2023-12-05 21:14:59,643 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7097560975609756 [2023-12-05 21:14:59,644 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1455 transitions. [2023-12-05 21:14:59,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1455 transitions. [2023-12-05 21:14:59,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:59,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1455 transitions. [2023-12-05 21:14:59,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 145.5) internal successors, (1455), 10 states have internal predecessors, (1455), 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:59,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 205.0) internal successors, (2255), 11 states have internal predecessors, (2255), 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:59,649 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 205.0) internal successors, (2255), 11 states have internal predecessors, (2255), 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:59,649 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, 9 predicate places. [2023-12-05 21:14:59,649 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 298 transitions, 1603 flow [2023-12-05 21:14:59,650 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 132.63636363636363) internal successors, (1459), 11 states have internal predecessors, (1459), 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:59,650 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:59,650 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:59,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-05 21:14:59,854 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:14:59,855 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:14:59,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash 834964396, now seen corresponding path program 1 times [2023-12-05 21:14:59,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:59,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504465997] [2023-12-05 21:14:59,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:59,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-05 21:14:59,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:59,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504465997] [2023-12-05 21:14:59,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504465997] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:14:59,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429582800] [2023-12-05 21:14:59,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:59,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:14:59,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:59,958 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:14:59,988 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:15:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:00,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-05 21:15:00,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:00,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:15:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:00,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429582800] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:15:00,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:15:00,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2023-12-05 21:15:00,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374779264] [2023-12-05 21:15:00,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:15:00,134 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-05 21:15:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:00,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-05 21:15:00,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-12-05 21:15:00,136 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 205 [2023-12-05 21:15:00,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 298 transitions, 1603 flow. Second operand has 17 states, 17 states have (on average 127.23529411764706) internal successors, (2163), 17 states have internal predecessors, (2163), 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:15:00,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:00,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 205 [2023-12-05 21:15:00,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:01,672 INFO L124 PetriNetUnfolderBase]: 6372/12928 cut-off events. [2023-12-05 21:15:01,672 INFO L125 PetriNetUnfolderBase]: For 14587/16817 co-relation queries the response was YES. [2023-12-05 21:15:01,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47631 conditions, 12928 events. 6372/12928 cut-off events. For 14587/16817 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 114190 event pairs, 189 based on Foata normal form. 215/12621 useless extension candidates. Maximal degree in co-relation 5111. Up to 8691 conditions per place. [2023-12-05 21:15:01,781 INFO L140 encePairwiseOnDemand]: 199/205 looper letters, 161 selfloop transitions, 11 changer transitions 0/266 dead transitions. [2023-12-05 21:15:01,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 266 transitions, 1894 flow [2023-12-05 21:15:01,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:15:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:15:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1768 transitions. [2023-12-05 21:15:01,785 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6634146341463415 [2023-12-05 21:15:01,785 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1768 transitions. [2023-12-05 21:15:01,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1768 transitions. [2023-12-05 21:15:01,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:01,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1768 transitions. [2023-12-05 21:15:01,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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:15:01,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 205.0) internal successors, (2870), 14 states have internal predecessors, (2870), 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:15:01,793 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 205.0) internal successors, (2870), 14 states have internal predecessors, (2870), 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:15:01,794 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, -21 predicate places. [2023-12-05 21:15:01,794 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 266 transitions, 1894 flow [2023-12-05 21:15:01,795 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 127.23529411764706) internal successors, (2163), 17 states have internal predecessors, (2163), 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:15:01,795 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:01,796 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:01,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-05 21:15:02,000 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:15:02,001 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:15:02,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash -734692398, now seen corresponding path program 1 times [2023-12-05 21:15:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:02,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256616935] [2023-12-05 21:15:02,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:02,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:02,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:02,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256616935] [2023-12-05 21:15:02,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256616935] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393239034] [2023-12-05 21:15:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:02,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:02,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:02,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:15:02,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-05 21:15:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:02,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-05 21:15:02,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:02,495 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:15:02,704 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:15:02,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:15:02,919 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:15:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393239034] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:15:02,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:15:02,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-12-05 21:15:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526489808] [2023-12-05 21:15:02,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:15:02,921 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-05 21:15:02,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-05 21:15:02,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2023-12-05 21:15:02,923 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 205 [2023-12-05 21:15:02,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 266 transitions, 1894 flow. Second operand has 27 states, 27 states have (on average 132.62962962962962) internal successors, (3581), 27 states have internal predecessors, (3581), 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:15:02,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:02,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 205 [2023-12-05 21:15:02,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:04,560 INFO L124 PetriNetUnfolderBase]: 5490/11854 cut-off events. [2023-12-05 21:15:04,561 INFO L125 PetriNetUnfolderBase]: For 20039/22751 co-relation queries the response was YES. [2023-12-05 21:15:04,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49551 conditions, 11854 events. 5490/11854 cut-off events. For 20039/22751 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 106764 event pairs, 242 based on Foata normal form. 951/12690 useless extension candidates. Maximal degree in co-relation 5301. Up to 7466 conditions per place. [2023-12-05 21:15:04,660 INFO L140 encePairwiseOnDemand]: 199/205 looper letters, 160 selfloop transitions, 11 changer transitions 0/265 dead transitions. [2023-12-05 21:15:04,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 265 transitions, 2226 flow [2023-12-05 21:15:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:15:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:15:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1844 transitions. [2023-12-05 21:15:04,679 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6919324577861163 [2023-12-05 21:15:04,679 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1844 transitions. [2023-12-05 21:15:04,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1844 transitions. [2023-12-05 21:15:04,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:04,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1844 transitions. [2023-12-05 21:15:04,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 141.84615384615384) internal successors, (1844), 13 states have internal predecessors, (1844), 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:15:04,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 205.0) internal successors, (2870), 14 states have internal predecessors, (2870), 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:15:04,685 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 205.0) internal successors, (2870), 14 states have internal predecessors, (2870), 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:15:04,686 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, -10 predicate places. [2023-12-05 21:15:04,686 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 265 transitions, 2226 flow [2023-12-05 21:15:04,687 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 132.62962962962962) internal successors, (3581), 27 states have internal predecessors, (3581), 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:15:04,687 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:04,687 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:04,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-05 21:15:04,887 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-05 21:15:04,888 INFO L425 AbstractCegarLoop]: === Iteration 6 === 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:15:04,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1300627064, now seen corresponding path program 1 times [2023-12-05 21:15:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690895587] [2023-12-05 21:15:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:04,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:15:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:04,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:15:04,921 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:15:04,921 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:15:04,922 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:15:04,922 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:15:04,922 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:15:04,922 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:15:04,922 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:15:04,922 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:15:04,923 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:15:04,923 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:15:04,947 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:15:04,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 238 transitions, 516 flow [2023-12-05 21:15:04,992 INFO L124 PetriNetUnfolderBase]: 101/708 cut-off events. [2023-12-05 21:15:04,992 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-05 21:15:04,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 708 events. 101/708 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2984 event pairs, 6 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 491. Up to 32 conditions per place. [2023-12-05 21:15:04,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 238 transitions, 516 flow [2023-12-05 21:15:05,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 238 transitions, 516 flow [2023-12-05 21:15:05,002 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:15:05,002 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;@51cf726b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:15:05,002 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:15:05,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:15:05,004 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2023-12-05 21:15:05,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:15:05,004 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:05,004 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:05,004 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:15:05,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2078863387, now seen corresponding path program 1 times [2023-12-05 21:15:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840830610] [2023-12-05 21:15:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:05,024 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:15:05,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:05,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840830610] [2023-12-05 21:15:05,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840830610] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:05,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:05,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:15:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900428547] [2023-12-05 21:15:05,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:05,025 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:05,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:05,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:05,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:05,026 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 238 [2023-12-05 21:15:05,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 238 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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:15:05,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:05,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 238 [2023-12-05 21:15:05,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:38,943 INFO L124 PetriNetUnfolderBase]: 130164/273019 cut-off events. [2023-12-05 21:15:38,943 INFO L125 PetriNetUnfolderBase]: For 10376/10376 co-relation queries the response was YES. [2023-12-05 21:15:40,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447698 conditions, 273019 events. 130164/273019 cut-off events. For 10376/10376 co-relation queries the response was YES. Maximal size of possible extension queue 8165. Compared 3596883 event pairs, 90828 based on Foata normal form. 98487/351501 useless extension candidates. Maximal degree in co-relation 50726. Up to 121191 conditions per place. [2023-12-05 21:15:42,270 INFO L140 encePairwiseOnDemand]: 204/238 looper letters, 46 selfloop transitions, 1 changer transitions 29/227 dead transitions. [2023-12-05 21:15:42,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 227 transitions, 642 flow [2023-12-05 21:15:42,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2023-12-05 21:15:42,296 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-12-05 21:15:42,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 595 transitions. [2023-12-05 21:15:42,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 595 transitions. [2023-12-05 21:15:42,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:42,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 595 transitions. [2023-12-05 21:15:42,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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:15:42,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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:15:42,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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:15:42,302 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, -3 predicate places. [2023-12-05 21:15:42,302 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 227 transitions, 642 flow [2023-12-05 21:15:42,312 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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:15:42,312 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:42,312 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:42,312 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:15:42,312 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:15:42,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2078863386, now seen corresponding path program 1 times [2023-12-05 21:15:42,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:42,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626465579] [2023-12-05 21:15:42,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:42,388 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:15:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626465579] [2023-12-05 21:15:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626465579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:42,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:42,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:15:42,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491651471] [2023-12-05 21:15:42,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:42,390 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:15:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:15:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:15:42,391 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 238 [2023-12-05 21:15:42,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 227 transitions, 642 flow. Second operand has 4 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 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:15:42,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:42,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 238 [2023-12-05 21:15:42,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand