/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_11-ptr_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:13:33,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:13:34,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 05:13:34,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:13:34,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:13:34,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:13:34,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:13:34,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:13:34,074 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:13:34,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:13:34,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:13:34,078 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:13:34,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:13:34,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:13:34,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:13:34,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:13:34,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:13:34,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:13:34,080 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:13:34,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:13:34,081 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:13:34,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:13:34,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:13:34,082 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:13:34,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:13:34,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:13:34,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:13:34,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:13:34,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:13:34,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:13:34,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:13:34,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:13:34,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:13:34,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 05:13:34,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:13:34,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:13:34,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:13:34,347 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:13:34,348 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:13:34,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_11-ptr_racing.i [2023-11-30 05:13:35,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:13:35,668 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:13:35,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_11-ptr_racing.i [2023-11-30 05:13:35,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921a8f65d/d4d438bf70094259a54450aa7a59e1e2/FLAG4876c7416 [2023-11-30 05:13:35,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921a8f65d/d4d438bf70094259a54450aa7a59e1e2 [2023-11-30 05:13:35,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:13:35,692 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:13:35,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:13:35,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:13:35,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:13:35,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:13:35" (1/1) ... [2023-11-30 05:13:35,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286041b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:35, skipping insertion in model container [2023-11-30 05:13:35,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:13:35" (1/1) ... [2023-11-30 05:13:35,734 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:13:35,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:13:35,973 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:13:36,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:13:36,071 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:13:36,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36 WrapperNode [2023-11-30 05:13:36,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:13:36,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:13:36,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:13:36,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:13:36,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,130 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2023-11-30 05:13:36,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:13:36,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:13:36,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:13:36,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:13:36,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:13:36,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:13:36,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:13:36,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:13:36,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (1/1) ... [2023-11-30 05:13:36,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:13:36,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:13:36,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 05:13:36,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 05:13:36,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:13:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:13:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 05:13:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:13:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:13:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-30 05:13:36,213 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-30 05:13:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:13:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:13:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 05:13:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:13:36,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:13:36,214 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 05:13:36,307 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:13:36,308 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:13:36,499 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:13:36,528 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:13:36,529 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-11-30 05:13:36,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:13:36 BoogieIcfgContainer [2023-11-30 05:13:36,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:13:36,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:13:36,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:13:36,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:13:36,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:13:35" (1/3) ... [2023-11-30 05:13:36,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564ac4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:13:36, skipping insertion in model container [2023-11-30 05:13:36,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:13:36" (2/3) ... [2023-11-30 05:13:36,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564ac4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:13:36, skipping insertion in model container [2023-11-30 05:13:36,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:13:36" (3/3) ... [2023-11-30 05:13:36,537 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2023-11-30 05:13:36,551 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:13:36,551 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-30 05:13:36,551 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:13:36,610 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-30 05:13:36,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 142 transitions, 291 flow [2023-11-30 05:13:36,713 INFO L124 PetriNetUnfolderBase]: 19/194 cut-off events. [2023-11-30 05:13:36,714 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 05:13:36,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 194 events. 19/194 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 620 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 101. Up to 4 conditions per place. [2023-11-30 05:13:36,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 142 transitions, 291 flow [2023-11-30 05:13:36,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 142 transitions, 291 flow [2023-11-30 05:13:36,750 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:13:36,755 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;@3759492, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:13:36,755 INFO L363 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-11-30 05:13:36,772 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:13:36,772 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-11-30 05:13:36,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:13:36,772 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:36,773 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:36,773 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-11-30 05:13:36,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:36,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1834896267, now seen corresponding path program 1 times [2023-11-30 05:13:36,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:36,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235665838] [2023-11-30 05:13:36,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:36,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:37,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:37,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235665838] [2023-11-30 05:13:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235665838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:13:37,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:13:37,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:13:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642189191] [2023-11-30 05:13:37,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:13:37,077 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:13:37,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:37,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:13:37,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:13:37,111 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 142 [2023-11-30 05:13:37,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 142 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:37,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:37,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 142 [2023-11-30 05:13:37,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:37,363 INFO L124 PetriNetUnfolderBase]: 183/778 cut-off events. [2023-11-30 05:13:37,363 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 05:13:37,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 778 events. 183/778 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5093 event pairs, 140 based on Foata normal form. 132/792 useless extension candidates. Maximal degree in co-relation 1087. Up to 317 conditions per place. [2023-11-30 05:13:37,372 INFO L140 encePairwiseOnDemand]: 126/142 looper letters, 47 selfloop transitions, 2 changer transitions 3/139 dead transitions. [2023-11-30 05:13:37,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 139 transitions, 389 flow [2023-11-30 05:13:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:13:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:13:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-11-30 05:13:37,384 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.795774647887324 [2023-11-30 05:13:37,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-11-30 05:13:37,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-11-30 05:13:37,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:37,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-11-30 05:13:37,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:37,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:37,394 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:37,397 INFO L307 CegarLoopForPetriNet]: 132 programPoint places, -3 predicate places. [2023-11-30 05:13:37,397 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 139 transitions, 389 flow [2023-11-30 05:13:37,398 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:37,398 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:37,398 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:37,398 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:13:37,398 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-11-30 05:13:37,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:37,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1834896266, now seen corresponding path program 1 times [2023-11-30 05:13:37,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:37,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084095429] [2023-11-30 05:13:37,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:37,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:37,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084095429] [2023-11-30 05:13:37,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084095429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:13:37,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:13:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:13:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130028005] [2023-11-30 05:13:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:13:37,591 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:13:37,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:37,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:13:37,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:13:37,595 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-11-30 05:13:37,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 139 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:37,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:37,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-11-30 05:13:37,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:37,888 INFO L124 PetriNetUnfolderBase]: 314/1144 cut-off events. [2023-11-30 05:13:37,889 INFO L125 PetriNetUnfolderBase]: For 243/267 co-relation queries the response was YES. [2023-11-30 05:13:37,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1144 events. 314/1144 cut-off events. For 243/267 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7670 event pairs, 54 based on Foata normal form. 0/1034 useless extension candidates. Maximal degree in co-relation 2171. Up to 490 conditions per place. [2023-11-30 05:13:37,896 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 73 selfloop transitions, 4 changer transitions 6/169 dead transitions. [2023-11-30 05:13:37,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 169 transitions, 657 flow [2023-11-30 05:13:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:13:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:13:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2023-11-30 05:13:37,900 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7235915492957746 [2023-11-30 05:13:37,900 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 411 transitions. [2023-11-30 05:13:37,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 411 transitions. [2023-11-30 05:13:37,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:37,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 411 transitions. [2023-11-30 05:13:37,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:37,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:37,906 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:37,907 INFO L307 CegarLoopForPetriNet]: 132 programPoint places, 0 predicate places. [2023-11-30 05:13:37,907 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 169 transitions, 657 flow [2023-11-30 05:13:37,907 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:37,907 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:37,908 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:37,908 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:13:37,908 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-30 05:13:37,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash -612995807, now seen corresponding path program 1 times [2023-11-30 05:13:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:37,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350240657] [2023-11-30 05:13:37,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:37,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:38,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350240657] [2023-11-30 05:13:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350240657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:13:38,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:13:38,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:13:38,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228649186] [2023-11-30 05:13:38,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:13:38,291 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:13:38,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:38,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:13:38,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:13:38,294 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-11-30 05:13:38,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 169 transitions, 657 flow. Second operand has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:38,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:38,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-11-30 05:13:38,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:38,532 INFO L124 PetriNetUnfolderBase]: 230/885 cut-off events. [2023-11-30 05:13:38,533 INFO L125 PetriNetUnfolderBase]: For 672/805 co-relation queries the response was YES. [2023-11-30 05:13:38,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 885 events. 230/885 cut-off events. For 672/805 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5345 event pairs, 46 based on Foata normal form. 109/900 useless extension candidates. Maximal degree in co-relation 2106. Up to 369 conditions per place. [2023-11-30 05:13:38,538 INFO L140 encePairwiseOnDemand]: 131/142 looper letters, 79 selfloop transitions, 7 changer transitions 6/172 dead transitions. [2023-11-30 05:13:38,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 172 transitions, 875 flow [2023-11-30 05:13:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:13:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:13:38,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 646 transitions. [2023-11-30 05:13:38,544 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6498993963782697 [2023-11-30 05:13:38,544 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 646 transitions. [2023-11-30 05:13:38,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 646 transitions. [2023-11-30 05:13:38,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:38,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 646 transitions. [2023-11-30 05:13:38,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:38,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:38,549 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:38,550 INFO L307 CegarLoopForPetriNet]: 132 programPoint places, 0 predicate places. [2023-11-30 05:13:38,550 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 172 transitions, 875 flow [2023-11-30 05:13:38,551 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:38,551 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:38,551 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:38,551 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:13:38,551 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-30 05:13:38,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash -612995808, now seen corresponding path program 1 times [2023-11-30 05:13:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238948703] [2023-11-30 05:13:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:38,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238948703] [2023-11-30 05:13:38,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238948703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:13:38,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:13:38,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:13:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557832088] [2023-11-30 05:13:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:13:38,730 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:13:38,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:38,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:13:38,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:13:38,733 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-11-30 05:13:38,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 172 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:38,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:38,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-11-30 05:13:38,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:39,023 INFO L124 PetriNetUnfolderBase]: 203/874 cut-off events. [2023-11-30 05:13:39,023 INFO L125 PetriNetUnfolderBase]: For 1215/1226 co-relation queries the response was YES. [2023-11-30 05:13:39,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 874 events. 203/874 cut-off events. For 1215/1226 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5177 event pairs, 10 based on Foata normal form. 60/873 useless extension candidates. Maximal degree in co-relation 2401. Up to 316 conditions per place. [2023-11-30 05:13:39,028 INFO L140 encePairwiseOnDemand]: 129/142 looper letters, 70 selfloop transitions, 7 changer transitions 28/185 dead transitions. [2023-11-30 05:13:39,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 185 transitions, 1193 flow [2023-11-30 05:13:39,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 05:13:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 05:13:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 750 transitions. [2023-11-30 05:13:39,030 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6602112676056338 [2023-11-30 05:13:39,030 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 750 transitions. [2023-11-30 05:13:39,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 750 transitions. [2023-11-30 05:13:39,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:39,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 750 transitions. [2023-11-30 05:13:39,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.75) internal successors, (750), 8 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:39,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:39,036 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:39,037 INFO L307 CegarLoopForPetriNet]: 132 programPoint places, 7 predicate places. [2023-11-30 05:13:39,037 INFO L500 AbstractCegarLoop]: Abstraction has has 139 places, 185 transitions, 1193 flow [2023-11-30 05:13:39,038 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:39,038 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:39,038 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:39,039 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:13:39,039 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-11-30 05:13:39,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash -835773060, now seen corresponding path program 1 times [2023-11-30 05:13:39,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:39,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706544842] [2023-11-30 05:13:39,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:39,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706544842] [2023-11-30 05:13:39,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706544842] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:13:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106862405] [2023-11-30 05:13:39,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:39,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:13:39,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:13:39,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:13:39,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-30 05:13:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:39,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:13:39,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:13:39,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 05:13:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:39,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:13:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:39,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106862405] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:13:39,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:13:39,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-30 05:13:39,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371669012] [2023-11-30 05:13:39,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:13:39,587 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 05:13:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:39,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 05:13:39,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-30 05:13:39,589 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 142 [2023-11-30 05:13:39,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 185 transitions, 1193 flow. Second operand has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:39,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:39,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 142 [2023-11-30 05:13:39,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:39,723 INFO L124 PetriNetUnfolderBase]: 51/215 cut-off events. [2023-11-30 05:13:39,723 INFO L125 PetriNetUnfolderBase]: For 562/564 co-relation queries the response was YES. [2023-11-30 05:13:39,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 215 events. 51/215 cut-off events. For 562/564 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 702 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 605. Up to 75 conditions per place. [2023-11-30 05:13:39,725 INFO L140 encePairwiseOnDemand]: 135/142 looper letters, 53 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2023-11-30 05:13:39,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 108 transitions, 780 flow [2023-11-30 05:13:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:13:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:13:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 640 transitions. [2023-11-30 05:13:39,727 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6438631790744467 [2023-11-30 05:13:39,727 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 640 transitions. [2023-11-30 05:13:39,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 640 transitions. [2023-11-30 05:13:39,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:39,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 640 transitions. [2023-11-30 05:13:39,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:39,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:39,731 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:39,732 INFO L307 CegarLoopForPetriNet]: 132 programPoint places, -34 predicate places. [2023-11-30 05:13:39,732 INFO L500 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 780 flow [2023-11-30 05:13:39,732 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:39,732 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:39,733 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:39,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-30 05:13:39,937 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-11-30 05:13:39,938 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-11-30 05:13:39,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash -139160722, now seen corresponding path program 1 times [2023-11-30 05:13:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595888212] [2023-11-30 05:13:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:13:39,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:13:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:13:39,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:13:39,974 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:13:39,975 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2023-11-30 05:13:39,976 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2023-11-30 05:13:39,976 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2023-11-30 05:13:39,976 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2023-11-30 05:13:39,977 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2023-11-30 05:13:39,977 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2023-11-30 05:13:39,977 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2023-11-30 05:13:39,977 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2023-11-30 05:13:39,977 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2023-11-30 05:13:39,977 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2023-11-30 05:13:39,977 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2023-11-30 05:13:39,978 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2023-11-30 05:13:39,978 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2023-11-30 05:13:39,978 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2023-11-30 05:13:39,978 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2023-11-30 05:13:39,978 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2023-11-30 05:13:39,978 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2023-11-30 05:13:39,978 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2023-11-30 05:13:39,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2023-11-30 05:13:39,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2023-11-30 05:13:39,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2023-11-30 05:13:39,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2023-11-30 05:13:39,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2023-11-30 05:13:39,979 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:13:39,980 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-30 05:13:39,982 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:13:39,982 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 05:13:40,014 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 05:13:40,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 188 transitions, 392 flow [2023-11-30 05:13:40,043 INFO L124 PetriNetUnfolderBase]: 34/320 cut-off events. [2023-11-30 05:13:40,043 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 05:13:40,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 320 events. 34/320 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1221 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 196. Up to 8 conditions per place. [2023-11-30 05:13:40,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 188 transitions, 392 flow [2023-11-30 05:13:40,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 188 transitions, 392 flow [2023-11-30 05:13:40,048 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:13:40,049 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;@3759492, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:13:40,049 INFO L363 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-30 05:13:40,052 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:13:40,052 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-11-30 05:13:40,052 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:13:40,052 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:40,052 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:40,052 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-11-30 05:13:40,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash -172436747, now seen corresponding path program 1 times [2023-11-30 05:13:40,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:40,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901518284] [2023-11-30 05:13:40,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:40,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:40,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:40,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901518284] [2023-11-30 05:13:40,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901518284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:13:40,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:13:40,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:13:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898806369] [2023-11-30 05:13:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:13:40,083 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:13:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:40,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:13:40,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:13:40,084 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 188 [2023-11-30 05:13:40,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 188 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:40,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:40,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 188 [2023-11-30 05:13:40,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:41,938 INFO L124 PetriNetUnfolderBase]: 5995/14699 cut-off events. [2023-11-30 05:13:41,938 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-11-30 05:13:41,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24263 conditions, 14699 events. 5995/14699 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 149946 event pairs, 4606 based on Foata normal form. 2946/14914 useless extension candidates. Maximal degree in co-relation 1950. Up to 7347 conditions per place. [2023-11-30 05:13:42,041 INFO L140 encePairwiseOnDemand]: 166/188 looper letters, 80 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2023-11-30 05:13:42,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 193 transitions, 566 flow [2023-11-30 05:13:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:13:42,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:13:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-11-30 05:13:42,043 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8031914893617021 [2023-11-30 05:13:42,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-11-30 05:13:42,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-11-30 05:13:42,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:42,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-11-30 05:13:42,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:42,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:42,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:42,047 INFO L307 CegarLoopForPetriNet]: 173 programPoint places, -3 predicate places. [2023-11-30 05:13:42,047 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 193 transitions, 566 flow [2023-11-30 05:13:42,047 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:42,047 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:42,047 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:42,048 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 05:13:42,048 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-11-30 05:13:42,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash -172436746, now seen corresponding path program 1 times [2023-11-30 05:13:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:42,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650176558] [2023-11-30 05:13:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:42,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:42,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:42,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650176558] [2023-11-30 05:13:42,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650176558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:13:42,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:13:42,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:13:42,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418336793] [2023-11-30 05:13:42,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:13:42,129 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:13:42,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:42,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:13:42,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:13:42,130 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 188 [2023-11-30 05:13:42,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 193 transitions, 566 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:42,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:42,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 188 [2023-11-30 05:13:42,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:45,037 INFO L124 PetriNetUnfolderBase]: 12977/29087 cut-off events. [2023-11-30 05:13:45,037 INFO L125 PetriNetUnfolderBase]: For 7431/7985 co-relation queries the response was YES. [2023-11-30 05:13:45,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63090 conditions, 29087 events. 12977/29087 cut-off events. For 7431/7985 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 305927 event pairs, 6239 based on Foata normal form. 0/25998 useless extension candidates. Maximal degree in co-relation 6848. Up to 15804 conditions per place. [2023-11-30 05:13:45,251 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 121 selfloop transitions, 4 changer transitions 0/239 dead transitions. [2023-11-30 05:13:45,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 239 transitions, 970 flow [2023-11-30 05:13:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:13:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:13:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-11-30 05:13:45,253 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7167553191489362 [2023-11-30 05:13:45,254 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-11-30 05:13:45,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-11-30 05:13:45,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:45,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-11-30 05:13:45,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:45,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:45,257 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:45,258 INFO L307 CegarLoopForPetriNet]: 173 programPoint places, 0 predicate places. [2023-11-30 05:13:45,259 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 239 transitions, 970 flow [2023-11-30 05:13:45,259 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:45,259 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:45,259 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:45,259 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 05:13:45,259 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-11-30 05:13:45,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1909500536, now seen corresponding path program 1 times [2023-11-30 05:13:45,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:45,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315906408] [2023-11-30 05:13:45,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:45,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:45,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:45,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315906408] [2023-11-30 05:13:45,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315906408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:13:45,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:13:45,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:13:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693184957] [2023-11-30 05:13:45,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:13:45,465 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:13:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:13:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:13:45,467 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 188 [2023-11-30 05:13:45,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 239 transitions, 970 flow. Second operand has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:45,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:45,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 188 [2023-11-30 05:13:45,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:48,138 INFO L124 PetriNetUnfolderBase]: 12622/27641 cut-off events. [2023-11-30 05:13:48,138 INFO L125 PetriNetUnfolderBase]: For 20184/20769 co-relation queries the response was YES. [2023-11-30 05:13:48,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77555 conditions, 27641 events. 12622/27641 cut-off events. For 20184/20769 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 281539 event pairs, 4399 based on Foata normal form. 1514/27837 useless extension candidates. Maximal degree in co-relation 8619. Up to 14559 conditions per place. [2023-11-30 05:13:48,527 INFO L140 encePairwiseOnDemand]: 174/188 looper letters, 206 selfloop transitions, 15 changer transitions 0/330 dead transitions. [2023-11-30 05:13:48,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 330 transitions, 1886 flow [2023-11-30 05:13:48,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 05:13:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 05:13:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1050 transitions. [2023-11-30 05:13:48,531 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6981382978723404 [2023-11-30 05:13:48,531 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1050 transitions. [2023-11-30 05:13:48,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1050 transitions. [2023-11-30 05:13:48,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:48,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1050 transitions. [2023-11-30 05:13:48,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.25) internal successors, (1050), 8 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:48,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:48,537 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:48,539 INFO L307 CegarLoopForPetriNet]: 173 programPoint places, 6 predicate places. [2023-11-30 05:13:48,539 INFO L500 AbstractCegarLoop]: Abstraction has has 179 places, 330 transitions, 1886 flow [2023-11-30 05:13:48,540 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:48,540 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:48,540 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:48,540 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:13:48,540 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-11-30 05:13:48,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1909500535, now seen corresponding path program 1 times [2023-11-30 05:13:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:48,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82993028] [2023-11-30 05:13:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:48,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:48,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82993028] [2023-11-30 05:13:48,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82993028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:13:48,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:13:48,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:13:48,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289701839] [2023-11-30 05:13:48,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:13:48,702 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:13:48,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:48,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:13:48,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:13:48,705 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 188 [2023-11-30 05:13:48,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 330 transitions, 1886 flow. Second operand has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:48,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:48,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 188 [2023-11-30 05:13:48,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:50,615 INFO L124 PetriNetUnfolderBase]: 9016/20079 cut-off events. [2023-11-30 05:13:50,615 INFO L125 PetriNetUnfolderBase]: For 27832/29049 co-relation queries the response was YES. [2023-11-30 05:13:50,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70522 conditions, 20079 events. 9016/20079 cut-off events. For 27832/29049 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 195792 event pairs, 2962 based on Foata normal form. 2032/21115 useless extension candidates. Maximal degree in co-relation 8275. Up to 10151 conditions per place. [2023-11-30 05:13:50,745 INFO L140 encePairwiseOnDemand]: 178/188 looper letters, 230 selfloop transitions, 9 changer transitions 6/346 dead transitions. [2023-11-30 05:13:50,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 346 transitions, 2496 flow [2023-11-30 05:13:50,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:13:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:13:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-11-30 05:13:50,747 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6512158054711246 [2023-11-30 05:13:50,748 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-11-30 05:13:50,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-11-30 05:13:50,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:50,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-11-30 05:13:50,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:50,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:50,752 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:50,753 INFO L307 CegarLoopForPetriNet]: 173 programPoint places, 7 predicate places. [2023-11-30 05:13:50,753 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 346 transitions, 2496 flow [2023-11-30 05:13:50,753 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:50,753 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:50,753 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:50,754 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 05:13:50,754 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-11-30 05:13:50,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1922253520, now seen corresponding path program 1 times [2023-11-30 05:13:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:50,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394673832] [2023-11-30 05:13:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:50,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394673832] [2023-11-30 05:13:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394673832] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:13:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992526110] [2023-11-30 05:13:50,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:50,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:13:50,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:13:50,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:13:50,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-30 05:13:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:50,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:13:50,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:13:50,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 05:13:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:51,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:13:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992526110] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:13:51,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:13:51,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-30 05:13:51,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64157623] [2023-11-30 05:13:51,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:13:51,143 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 05:13:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:51,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 05:13:51,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-30 05:13:51,145 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 188 [2023-11-30 05:13:51,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 346 transitions, 2496 flow. Second operand has 14 states, 14 states have (on average 109.64285714285714) internal successors, (1535), 14 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:51,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:51,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 188 [2023-11-30 05:13:51,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:52,054 INFO L124 PetriNetUnfolderBase]: 2412/4979 cut-off events. [2023-11-30 05:13:52,054 INFO L125 PetriNetUnfolderBase]: For 17822/20190 co-relation queries the response was YES. [2023-11-30 05:13:52,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20529 conditions, 4979 events. 2412/4979 cut-off events. For 17822/20190 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 38523 event pairs, 60 based on Foata normal form. 0/4714 useless extension candidates. Maximal degree in co-relation 1794. Up to 3445 conditions per place. [2023-11-30 05:13:52,087 INFO L140 encePairwiseOnDemand]: 181/188 looper letters, 200 selfloop transitions, 8 changer transitions 0/287 dead transitions. [2023-11-30 05:13:52,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 287 transitions, 2551 flow [2023-11-30 05:13:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 05:13:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 05:13:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1223 transitions. [2023-11-30 05:13:52,091 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6505319148936171 [2023-11-30 05:13:52,091 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1223 transitions. [2023-11-30 05:13:52,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1223 transitions. [2023-11-30 05:13:52,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:52,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1223 transitions. [2023-11-30 05:13:52,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.3) internal successors, (1223), 10 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:52,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 188.0) internal successors, (2068), 11 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:52,098 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 188.0) internal successors, (2068), 11 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:52,098 INFO L307 CegarLoopForPetriNet]: 173 programPoint places, -31 predicate places. [2023-11-30 05:13:52,098 INFO L500 AbstractCegarLoop]: Abstraction has has 142 places, 287 transitions, 2551 flow [2023-11-30 05:13:52,099 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 109.64285714285714) internal successors, (1535), 14 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:52,099 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:52,099 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:52,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-30 05:13:52,303 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-11-30 05:13:52,304 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-30 05:13:52,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1723047952, now seen corresponding path program 1 times [2023-11-30 05:13:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:52,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439434523] [2023-11-30 05:13:52,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-30 05:13:52,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:52,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439434523] [2023-11-30 05:13:52,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439434523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:13:52,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264337864] [2023-11-30 05:13:52,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:52,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:13:52,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:13:52,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:13:52,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-30 05:13:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:52,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-30 05:13:52,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:13:52,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 05:13:52,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:13:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 05:13:52,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 05:13:52,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264337864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:13:52,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 05:13:52,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2023-11-30 05:13:52,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430960] [2023-11-30 05:13:52,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:13:52,874 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:13:52,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:52,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:13:52,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-30 05:13:52,875 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 188 [2023-11-30 05:13:52,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 287 transitions, 2551 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:52,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:52,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 188 [2023-11-30 05:13:52,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:13:53,333 INFO L124 PetriNetUnfolderBase]: 1484/3202 cut-off events. [2023-11-30 05:13:53,333 INFO L125 PetriNetUnfolderBase]: For 18459/19009 co-relation queries the response was YES. [2023-11-30 05:13:53,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15043 conditions, 3202 events. 1484/3202 cut-off events. For 18459/19009 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 22733 event pairs, 0 based on Foata normal form. 436/3637 useless extension candidates. Maximal degree in co-relation 2022. Up to 2170 conditions per place. [2023-11-30 05:13:53,349 INFO L140 encePairwiseOnDemand]: 177/188 looper letters, 210 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2023-11-30 05:13:53,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 290 transitions, 3169 flow [2023-11-30 05:13:53,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 05:13:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 05:13:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2023-11-30 05:13:53,351 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043 [2023-11-30 05:13:53,351 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 570 transitions. [2023-11-30 05:13:53,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 570 transitions. [2023-11-30 05:13:53,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:13:53,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 570 transitions. [2023-11-30 05:13:53,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:53,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:53,355 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:53,355 INFO L307 CegarLoopForPetriNet]: 173 programPoint places, -35 predicate places. [2023-11-30 05:13:53,355 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 290 transitions, 3169 flow [2023-11-30 05:13:53,356 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:53,356 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:53,356 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:53,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-30 05:13:53,561 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:13:53,561 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-30 05:13:53,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:53,562 INFO L85 PathProgramCache]: Analyzing trace with hash -543502295, now seen corresponding path program 1 times [2023-11-30 05:13:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:53,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003239188] [2023-11-30 05:13:53,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:53,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:13:53,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:13:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:13:53,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:13:53,595 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:13:53,595 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2023-11-30 05:13:53,595 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-11-30 05:13:53,595 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-11-30 05:13:53,595 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-11-30 05:13:53,596 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-11-30 05:13:53,596 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-11-30 05:13:53,596 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-11-30 05:13:53,596 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-11-30 05:13:53,596 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-11-30 05:13:53,596 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-11-30 05:13:53,596 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-11-30 05:13:53,596 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-11-30 05:13:53,597 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-11-30 05:13:53,598 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-11-30 05:13:53,598 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2023-11-30 05:13:53,598 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-11-30 05:13:53,598 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-11-30 05:13:53,598 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2023-11-30 05:13:53,598 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-11-30 05:13:53,598 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2023-11-30 05:13:53,599 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 05:13:53,599 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:53,599 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:13:53,599 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 05:13:53,630 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 05:13:53,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 234 transitions, 495 flow [2023-11-30 05:13:53,675 INFO L124 PetriNetUnfolderBase]: 54/485 cut-off events. [2023-11-30 05:13:53,676 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-30 05:13:53,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 485 events. 54/485 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2021 event pairs, 1 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 328. Up to 16 conditions per place. [2023-11-30 05:13:53,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 234 transitions, 495 flow [2023-11-30 05:13:53,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 234 transitions, 495 flow [2023-11-30 05:13:53,687 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:13:53,688 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;@3759492, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:13:53,688 INFO L363 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-11-30 05:13:53,690 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:13:53,690 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2023-11-30 05:13:53,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:13:53,690 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:13:53,691 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:13:53,691 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-11-30 05:13:53,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:13:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2079559349, now seen corresponding path program 1 times [2023-11-30 05:13:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:13:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708553455] [2023-11-30 05:13:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:13:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:13:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:13:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:13:53,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:13:53,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708553455] [2023-11-30 05:13:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708553455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:13:53,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:13:53,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:13:53,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602800938] [2023-11-30 05:13:53,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:13:53,717 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:13:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:13:53,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:13:53,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:13:53,718 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 234 [2023-11-30 05:13:53,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 234 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:13:53,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:13:53,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 234 [2023-11-30 05:13:53,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:14:21,308 INFO L124 PetriNetUnfolderBase]: 141380/275559 cut-off events. [2023-11-30 05:14:21,309 INFO L125 PetriNetUnfolderBase]: For 4141/4141 co-relation queries the response was YES. [2023-11-30 05:14:22,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472395 conditions, 275559 events. 141380/275559 cut-off events. For 4141/4141 co-relation queries the response was YES. Maximal size of possible extension queue 7026. Compared 3416910 event pairs, 108403 based on Foata normal form. 59160/278774 useless extension candidates. Maximal degree in co-relation 24244. Up to 150340 conditions per place. [2023-11-30 05:14:23,696 INFO L140 encePairwiseOnDemand]: 206/234 looper letters, 110 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2023-11-30 05:14:23,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 247 transitions, 745 flow [2023-11-30 05:14:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:14:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:14:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-11-30 05:14:23,697 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2023-11-30 05:14:23,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-11-30 05:14:23,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-11-30 05:14:23,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:14:23,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-11-30 05:14:23,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:14:23,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:14:23,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:14:23,701 INFO L307 CegarLoopForPetriNet]: 214 programPoint places, -3 predicate places. [2023-11-30 05:14:23,701 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 247 transitions, 745 flow [2023-11-30 05:14:23,701 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:14:23,701 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:14:23,702 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:14:23,702 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 05:14:23,702 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-11-30 05:14:23,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:14:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2079559350, now seen corresponding path program 1 times [2023-11-30 05:14:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:14:23,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627011873] [2023-11-30 05:14:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:14:23,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:14:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:14:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:14:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:14:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627011873] [2023-11-30 05:14:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627011873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:14:23,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:14:23,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:14:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616003235] [2023-11-30 05:14:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:14:23,766 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:14:23,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:14:23,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:14:23,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:14:23,767 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 234 [2023-11-30 05:14:23,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 247 transitions, 745 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:14:23,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:14:23,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 234 [2023-11-30 05:14:23,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:15:50,189 INFO L124 PetriNetUnfolderBase]: 369421/657381 cut-off events. [2023-11-30 05:15:50,189 INFO L125 PetriNetUnfolderBase]: For 176886/185188 co-relation queries the response was YES. [2023-11-30 05:15:52,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506002 conditions, 657381 events. 369421/657381 cut-off events. For 176886/185188 co-relation queries the response was YES. Maximal size of possible extension queue 15041. Compared 8146275 event pairs, 221312 based on Foata normal form. 0/623301 useless extension candidates. Maximal degree in co-relation 62819. Up to 382460 conditions per place. [2023-11-30 05:15:58,688 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 161 selfloop transitions, 4 changer transitions 0/307 dead transitions. [2023-11-30 05:15:58,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 307 transitions, 1277 flow [2023-11-30 05:15:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:15:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:15:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2023-11-30 05:15:58,694 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7104700854700855 [2023-11-30 05:15:58,694 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 665 transitions. [2023-11-30 05:15:58,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 665 transitions. [2023-11-30 05:15:58,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:15:58,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 665 transitions. [2023-11-30 05:15:58,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:15:58,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:15:58,699 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:15:58,699 INFO L307 CegarLoopForPetriNet]: 214 programPoint places, 0 predicate places. [2023-11-30 05:15:58,700 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 307 transitions, 1277 flow [2023-11-30 05:15:58,700 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:15:58,700 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:15:58,700 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:15:58,700 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 05:15:58,700 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-30 05:15:58,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:15:58,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1294557729, now seen corresponding path program 1 times [2023-11-30 05:15:58,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:15:58,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715332869] [2023-11-30 05:15:58,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:15:58,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:15:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:15:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:15:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:15:58,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715332869] [2023-11-30 05:15:58,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715332869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:15:58,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:15:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:15:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701268402] [2023-11-30 05:15:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:15:58,929 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:15:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:15:58,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:15:58,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:15:58,931 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 234 [2023-11-30 05:15:58,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 307 transitions, 1277 flow. Second operand has 7 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:15:58,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:15:58,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 234 [2023-11-30 05:15:58,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand