/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_36-indirect_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:16:11,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:16:11,740 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:16:11,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:16:11,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:16:11,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:16:11,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:16:11,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:16:11,767 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:16:11,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:16:11,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:16:11,771 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:16:11,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:16:11,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:16:11,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:16:11,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:16:11,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:16:11,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:16:11,773 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:16:11,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:16:11,773 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:16:11,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:16:11,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:16:11,774 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:16:11,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:16:11,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:11,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:16:11,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:16:11,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:16:11,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:16:11,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:16:11,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:16:11,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:16:11,776 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:16:11,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:16:11,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:16:11,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:16:11,991 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:16:11,991 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:16:11,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_36-indirect_racefree.i [2023-12-05 21:16:13,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:16:13,251 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:16:13,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_36-indirect_racefree.i [2023-12-05 21:16:13,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72e756cf/fedc23a45a3f4499a9d25940e28cf9f9/FLAGb3540b52e [2023-12-05 21:16:13,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72e756cf/fedc23a45a3f4499a9d25940e28cf9f9 [2023-12-05 21:16:13,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:16:13,273 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:16:13,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:13,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:16:13,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:16:13,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d427d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13, skipping insertion in model container [2023-12-05 21:16:13,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,313 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:16:13,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:16:13,543 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:16:13,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:16:13,634 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:16:13,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13 WrapperNode [2023-12-05 21:16:13,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:13,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:16:13,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:16:13,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:16:13,641 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:16:13" (1/1) ... [2023-12-05 21:16:13,649 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:16:13" (1/1) ... [2023-12-05 21:16:13,667 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2023-12-05 21:16:13,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:16:13,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:16:13,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:16:13,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:16:13,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:16:13,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:16:13,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:16:13,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:16:13,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13" (1/1) ... [2023-12-05 21:16:13,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:13,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:13,732 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:16:13,749 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:16:13,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:16:13,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:16:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:16:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:16:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:16:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:16:13,756 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:16:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:16:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:16:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:16:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:16:13,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:16:13,760 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:16:13,884 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:16:13,885 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:16:14,075 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:16:14,100 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:16:14,100 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-05 21:16:14,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:14 BoogieIcfgContainer [2023-12-05 21:16:14,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:16:14,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:16:14,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:16:14,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:16:14,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:16:13" (1/3) ... [2023-12-05 21:16:14,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634d4aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:14, skipping insertion in model container [2023-12-05 21:16:14,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:13" (2/3) ... [2023-12-05 21:16:14,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634d4aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:14, skipping insertion in model container [2023-12-05 21:16:14,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:14" (3/3) ... [2023-12-05 21:16:14,116 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_36-indirect_racefree.i [2023-12-05 21:16:14,132 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:16:14,132 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-12-05 21:16:14,132 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:16:14,209 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:16:14,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 138 transitions, 283 flow [2023-12-05 21:16:14,307 INFO L124 PetriNetUnfolderBase]: 19/190 cut-off events. [2023-12-05 21:16:14,307 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:16:14,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 190 events. 19/190 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 612 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2023-12-05 21:16:14,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 138 transitions, 283 flow [2023-12-05 21:16:14,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 138 transitions, 283 flow [2023-12-05 21:16:14,323 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:14,328 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;@1dd62378, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:14,328 INFO L363 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-12-05 21:16:14,335 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:14,335 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-12-05 21:16:14,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:14,335 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:14,336 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] [2023-12-05 21:16:14,336 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:14,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash 284097716, now seen corresponding path program 1 times [2023-12-05 21:16:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:14,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007386012] [2023-12-05 21:16:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:14,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:14,633 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:16:14,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:14,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007386012] [2023-12-05 21:16:14,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007386012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:14,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:14,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102727390] [2023-12-05 21:16:14,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:14,645 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:14,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:14,685 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 138 [2023-12-05 21:16:14,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 138 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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:16:14,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:14,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 138 [2023-12-05 21:16:14,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:14,927 INFO L124 PetriNetUnfolderBase]: 183/774 cut-off events. [2023-12-05 21:16:14,927 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:16:14,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 774 events. 183/774 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5088 event pairs, 140 based on Foata normal form. 129/779 useless extension candidates. Maximal degree in co-relation 1086. Up to 317 conditions per place. [2023-12-05 21:16:14,936 INFO L140 encePairwiseOnDemand]: 122/138 looper letters, 46 selfloop transitions, 2 changer transitions 3/135 dead transitions. [2023-12-05 21:16:14,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 135 transitions, 379 flow [2023-12-05 21:16:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-12-05 21:16:14,950 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7946859903381642 [2023-12-05 21:16:14,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-12-05 21:16:14,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-12-05 21:16:14,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:14,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-12-05 21:16:14,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:16:14,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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:16:14,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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:16:14,967 INFO L308 CegarLoopForPetriNet]: 128 programPoint places, -3 predicate places. [2023-12-05 21:16:14,967 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 135 transitions, 379 flow [2023-12-05 21:16:14,968 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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:16:14,968 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:14,968 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] [2023-12-05 21:16:14,969 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:16:14,969 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:14,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:14,970 INFO L85 PathProgramCache]: Analyzing trace with hash 284097717, now seen corresponding path program 1 times [2023-12-05 21:16:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:14,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435486067] [2023-12-05 21:16:14,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:15,151 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:16:15,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:15,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435486067] [2023-12-05 21:16:15,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435486067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:15,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:15,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:15,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827880548] [2023-12-05 21:16:15,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:15,153 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:15,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:15,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:15,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:15,155 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 138 [2023-12-05 21:16:15,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 135 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 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:16:15,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:15,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 138 [2023-12-05 21:16:15,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:15,365 INFO L124 PetriNetUnfolderBase]: 314/1162 cut-off events. [2023-12-05 21:16:15,365 INFO L125 PetriNetUnfolderBase]: For 243/259 co-relation queries the response was YES. [2023-12-05 21:16:15,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 1162 events. 314/1162 cut-off events. For 243/259 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7818 event pairs, 54 based on Foata normal form. 0/1050 useless extension candidates. Maximal degree in co-relation 2196. Up to 490 conditions per place. [2023-12-05 21:16:15,372 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 72 selfloop transitions, 4 changer transitions 6/165 dead transitions. [2023-12-05 21:16:15,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 165 transitions, 645 flow [2023-12-05 21:16:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-12-05 21:16:15,376 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7210144927536232 [2023-12-05 21:16:15,376 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-12-05 21:16:15,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-12-05 21:16:15,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:15,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-12-05 21:16:15,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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:16:15,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 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:16:15,380 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 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:16:15,381 INFO L308 CegarLoopForPetriNet]: 128 programPoint places, 0 predicate places. [2023-12-05 21:16:15,381 INFO L500 AbstractCegarLoop]: Abstraction has has 128 places, 165 transitions, 645 flow [2023-12-05 21:16:15,381 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 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:16:15,381 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:15,381 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:16:15,381 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:16:15,381 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:15,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1974845743, now seen corresponding path program 1 times [2023-12-05 21:16:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:15,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850340328] [2023-12-05 21:16:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:15,582 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:16:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850340328] [2023-12-05 21:16:15,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850340328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:15,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:15,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:16:15,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947238653] [2023-12-05 21:16:15,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:15,585 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:16:15,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:15,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:16:15,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:16:15,589 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 138 [2023-12-05 21:16:15,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 165 transitions, 645 flow. Second operand has 8 states, 8 states have (on average 77.375) internal successors, (619), 8 states have internal predecessors, (619), 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:16:15,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:15,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 138 [2023-12-05 21:16:15,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:15,899 INFO L124 PetriNetUnfolderBase]: 279/1142 cut-off events. [2023-12-05 21:16:15,900 INFO L125 PetriNetUnfolderBase]: For 761/761 co-relation queries the response was YES. [2023-12-05 21:16:15,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2767 conditions, 1142 events. 279/1142 cut-off events. For 761/761 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7562 event pairs, 14 based on Foata normal form. 72/1134 useless extension candidates. Maximal degree in co-relation 2637. Up to 450 conditions per place. [2023-12-05 21:16:15,904 INFO L140 encePairwiseOnDemand]: 123/138 looper letters, 91 selfloop transitions, 13 changer transitions 12/190 dead transitions. [2023-12-05 21:16:15,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 190 transitions, 1009 flow [2023-12-05 21:16:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:16:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:16:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 787 transitions. [2023-12-05 21:16:15,910 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6336553945249598 [2023-12-05 21:16:15,910 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 787 transitions. [2023-12-05 21:16:15,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 787 transitions. [2023-12-05 21:16:15,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:15,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 787 transitions. [2023-12-05 21:16:15,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.44444444444444) internal successors, (787), 9 states have internal predecessors, (787), 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:16:15,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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:16:15,914 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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:16:15,915 INFO L308 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2023-12-05 21:16:15,915 INFO L500 AbstractCegarLoop]: Abstraction has has 135 places, 190 transitions, 1009 flow [2023-12-05 21:16:15,916 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.375) internal successors, (619), 8 states have internal predecessors, (619), 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:16:15,916 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:15,916 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:16:15,916 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:16:15,916 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:15,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1974845742, now seen corresponding path program 1 times [2023-12-05 21:16:15,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:15,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137443886] [2023-12-05 21:16:15,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:16,172 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:16:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:16,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137443886] [2023-12-05 21:16:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137443886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:16,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:16,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:16:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043657895] [2023-12-05 21:16:16,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:16,176 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:16:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:16:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:16:16,178 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 138 [2023-12-05 21:16:16,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 190 transitions, 1009 flow. Second operand has 8 states, 8 states have (on average 77.375) internal successors, (619), 8 states have internal predecessors, (619), 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:16:16,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:16,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 138 [2023-12-05 21:16:16,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:16,379 INFO L124 PetriNetUnfolderBase]: 183/826 cut-off events. [2023-12-05 21:16:16,380 INFO L125 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2023-12-05 21:16:16,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 826 events. 183/826 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4843 event pairs, 10 based on Foata normal form. 104/870 useless extension candidates. Maximal degree in co-relation 2214. Up to 306 conditions per place. [2023-12-05 21:16:16,383 INFO L140 encePairwiseOnDemand]: 123/138 looper letters, 41 selfloop transitions, 5 changer transitions 41/159 dead transitions. [2023-12-05 21:16:16,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 159 transitions, 993 flow [2023-12-05 21:16:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:16:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:16:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 590 transitions. [2023-12-05 21:16:16,386 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6107660455486542 [2023-12-05 21:16:16,386 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 590 transitions. [2023-12-05 21:16:16,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 590 transitions. [2023-12-05 21:16:16,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:16,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 590 transitions. [2023-12-05 21:16:16,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 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:16:16,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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:16:16,390 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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:16:16,391 INFO L308 CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places. [2023-12-05 21:16:16,391 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 159 transitions, 993 flow [2023-12-05 21:16:16,391 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.375) internal successors, (619), 8 states have internal predecessors, (619), 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:16:16,392 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:16,392 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] [2023-12-05 21:16:16,392 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:16:16,392 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:16,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1097265744, now seen corresponding path program 1 times [2023-12-05 21:16:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:16,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754695575] [2023-12-05 21:16:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:16,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:16,513 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:16:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754695575] [2023-12-05 21:16:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754695575] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754035354] [2023-12-05 21:16:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:16,517 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:16:16,540 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:16:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:16,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:16,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:16,681 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:16:16,773 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:16:16,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:16,863 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:16:16,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754035354] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:16,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:16,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:16:16,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393366275] [2023-12-05 21:16:16,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:16,864 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:16:16,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:16,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:16:16,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:16:16,865 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 138 [2023-12-05 21:16:16,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 159 transitions, 993 flow. Second operand has 14 states, 14 states have (on average 82.57142857142857) internal successors, (1156), 14 states have internal predecessors, (1156), 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:16:16,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:16,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 138 [2023-12-05 21:16:16,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:17,009 INFO L124 PetriNetUnfolderBase]: 50/208 cut-off events. [2023-12-05 21:16:17,009 INFO L125 PetriNetUnfolderBase]: For 552/556 co-relation queries the response was YES. [2023-12-05 21:16:17,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 208 events. 50/208 cut-off events. For 552/556 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 671 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 593. Up to 75 conditions per place. [2023-12-05 21:16:17,011 INFO L140 encePairwiseOnDemand]: 131/138 looper letters, 51 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2023-12-05 21:16:17,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 103 transitions, 762 flow [2023-12-05 21:16:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:16:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:16:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 618 transitions. [2023-12-05 21:16:17,012 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.639751552795031 [2023-12-05 21:16:17,013 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 618 transitions. [2023-12-05 21:16:17,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 618 transitions. [2023-12-05 21:16:17,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:17,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 618 transitions. [2023-12-05 21:16:17,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 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:16:17,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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:16:17,020 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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:16:17,021 INFO L308 CegarLoopForPetriNet]: 128 programPoint places, -32 predicate places. [2023-12-05 21:16:17,021 INFO L500 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 762 flow [2023-12-05 21:16:17,022 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 82.57142857142857) internal successors, (1156), 14 states have internal predecessors, (1156), 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:16:17,022 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:17,022 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] [2023-12-05 21:16:17,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-05 21:16:17,226 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:17,228 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:17,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash -344499951, now seen corresponding path program 1 times [2023-12-05 21:16:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815538127] [2023-12-05 21:16:17,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:17,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:16:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:17,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:16:17,273 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:16:17,273 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2023-12-05 21:16:17,274 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2023-12-05 21:16:17,275 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2023-12-05 21:16:17,275 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2023-12-05 21:16:17,275 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2023-12-05 21:16:17,275 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2023-12-05 21:16:17,275 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2023-12-05 21:16:17,277 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2023-12-05 21:16:17,277 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2023-12-05 21:16:17,279 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2023-12-05 21:16:17,279 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2023-12-05 21:16:17,279 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2023-12-05 21:16:17,279 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2023-12-05 21:16:17,279 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2023-12-05 21:16:17,279 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2023-12-05 21:16:17,279 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2023-12-05 21:16:17,279 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2023-12-05 21:16:17,279 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2023-12-05 21:16:17,280 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2023-12-05 21:16:17,280 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2023-12-05 21:16:17,280 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2023-12-05 21:16:17,280 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2023-12-05 21:16:17,280 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2023-12-05 21:16:17,280 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:16:17,280 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:16:17,282 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:16:17,282 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:16:17,313 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:16:17,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 183 transitions, 382 flow [2023-12-05 21:16:17,342 INFO L124 PetriNetUnfolderBase]: 34/315 cut-off events. [2023-12-05 21:16:17,342 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:16:17,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 315 events. 34/315 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1206 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 192. Up to 8 conditions per place. [2023-12-05 21:16:17,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 183 transitions, 382 flow [2023-12-05 21:16:17,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 183 transitions, 382 flow [2023-12-05 21:16:17,347 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:17,348 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;@1dd62378, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:17,348 INFO L363 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-12-05 21:16:17,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:17,350 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-12-05 21:16:17,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:17,350 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:17,350 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] [2023-12-05 21:16:17,350 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:17,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:17,350 INFO L85 PathProgramCache]: Analyzing trace with hash -274475893, now seen corresponding path program 1 times [2023-12-05 21:16:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:17,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765539947] [2023-12-05 21:16:17,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:17,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:17,378 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:16:17,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:17,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765539947] [2023-12-05 21:16:17,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765539947] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:17,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:17,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459170208] [2023-12-05 21:16:17,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:17,379 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:17,381 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 183 [2023-12-05 21:16:17,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 183 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:16:17,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:17,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 183 [2023-12-05 21:16:17,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:18,848 INFO L124 PetriNetUnfolderBase]: 5995/14680 cut-off events. [2023-12-05 21:16:18,848 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-12-05 21:16:18,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24243 conditions, 14680 events. 5995/14680 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 149946 event pairs, 4606 based on Foata normal form. 2914/14796 useless extension candidates. Maximal degree in co-relation 1949. Up to 7347 conditions per place. [2023-12-05 21:16:18,925 INFO L140 encePairwiseOnDemand]: 161/183 looper letters, 79 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2023-12-05 21:16:18,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 188 transitions, 554 flow [2023-12-05 21:16:18,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-12-05 21:16:18,926 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8014571948998178 [2023-12-05 21:16:18,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-12-05 21:16:18,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-12-05 21:16:18,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:18,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-12-05 21:16:18,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:18,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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:16:18,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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:16:18,929 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, -3 predicate places. [2023-12-05 21:16:18,929 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 188 transitions, 554 flow [2023-12-05 21:16:18,929 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:16:18,929 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:18,929 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] [2023-12-05 21:16:18,930 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:16:18,930 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:18,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash -274475892, now seen corresponding path program 1 times [2023-12-05 21:16:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:18,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732009973] [2023-12-05 21:16:18,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:18,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:18,978 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:16:18,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:18,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732009973] [2023-12-05 21:16:18,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732009973] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:18,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:18,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:18,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683604195] [2023-12-05 21:16:18,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:18,979 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:18,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:18,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:18,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:18,980 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 183 [2023-12-05 21:16:18,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 188 transitions, 554 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 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:16:18,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:18,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 183 [2023-12-05 21:16:18,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:21,780 INFO L124 PetriNetUnfolderBase]: 12948/29368 cut-off events. [2023-12-05 21:16:21,781 INFO L125 PetriNetUnfolderBase]: For 7293/7769 co-relation queries the response was YES. [2023-12-05 21:16:21,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63267 conditions, 29368 events. 12948/29368 cut-off events. For 7293/7769 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 310701 event pairs, 6218 based on Foata normal form. 0/26389 useless extension candidates. Maximal degree in co-relation 6847. Up to 15809 conditions per place. [2023-12-05 21:16:21,986 INFO L140 encePairwiseOnDemand]: 177/183 looper letters, 120 selfloop transitions, 4 changer transitions 0/234 dead transitions. [2023-12-05 21:16:21,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 234 transitions, 956 flow [2023-12-05 21:16:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2023-12-05 21:16:21,987 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7131147540983607 [2023-12-05 21:16:21,987 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2023-12-05 21:16:21,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2023-12-05 21:16:21,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:21,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2023-12-05 21:16:21,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 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:16:21,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 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:16:21,990 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 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:16:21,990 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, 0 predicate places. [2023-12-05 21:16:21,991 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 234 transitions, 956 flow [2023-12-05 21:16:21,991 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 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:16:21,991 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:21,991 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:16:21,991 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:16:21,991 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:21,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:21,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1002366109, now seen corresponding path program 1 times [2023-12-05 21:16:21,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:21,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903634141] [2023-12-05 21:16:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:21,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:22,079 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:16:22,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903634141] [2023-12-05 21:16:22,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903634141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:22,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:22,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:16:22,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678862661] [2023-12-05 21:16:22,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:22,080 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:16:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:22,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:16:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:16:22,081 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 183 [2023-12-05 21:16:22,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 234 transitions, 956 flow. Second operand has 8 states, 8 states have (on average 96.375) internal successors, (771), 8 states have internal predecessors, (771), 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:16:22,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:22,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 183 [2023-12-05 21:16:22,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:24,548 INFO L124 PetriNetUnfolderBase]: 9953/24785 cut-off events. [2023-12-05 21:16:24,548 INFO L125 PetriNetUnfolderBase]: For 16238/16238 co-relation queries the response was YES. [2023-12-05 21:16:24,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66872 conditions, 24785 events. 9953/24785 cut-off events. For 16238/16238 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 263683 event pairs, 3222 based on Foata normal form. 2166/25492 useless extension candidates. Maximal degree in co-relation 7020. Up to 11941 conditions per place. [2023-12-05 21:16:24,669 INFO L140 encePairwiseOnDemand]: 160/183 looper letters, 181 selfloop transitions, 23 changer transitions 0/299 dead transitions. [2023-12-05 21:16:24,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 299 transitions, 1708 flow [2023-12-05 21:16:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:16:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:16:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1060 transitions. [2023-12-05 21:16:24,671 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6435944140862173 [2023-12-05 21:16:24,671 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1060 transitions. [2023-12-05 21:16:24,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1060 transitions. [2023-12-05 21:16:24,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:24,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1060 transitions. [2023-12-05 21:16:24,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.77777777777777) internal successors, (1060), 9 states have internal predecessors, (1060), 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:16:24,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 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:16:24,677 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 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:16:24,677 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, 7 predicate places. [2023-12-05 21:16:24,678 INFO L500 AbstractCegarLoop]: Abstraction has has 175 places, 299 transitions, 1708 flow [2023-12-05 21:16:24,678 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.375) internal successors, (771), 8 states have internal predecessors, (771), 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:16:24,678 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:24,678 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:16:24,678 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:16:24,678 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:24,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:24,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1002366110, now seen corresponding path program 1 times [2023-12-05 21:16:24,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:24,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597371114] [2023-12-05 21:16:24,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:24,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:24,818 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:16:24,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:24,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597371114] [2023-12-05 21:16:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597371114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:24,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:24,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:16:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574960609] [2023-12-05 21:16:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:24,819 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:16:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:24,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:16:24,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:16:24,820 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 183 [2023-12-05 21:16:24,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 299 transitions, 1708 flow. Second operand has 8 states, 8 states have (on average 96.375) internal successors, (771), 8 states have internal predecessors, (771), 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:16:24,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:24,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 183 [2023-12-05 21:16:24,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:26,026 INFO L124 PetriNetUnfolderBase]: 4622/12304 cut-off events. [2023-12-05 21:16:26,026 INFO L125 PetriNetUnfolderBase]: For 18111/18111 co-relation queries the response was YES. [2023-12-05 21:16:26,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40255 conditions, 12304 events. 4622/12304 cut-off events. For 18111/18111 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 119303 event pairs, 1580 based on Foata normal form. 2324/13821 useless extension candidates. Maximal degree in co-relation 4200. Up to 5967 conditions per place. [2023-12-05 21:16:26,093 INFO L140 encePairwiseOnDemand]: 160/183 looper letters, 53 selfloop transitions, 5 changer transitions 87/238 dead transitions. [2023-12-05 21:16:26,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 238 transitions, 1628 flow [2023-12-05 21:16:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:16:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:16:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 761 transitions. [2023-12-05 21:16:26,095 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5940671350507416 [2023-12-05 21:16:26,096 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 761 transitions. [2023-12-05 21:16:26,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 761 transitions. [2023-12-05 21:16:26,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:26,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 761 transitions. [2023-12-05 21:16:26,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 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:16:26,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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:16:26,223 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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:16:26,223 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, -4 predicate places. [2023-12-05 21:16:26,223 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 238 transitions, 1628 flow [2023-12-05 21:16:26,223 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.375) internal successors, (771), 8 states have internal predecessors, (771), 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:16:26,223 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:26,224 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] [2023-12-05 21:16:26,224 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:16:26,224 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:26,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1749642236, now seen corresponding path program 1 times [2023-12-05 21:16:26,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:26,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900754475] [2023-12-05 21:16:26,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:26,327 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:16:26,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:26,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900754475] [2023-12-05 21:16:26,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900754475] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:26,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053374579] [2023-12-05 21:16:26,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:26,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:26,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:26,353 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:16:26,404 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:16:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:26,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:26,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:26,460 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:16:26,546 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:16:26,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:26,622 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:16:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053374579] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:26,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:26,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:16:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964572129] [2023-12-05 21:16:26,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:26,623 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:16:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:26,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:16:26,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:16:26,625 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 183 [2023-12-05 21:16:26,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 238 transitions, 1628 flow. Second operand has 14 states, 14 states have (on average 105.57142857142857) internal successors, (1478), 14 states have internal predecessors, (1478), 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:16:26,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:26,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 183 [2023-12-05 21:16:26,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:27,050 INFO L124 PetriNetUnfolderBase]: 1260/2760 cut-off events. [2023-12-05 21:16:27,051 INFO L125 PetriNetUnfolderBase]: For 9148/9172 co-relation queries the response was YES. [2023-12-05 21:16:27,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11406 conditions, 2760 events. 1260/2760 cut-off events. For 9148/9172 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 19006 event pairs, 0 based on Foata normal form. 0/2760 useless extension candidates. Maximal degree in co-relation 992. Up to 1889 conditions per place. [2023-12-05 21:16:27,069 INFO L140 encePairwiseOnDemand]: 176/183 looper letters, 124 selfloop transitions, 8 changer transitions 0/198 dead transitions. [2023-12-05 21:16:27,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 198 transitions, 1692 flow [2023-12-05 21:16:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:16:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:16:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1166 transitions. [2023-12-05 21:16:27,072 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6371584699453552 [2023-12-05 21:16:27,072 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1166 transitions. [2023-12-05 21:16:27,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1166 transitions. [2023-12-05 21:16:27,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:27,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1166 transitions. [2023-12-05 21:16:27,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.6) internal successors, (1166), 10 states have internal predecessors, (1166), 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:16:27,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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:16:27,077 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 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:16:27,077 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, -37 predicate places. [2023-12-05 21:16:27,078 INFO L500 AbstractCegarLoop]: Abstraction has has 131 places, 198 transitions, 1692 flow [2023-12-05 21:16:27,078 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 105.57142857142857) internal successors, (1478), 14 states have internal predecessors, (1478), 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:16:27,078 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:27,078 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] [2023-12-05 21:16:27,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-05 21:16:27,285 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,SelfDestructingSolverStorable10 [2023-12-05 21:16:27,285 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:27,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2051484440, now seen corresponding path program 1 times [2023-12-05 21:16:27,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:27,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20532920] [2023-12-05 21:16:27,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:27,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:27,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:16:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:27,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:16:27,318 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:16:27,319 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2023-12-05 21:16:27,319 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-12-05 21:16:27,319 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-12-05 21:16:27,319 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-12-05 21:16:27,319 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-12-05 21:16:27,319 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-12-05 21:16:27,319 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-12-05 21:16:27,319 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-12-05 21:16:27,319 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-12-05 21:16:27,319 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-12-05 21:16:27,320 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2023-12-05 21:16:27,321 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-12-05 21:16:27,321 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-12-05 21:16:27,321 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2023-12-05 21:16:27,322 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-12-05 21:16:27,322 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2023-12-05 21:16:27,322 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:16:27,322 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:16:27,322 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:16:27,322 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:16:27,350 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:16:27,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 228 transitions, 483 flow [2023-12-05 21:16:27,451 INFO L124 PetriNetUnfolderBase]: 54/479 cut-off events. [2023-12-05 21:16:27,451 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:16:27,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 479 events. 54/479 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1995 event pairs, 1 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 323. Up to 16 conditions per place. [2023-12-05 21:16:27,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 228 transitions, 483 flow [2023-12-05 21:16:27,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 228 transitions, 483 flow [2023-12-05 21:16:27,461 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:27,461 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;@1dd62378, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:27,461 INFO L363 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-12-05 21:16:27,462 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:27,462 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2023-12-05 21:16:27,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:27,463 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:27,463 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] [2023-12-05 21:16:27,463 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-12-05 21:16:27,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash -55082769, now seen corresponding path program 1 times [2023-12-05 21:16:27,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:27,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854430666] [2023-12-05 21:16:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:27,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:27,486 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:16:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854430666] [2023-12-05 21:16:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854430666] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:27,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:27,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:27,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873805259] [2023-12-05 21:16:27,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:27,487 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:27,488 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 228 [2023-12-05 21:16:27,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 228 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:16:27,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:27,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 228 [2023-12-05 21:16:27,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:56,529 INFO L124 PetriNetUnfolderBase]: 141380/275315 cut-off events. [2023-12-05 21:16:56,530 INFO L125 PetriNetUnfolderBase]: For 4141/4141 co-relation queries the response was YES. [2023-12-05 21:16:57,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472150 conditions, 275315 events. 141380/275315 cut-off events. For 4141/4141 co-relation queries the response was YES. Maximal size of possible extension queue 7031. Compared 3417914 event pairs, 108403 based on Foata normal form. 58902/277515 useless extension candidates. Maximal degree in co-relation 24224. Up to 150340 conditions per place. [2023-12-05 21:16:59,548 INFO L140 encePairwiseOnDemand]: 200/228 looper letters, 109 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2023-12-05 21:16:59,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 241 transitions, 731 flow [2023-12-05 21:16:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2023-12-05 21:16:59,550 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2023-12-05 21:16:59,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 551 transitions. [2023-12-05 21:16:59,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 551 transitions. [2023-12-05 21:16:59,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:59,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 551 transitions. [2023-12-05 21:16:59,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 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:16:59,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 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:16:59,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 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:16:59,553 INFO L308 CegarLoopForPetriNet]: 208 programPoint places, -3 predicate places. [2023-12-05 21:16:59,553 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 241 transitions, 731 flow [2023-12-05 21:16:59,553 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:16:59,553 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:59,553 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] [2023-12-05 21:16:59,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:16:59,553 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-12-05 21:16:59,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:59,554 INFO L85 PathProgramCache]: Analyzing trace with hash -55082768, now seen corresponding path program 1 times [2023-12-05 21:16:59,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:59,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352123764] [2023-12-05 21:16:59,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:59,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:59,599 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:16:59,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:59,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352123764] [2023-12-05 21:16:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352123764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:59,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:59,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:59,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067808331] [2023-12-05 21:16:59,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:59,600 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:59,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:59,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:59,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:59,601 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 228 [2023-12-05 21:16:59,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 241 transitions, 731 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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:16:59,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:59,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 228 [2023-12-05 21:16:59,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand