/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_21-deref_read_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:15:56,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:15:56,510 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:15:56,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:15:56,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:15:56,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:15:56,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:15:56,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:15:56,541 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:15:56,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:15:56,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:15:56,544 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:15:56,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:15:56,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:15:56,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:15:56,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:15:56,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:15:56,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:15:56,546 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:15:56,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:15:56,546 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:15:56,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:15:56,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:15:56,547 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:15:56,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:15:56,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:15:56,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:15:56,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:15:56,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:15:56,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:15:56,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:15:56,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:15:56,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:15:56,550 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:15:56,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:15:56,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:15:56,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:15:56,787 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:15:56,787 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:15:56,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_21-deref_read_racing.i [2023-11-30 05:15:57,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:15:57,965 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:15:57,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_21-deref_read_racing.i [2023-11-30 05:15:57,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baeeec13a/0be10f994b704cc89b4076c3fdd6b74d/FLAG63de9412d [2023-11-30 05:15:57,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baeeec13a/0be10f994b704cc89b4076c3fdd6b74d [2023-11-30 05:15:57,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:15:57,994 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:15:57,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:15:57,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:15:58,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:15:58,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:15:57" (1/1) ... [2023-11-30 05:15:58,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16638e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58, skipping insertion in model container [2023-11-30 05:15:58,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:15:57" (1/1) ... [2023-11-30 05:15:58,041 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:15:58,248 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:15:58,259 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:15:58,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:15:58,332 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:15:58,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58 WrapperNode [2023-11-30 05:15:58,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:15:58,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:15:58,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:15:58,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:15:58,338 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:15:58" (1/1) ... [2023-11-30 05:15:58,359 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:15:58" (1/1) ... [2023-11-30 05:15:58,373 INFO L138 Inliner]: procedures = 171, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2023-11-30 05:15:58,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:15:58,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:15:58,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:15:58,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:15:58,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58" (1/1) ... [2023-11-30 05:15:58,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58" (1/1) ... [2023-11-30 05:15:58,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58" (1/1) ... [2023-11-30 05:15:58,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58" (1/1) ... [2023-11-30 05:15:58,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58" (1/1) ... [2023-11-30 05:15:58,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58" (1/1) ... [2023-11-30 05:15:58,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58" (1/1) ... [2023-11-30 05:15:58,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58" (1/1) ... [2023-11-30 05:15:58,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:15:58,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:15:58,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:15:58,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:15:58,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58" (1/1) ... [2023-11-30 05:15:58,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:15:58,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:15:58,439 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:15:58,445 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:15:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:15:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:15:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 05:15:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:15:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:15:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-30 05:15:58,460 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-30 05:15:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:15:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:15:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 05:15:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:15:58,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:15:58,461 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:15:58,556 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:15:58,557 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:15:58,751 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:15:58,784 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:15:58,785 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-30 05:15:58,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:15:58 BoogieIcfgContainer [2023-11-30 05:15:58,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:15:58,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:15:58,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:15:58,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:15:58,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:15:57" (1/3) ... [2023-11-30 05:15:58,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d6e1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:15:58, skipping insertion in model container [2023-11-30 05:15:58,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:15:58" (2/3) ... [2023-11-30 05:15:58,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d6e1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:15:58, skipping insertion in model container [2023-11-30 05:15:58,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:15:58" (3/3) ... [2023-11-30 05:15:58,792 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_21-deref_read_racing.i [2023-11-30 05:15:58,805 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:15:58,805 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-30 05:15:58,805 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:15:58,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 05:15:58,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 120 transitions, 244 flow [2023-11-30 05:15:58,944 INFO L124 PetriNetUnfolderBase]: 16/161 cut-off events. [2023-11-30 05:15:58,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:15:58,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 161 events. 16/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 474 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 89. Up to 4 conditions per place. [2023-11-30 05:15:58,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 120 transitions, 244 flow [2023-11-30 05:15:58,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 120 transitions, 244 flow [2023-11-30 05:15:58,962 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:15:58,967 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;@47dd8da9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:15:58,967 INFO L363 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-11-30 05:15:58,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:15:58,974 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-11-30 05:15:58,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:15:58,975 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:15:58,975 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] [2023-11-30 05:15:58,976 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-30 05:15:58,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:15:58,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1753378095, now seen corresponding path program 1 times [2023-11-30 05:15:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:15:58,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195515966] [2023-11-30 05:15:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:15:58,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:15:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:15:59,341 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:59,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:15:59,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195515966] [2023-11-30 05:15:59,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195515966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:15:59,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:15:59,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:15:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974638563] [2023-11-30 05:15:59,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:15:59,351 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:15:59,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:15:59,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:15:59,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:15:59,391 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 120 [2023-11-30 05:15:59,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 120 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 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:59,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:15:59,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 120 [2023-11-30 05:15:59,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:15:59,622 INFO L124 PetriNetUnfolderBase]: 126/549 cut-off events. [2023-11-30 05:15:59,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:15:59,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 549 events. 126/549 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3308 event pairs, 84 based on Foata normal form. 98/558 useless extension candidates. Maximal degree in co-relation 761. Up to 196 conditions per place. [2023-11-30 05:15:59,628 INFO L140 encePairwiseOnDemand]: 106/120 looper letters, 41 selfloop transitions, 2 changer transitions 3/119 dead transitions. [2023-11-30 05:15:59,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 119 transitions, 334 flow [2023-11-30 05:15:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:15:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:15:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-11-30 05:15:59,647 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8027777777777778 [2023-11-30 05:15:59,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-11-30 05:15:59,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-11-30 05:15:59,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:15:59,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-11-30 05:15:59,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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:59,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:15:59,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:15:59,669 INFO L307 CegarLoopForPetriNet]: 112 programPoint places, -2 predicate places. [2023-11-30 05:15:59,669 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 119 transitions, 334 flow [2023-11-30 05:15:59,670 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 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:59,670 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:15:59,670 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] [2023-11-30 05:15:59,670 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:15:59,670 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-30 05:15:59,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:15:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1753378094, now seen corresponding path program 1 times [2023-11-30 05:15:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:15:59,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570876010] [2023-11-30 05:15:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:15:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:15:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:15:59,849 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:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:15:59,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570876010] [2023-11-30 05:15:59,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570876010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:15:59,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:15:59,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:15:59,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375616962] [2023-11-30 05:15:59,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:15:59,852 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:15:59,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:15:59,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:15:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:15:59,855 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 120 [2023-11-30 05:15:59,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 119 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:59,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:15:59,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 120 [2023-11-30 05:15:59,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:16:00,049 INFO L124 PetriNetUnfolderBase]: 242/921 cut-off events. [2023-11-30 05:16:00,049 INFO L125 PetriNetUnfolderBase]: For 200/216 co-relation queries the response was YES. [2023-11-30 05:16:00,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 921 events. 242/921 cut-off events. For 200/216 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6148 event pairs, 38 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1709. Up to 354 conditions per place. [2023-11-30 05:16:00,058 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 67 selfloop transitions, 4 changer transitions 6/149 dead transitions. [2023-11-30 05:16:00,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 149 transitions, 590 flow [2023-11-30 05:16:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:16:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:16:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions. [2023-11-30 05:16:00,061 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7270833333333333 [2023-11-30 05:16:00,061 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 349 transitions. [2023-11-30 05:16:00,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 349 transitions. [2023-11-30 05:16:00,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:16:00,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 349 transitions. [2023-11-30 05:16:00,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.25) internal successors, (349), 4 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:16:00,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 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:16:00,064 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 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:16:00,065 INFO L307 CegarLoopForPetriNet]: 112 programPoint places, 1 predicate places. [2023-11-30 05:16:00,065 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 149 transitions, 590 flow [2023-11-30 05:16:00,065 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:16:00,065 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:00,066 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] [2023-11-30 05:16:00,066 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:16:00,066 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-30 05:16:00,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1259979410, now seen corresponding path program 1 times [2023-11-30 05:16:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:00,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891372283] [2023-11-30 05:16:00,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:00,243 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:16:00,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:16:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891372283] [2023-11-30 05:16:00,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891372283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:16:00,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:16:00,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:16:00,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158110810] [2023-11-30 05:16:00,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:16:00,248 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:16:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:16:00,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:16:00,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:16:00,251 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 120 [2023-11-30 05:16:00,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 149 transitions, 590 flow. Second operand has 7 states, 7 states have (on average 69.28571428571429) internal successors, (485), 7 states have internal predecessors, (485), 0 states have call successors, (0), 0 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:16:00,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:16:00,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 120 [2023-11-30 05:16:00,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:16:00,526 INFO L124 PetriNetUnfolderBase]: 251/976 cut-off events. [2023-11-30 05:16:00,527 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2023-11-30 05:16:00,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 976 events. 251/976 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6469 event pairs, 14 based on Foata normal form. 45/973 useless extension candidates. Maximal degree in co-relation 2263. Up to 358 conditions per place. [2023-11-30 05:16:00,532 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 85 selfloop transitions, 12 changer transitions 12/175 dead transitions. [2023-11-30 05:16:00,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 175 transitions, 944 flow [2023-11-30 05:16:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 05:16:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 05:16:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 640 transitions. [2023-11-30 05:16:00,538 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-30 05:16:00,539 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 640 transitions. [2023-11-30 05:16:00,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 640 transitions. [2023-11-30 05:16:00,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:16:00,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 640 transitions. [2023-11-30 05:16:00,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 80.0) internal successors, (640), 8 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:16:00,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:16:00,543 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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:16:00,544 INFO L307 CegarLoopForPetriNet]: 112 programPoint places, 8 predicate places. [2023-11-30 05:16:00,545 INFO L500 AbstractCegarLoop]: Abstraction has has 120 places, 175 transitions, 944 flow [2023-11-30 05:16:00,545 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.28571428571429) internal successors, (485), 7 states have internal predecessors, (485), 0 states have call successors, (0), 0 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:16:00,545 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:00,545 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] [2023-11-30 05:16:00,546 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:16:00,546 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-30 05:16:00,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1259979409, now seen corresponding path program 1 times [2023-11-30 05:16:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:00,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388473775] [2023-11-30 05:16:00,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:00,755 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:16:00,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:16:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388473775] [2023-11-30 05:16:00,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388473775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:16:00,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:16:00,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:16:00,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595967639] [2023-11-30 05:16:00,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:16:00,756 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:16:00,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:16:00,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:16:00,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:16:00,758 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 120 [2023-11-30 05:16:00,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 175 transitions, 944 flow. Second operand has 7 states, 7 states have (on average 68.28571428571429) internal successors, (478), 7 states have internal predecessors, (478), 0 states have call successors, (0), 0 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:16:00,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:16:00,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 120 [2023-11-30 05:16:00,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:16:01,014 INFO L124 PetriNetUnfolderBase]: 173/721 cut-off events. [2023-11-30 05:16:01,014 INFO L125 PetriNetUnfolderBase]: For 1097/1097 co-relation queries the response was YES. [2023-11-30 05:16:01,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 721 events. 173/721 cut-off events. For 1097/1097 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4231 event pairs, 10 based on Foata normal form. 89/774 useless extension candidates. Maximal degree in co-relation 1988. Up to 259 conditions per place. [2023-11-30 05:16:01,017 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 35 selfloop transitions, 4 changer transitions 56/145 dead transitions. [2023-11-30 05:16:01,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 145 transitions, 924 flow [2023-11-30 05:16:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:16:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:16:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 455 transitions. [2023-11-30 05:16:01,020 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2023-11-30 05:16:01,020 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 455 transitions. [2023-11-30 05:16:01,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 455 transitions. [2023-11-30 05:16:01,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:16:01,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 455 transitions. [2023-11-30 05:16:01,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.83333333333333) internal successors, (455), 6 states have internal predecessors, (455), 0 states have call successors, (0), 0 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:16:01,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:16:01,023 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:16:01,026 INFO L307 CegarLoopForPetriNet]: 112 programPoint places, 5 predicate places. [2023-11-30 05:16:01,026 INFO L500 AbstractCegarLoop]: Abstraction has has 117 places, 145 transitions, 924 flow [2023-11-30 05:16:01,027 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.28571428571429) internal successors, (478), 7 states have internal predecessors, (478), 0 states have call successors, (0), 0 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:16:01,027 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:01,027 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] [2023-11-30 05:16:01,028 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:16:01,029 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-30 05:16:01,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1691743735, now seen corresponding path program 1 times [2023-11-30 05:16:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:01,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268502142] [2023-11-30 05:16:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:01,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:01,176 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:16:01,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:16:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268502142] [2023-11-30 05:16:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268502142] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:16:01,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544577700] [2023-11-30 05:16:01,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:01,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:16:01,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:16:01,182 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:16:01,191 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:16:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:01,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:16:01,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:16:01,360 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:16:01,468 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:16:01,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:16:01,592 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:16:01,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544577700] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:16:01,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:16:01,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-30 05:16:01,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509785824] [2023-11-30 05:16:01,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:16:01,594 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 05:16:01,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:16:01,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 05:16:01,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-30 05:16:01,596 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 120 [2023-11-30 05:16:01,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 145 transitions, 924 flow. Second operand has 14 states, 14 states have (on average 71.57142857142857) internal successors, (1002), 14 states have internal predecessors, (1002), 0 states have call successors, (0), 0 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:16:01,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:16:01,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 120 [2023-11-30 05:16:01,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:16:01,716 INFO L124 PetriNetUnfolderBase]: 50/206 cut-off events. [2023-11-30 05:16:01,716 INFO L125 PetriNetUnfolderBase]: For 556/560 co-relation queries the response was YES. [2023-11-30 05:16:01,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 206 events. 50/206 cut-off events. For 556/560 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 688 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 593. Up to 77 conditions per place. [2023-11-30 05:16:01,718 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 51 selfloop transitions, 5 changer transitions 0/101 dead transitions. [2023-11-30 05:16:01,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 101 transitions, 746 flow [2023-11-30 05:16:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:16:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:16:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 541 transitions. [2023-11-30 05:16:01,720 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6440476190476191 [2023-11-30 05:16:01,720 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 541 transitions. [2023-11-30 05:16:01,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 541 transitions. [2023-11-30 05:16:01,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:16:01,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 541 transitions. [2023-11-30 05:16:01,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.28571428571429) internal successors, (541), 7 states have internal predecessors, (541), 0 states have call successors, (0), 0 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:16:01,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 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:16:01,722 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 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:16:01,723 INFO L307 CegarLoopForPetriNet]: 112 programPoint places, -20 predicate places. [2023-11-30 05:16:01,723 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 101 transitions, 746 flow [2023-11-30 05:16:01,723 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 71.57142857142857) internal successors, (1002), 14 states have internal predecessors, (1002), 0 states have call successors, (0), 0 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:16:01,723 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:01,723 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] [2023-11-30 05:16:01,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-30 05:16:01,928 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:16:01,929 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-30 05:16:01,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash 904448533, now seen corresponding path program 1 times [2023-11-30 05:16:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:01,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006360712] [2023-11-30 05:16:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:01,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:16:01,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:16:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:16:01,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:16:01,977 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:16:01,978 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2023-11-30 05:16:01,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2023-11-30 05:16:01,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2023-11-30 05:16:01,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2023-11-30 05:16:01,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2023-11-30 05:16:01,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2023-11-30 05:16:01,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2023-11-30 05:16:01,982 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2023-11-30 05:16:01,982 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2023-11-30 05:16:01,982 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2023-11-30 05:16:01,982 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2023-11-30 05:16:01,982 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2023-11-30 05:16:01,982 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2023-11-30 05:16:01,982 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2023-11-30 05:16:01,982 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2023-11-30 05:16:01,982 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2023-11-30 05:16:01,983 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2023-11-30 05:16:01,983 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2023-11-30 05:16:01,983 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2023-11-30 05:16:01,983 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2023-11-30 05:16:01,983 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2023-11-30 05:16:01,983 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:16:01,983 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-30 05:16:01,985 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:16:01,985 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 05:16:02,013 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 05:16:02,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 164 transitions, 338 flow [2023-11-30 05:16:02,031 INFO L124 PetriNetUnfolderBase]: 27/251 cut-off events. [2023-11-30 05:16:02,031 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 05:16:02,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 251 events. 27/251 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 876 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 162. Up to 6 conditions per place. [2023-11-30 05:16:02,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 164 transitions, 338 flow [2023-11-30 05:16:02,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 164 transitions, 338 flow [2023-11-30 05:16:02,036 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:16:02,037 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;@47dd8da9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:16:02,037 INFO L363 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-11-30 05:16:02,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:16:02,039 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-11-30 05:16:02,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:16:02,039 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:02,039 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] [2023-11-30 05:16:02,039 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-30 05:16:02,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2134657909, now seen corresponding path program 1 times [2023-11-30 05:16:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:02,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725452621] [2023-11-30 05:16:02,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:02,069 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:16:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:16:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725452621] [2023-11-30 05:16:02,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725452621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:16:02,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:16:02,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:16:02,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135712770] [2023-11-30 05:16:02,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:16:02,071 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:16:02,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:16:02,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:16:02,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:16:02,073 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 164 [2023-11-30 05:16:02,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 164 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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:16:02,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:16:02,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 164 [2023-11-30 05:16:02,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:16:02,925 INFO L124 PetriNetUnfolderBase]: 4116/9968 cut-off events. [2023-11-30 05:16:02,925 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-30 05:16:02,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16552 conditions, 9968 events. 4116/9968 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 98583 event pairs, 2814 based on Foata normal form. 2135/10161 useless extension candidates. Maximal degree in co-relation 1363. Up to 4501 conditions per place. [2023-11-30 05:16:03,032 INFO L140 encePairwiseOnDemand]: 144/164 looper letters, 73 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2023-11-30 05:16:03,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 171 transitions, 502 flow [2023-11-30 05:16:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:16:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:16:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-11-30 05:16:03,034 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8109756097560976 [2023-11-30 05:16:03,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-11-30 05:16:03,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-11-30 05:16:03,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:16:03,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-11-30 05:16:03,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 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:16:03,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 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:16:03,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 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:16:03,039 INFO L307 CegarLoopForPetriNet]: 152 programPoint places, -2 predicate places. [2023-11-30 05:16:03,039 INFO L500 AbstractCegarLoop]: Abstraction has has 150 places, 171 transitions, 502 flow [2023-11-30 05:16:03,040 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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:16:03,040 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:03,040 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] [2023-11-30 05:16:03,040 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 05:16:03,040 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-30 05:16:03,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:03,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2134657910, now seen corresponding path program 1 times [2023-11-30 05:16:03,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:03,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468629341] [2023-11-30 05:16:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:03,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:03,095 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:16:03,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:16:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468629341] [2023-11-30 05:16:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468629341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:16:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:16:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:16:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373512173] [2023-11-30 05:16:03,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:16:03,098 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:16:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:16:03,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:16:03,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:16:03,099 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 164 [2023-11-30 05:16:03,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 171 transitions, 502 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:16:03,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:16:03,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 164 [2023-11-30 05:16:03,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:16:05,096 INFO L124 PetriNetUnfolderBase]: 10082/23220 cut-off events. [2023-11-30 05:16:05,097 INFO L125 PetriNetUnfolderBase]: For 6152/6596 co-relation queries the response was YES. [2023-11-30 05:16:05,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49267 conditions, 23220 events. 10082/23220 cut-off events. For 6152/6596 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 244445 event pairs, 4500 based on Foata normal form. 0/21108 useless extension candidates. Maximal degree in co-relation 5445. Up to 12019 conditions per place. [2023-11-30 05:16:05,298 INFO L140 encePairwiseOnDemand]: 158/164 looper letters, 114 selfloop transitions, 4 changer transitions 0/217 dead transitions. [2023-11-30 05:16:05,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 217 transitions, 892 flow [2023-11-30 05:16:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:16:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:16:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-11-30 05:16:05,300 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7195121951219512 [2023-11-30 05:16:05,300 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-11-30 05:16:05,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-11-30 05:16:05,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:16:05,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-11-30 05:16:05,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:16:05,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:16:05,302 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:16:05,302 INFO L307 CegarLoopForPetriNet]: 152 programPoint places, 1 predicate places. [2023-11-30 05:16:05,303 INFO L500 AbstractCegarLoop]: Abstraction has has 153 places, 217 transitions, 892 flow [2023-11-30 05:16:05,303 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:16:05,303 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:05,303 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] [2023-11-30 05:16:05,303 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 05:16:05,303 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-30 05:16:05,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash 772025736, now seen corresponding path program 1 times [2023-11-30 05:16:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:05,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152258171] [2023-11-30 05:16:05,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:05,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:05,406 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:16:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:16:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152258171] [2023-11-30 05:16:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152258171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:16:05,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:16:05,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:16:05,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640050628] [2023-11-30 05:16:05,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:16:05,407 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:16:05,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:16:05,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:16:05,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:16:05,408 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 164 [2023-11-30 05:16:05,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 217 transitions, 892 flow. Second operand has 7 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 states have internal predecessors, (611), 0 states have call successors, (0), 0 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:16:05,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:16:05,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 164 [2023-11-30 05:16:05,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:16:06,254 INFO L124 PetriNetUnfolderBase]: 3790/9164 cut-off events. [2023-11-30 05:16:06,255 INFO L125 PetriNetUnfolderBase]: For 8118/8118 co-relation queries the response was YES. [2023-11-30 05:16:06,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25490 conditions, 9164 events. 3790/9164 cut-off events. For 8118/8118 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 84577 event pairs, 1440 based on Foata normal form. 2712/11356 useless extension candidates. Maximal degree in co-relation 2229. Up to 5015 conditions per place. [2023-11-30 05:16:06,291 INFO L140 encePairwiseOnDemand]: 143/164 looper letters, 46 selfloop transitions, 4 changer transitions 60/181 dead transitions. [2023-11-30 05:16:06,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 181 transitions, 938 flow [2023-11-30 05:16:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:16:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:16:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-11-30 05:16:06,293 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6158536585365854 [2023-11-30 05:16:06,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-11-30 05:16:06,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-11-30 05:16:06,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:16:06,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-11-30 05:16:06,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 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:16:06,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 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:16:06,296 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 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:16:06,296 INFO L307 CegarLoopForPetriNet]: 152 programPoint places, -10 predicate places. [2023-11-30 05:16:06,296 INFO L500 AbstractCegarLoop]: Abstraction has has 142 places, 181 transitions, 938 flow [2023-11-30 05:16:06,296 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 states have internal predecessors, (611), 0 states have call successors, (0), 0 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:16:06,296 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:06,297 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] [2023-11-30 05:16:06,297 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:16:06,297 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-30 05:16:06,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash 238573648, now seen corresponding path program 1 times [2023-11-30 05:16:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734525063] [2023-11-30 05:16:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:06,383 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:16:06,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:16:06,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734525063] [2023-11-30 05:16:06,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734525063] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:16:06,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126920750] [2023-11-30 05:16:06,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:06,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:16:06,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:16:06,410 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:16:06,436 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:16:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:06,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:16:06,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:16:06,483 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:16:06,576 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:16:06,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:16:06,666 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:16:06,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126920750] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:16:06,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:16:06,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-30 05:16:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888956475] [2023-11-30 05:16:06,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:16:06,667 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 05:16:06,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:16:06,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 05:16:06,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-30 05:16:06,668 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 164 [2023-11-30 05:16:06,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 181 transitions, 938 flow. Second operand has 14 states, 14 states have (on average 94.57142857142857) internal successors, (1324), 14 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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:16:06,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:16:06,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 164 [2023-11-30 05:16:06,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:16:07,177 INFO L124 PetriNetUnfolderBase]: 1260/2722 cut-off events. [2023-11-30 05:16:07,177 INFO L125 PetriNetUnfolderBase]: For 5179/5205 co-relation queries the response was YES. [2023-11-30 05:16:07,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9825 conditions, 2722 events. 1260/2722 cut-off events. For 5179/5205 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 18709 event pairs, 0 based on Foata normal form. 0/2721 useless extension candidates. Maximal degree in co-relation 852. Up to 1889 conditions per place. [2023-11-30 05:16:07,197 INFO L140 encePairwiseOnDemand]: 157/164 looper letters, 124 selfloop transitions, 8 changer transitions 0/196 dead transitions. [2023-11-30 05:16:07,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 196 transitions, 1424 flow [2023-11-30 05:16:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 05:16:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 05:16:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1056 transitions. [2023-11-30 05:16:07,201 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6439024390243903 [2023-11-30 05:16:07,201 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1056 transitions. [2023-11-30 05:16:07,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1056 transitions. [2023-11-30 05:16:07,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:16:07,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1056 transitions. [2023-11-30 05:16:07,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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:16:07,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 164.0) internal successors, (1804), 11 states have internal predecessors, (1804), 0 states have call successors, (0), 0 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:16:07,205 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 164.0) internal successors, (1804), 11 states have internal predecessors, (1804), 0 states have call successors, (0), 0 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:16:07,206 INFO L307 CegarLoopForPetriNet]: 152 programPoint places, -29 predicate places. [2023-11-30 05:16:07,206 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 196 transitions, 1424 flow [2023-11-30 05:16:07,207 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 94.57142857142857) internal successors, (1324), 14 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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:16:07,207 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:07,207 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] [2023-11-30 05:16:07,213 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:16:07,412 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,SelfDestructingSolverStorable9 [2023-11-30 05:16:07,412 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-30 05:16:07,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1438470830, now seen corresponding path program 1 times [2023-11-30 05:16:07,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:07,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891096636] [2023-11-30 05:16:07,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:07,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:16:07,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:16:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:16:07,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:16:07,452 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:16:07,452 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2023-11-30 05:16:07,453 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 29 remaining) [2023-11-30 05:16:07,453 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 29 remaining) [2023-11-30 05:16:07,453 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 29 remaining) [2023-11-30 05:16:07,453 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 29 remaining) [2023-11-30 05:16:07,453 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 29 remaining) [2023-11-30 05:16:07,453 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 29 remaining) [2023-11-30 05:16:07,453 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 29 remaining) [2023-11-30 05:16:07,453 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 29 remaining) [2023-11-30 05:16:07,454 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 29 remaining) [2023-11-30 05:16:07,455 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 29 remaining) [2023-11-30 05:16:07,455 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 29 remaining) [2023-11-30 05:16:07,455 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 29 remaining) [2023-11-30 05:16:07,455 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 29 remaining) [2023-11-30 05:16:07,455 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 29 remaining) [2023-11-30 05:16:07,455 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 29 remaining) [2023-11-30 05:16:07,455 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 29 remaining) [2023-11-30 05:16:07,455 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 05:16:07,456 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-30 05:16:07,456 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:16:07,456 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 05:16:07,482 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 05:16:07,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 208 transitions, 434 flow [2023-11-30 05:16:07,514 INFO L124 PetriNetUnfolderBase]: 38/341 cut-off events. [2023-11-30 05:16:07,515 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 05:16:07,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 341 events. 38/341 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1302 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 255. Up to 8 conditions per place. [2023-11-30 05:16:07,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 208 transitions, 434 flow [2023-11-30 05:16:07,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 208 transitions, 434 flow [2023-11-30 05:16:07,521 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:16:07,523 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;@47dd8da9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:16:07,523 INFO L363 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-11-30 05:16:07,586 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:16:07,586 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-11-30 05:16:07,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:16:07,586 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:07,586 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] [2023-11-30 05:16:07,586 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-30 05:16:07,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1513794629, now seen corresponding path program 1 times [2023-11-30 05:16:07,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:07,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243627226] [2023-11-30 05:16:07,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:07,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:07,629 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:16:07,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:16:07,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243627226] [2023-11-30 05:16:07,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243627226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:16:07,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:16:07,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:16:07,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727201347] [2023-11-30 05:16:07,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:16:07,630 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:16:07,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:16:07,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:16:07,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:16:07,631 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 208 [2023-11-30 05:16:07,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 208 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:16:07,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:16:07,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 208 [2023-11-30 05:16:07,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:16:24,516 INFO L124 PetriNetUnfolderBase]: 95466/182753 cut-off events. [2023-11-30 05:16:24,517 INFO L125 PetriNetUnfolderBase]: For 2023/2023 co-relation queries the response was YES. [2023-11-30 05:16:25,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315338 conditions, 182753 events. 95466/182753 cut-off events. For 2023/2023 co-relation queries the response was YES. Maximal size of possible extension queue 5752. Compared 2192483 event pairs, 65814 based on Foata normal form. 41690/185706 useless extension candidates. Maximal degree in co-relation 16533. Up to 91126 conditions per place. [2023-11-30 05:16:26,087 INFO L140 encePairwiseOnDemand]: 182/208 looper letters, 102 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2023-11-30 05:16:26,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 223 transitions, 672 flow [2023-11-30 05:16:26,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:16:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:16:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-11-30 05:16:26,088 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8157051282051282 [2023-11-30 05:16:26,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-11-30 05:16:26,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-11-30 05:16:26,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:16:26,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-11-30 05:16:26,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 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:16:26,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 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:16:26,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 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:16:26,093 INFO L307 CegarLoopForPetriNet]: 192 programPoint places, -2 predicate places. [2023-11-30 05:16:26,093 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 223 transitions, 672 flow [2023-11-30 05:16:26,093 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:16:26,093 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:16:26,094 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] [2023-11-30 05:16:26,094 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 05:16:26,094 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-30 05:16:26,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:16:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1513794630, now seen corresponding path program 1 times [2023-11-30 05:16:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:16:26,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067488830] [2023-11-30 05:16:26,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:16:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:16:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:16:26,147 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:16:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:16:26,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067488830] [2023-11-30 05:16:26,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067488830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:16:26,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:16:26,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:16:26,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359044495] [2023-11-30 05:16:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:16:26,148 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:16:26,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:16:26,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:16:26,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:16:26,149 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 208 [2023-11-30 05:16:26,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 223 transitions, 672 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 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:16:26,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:16:26,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 208 [2023-11-30 05:16:26,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:17:12,245 INFO L124 PetriNetUnfolderBase]: 285740/508057 cut-off events. [2023-11-30 05:17:12,245 INFO L125 PetriNetUnfolderBase]: For 127027/132461 co-relation queries the response was YES. [2023-11-30 05:17:13,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151700 conditions, 508057 events. 285740/508057 cut-off events. For 127027/132461 co-relation queries the response was YES. Maximal size of possible extension queue 12577. Compared 6223898 event pairs, 163202 based on Foata normal form. 0/488135 useless extension candidates. Maximal degree in co-relation 49007. Up to 286856 conditions per place. [2023-11-30 05:17:17,383 INFO L140 encePairwiseOnDemand]: 202/208 looper letters, 153 selfloop transitions, 4 changer transitions 0/283 dead transitions. [2023-11-30 05:17:17,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 283 transitions, 1188 flow [2023-11-30 05:17:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:17:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:17:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2023-11-30 05:17:17,385 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7127403846153846 [2023-11-30 05:17:17,385 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 593 transitions. [2023-11-30 05:17:17,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 593 transitions. [2023-11-30 05:17:17,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:17:17,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 593 transitions. [2023-11-30 05:17:17,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 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:17:17,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 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:17:17,387 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 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:17:17,388 INFO L307 CegarLoopForPetriNet]: 192 programPoint places, 1 predicate places. [2023-11-30 05:17:17,388 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 283 transitions, 1188 flow [2023-11-30 05:17:17,388 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 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:17:17,388 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:17:17,388 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] [2023-11-30 05:17:17,388 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 05:17:17,388 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-30 05:17:17,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:17:17,389 INFO L85 PathProgramCache]: Analyzing trace with hash -321542173, now seen corresponding path program 1 times [2023-11-30 05:17:17,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:17:17,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30048769] [2023-11-30 05:17:17,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:17:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:17:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:17:17,521 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:17:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:17:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30048769] [2023-11-30 05:17:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30048769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:17:17,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:17:17,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:17:17,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993703357] [2023-11-30 05:17:17,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:17:17,522 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:17:17,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:17:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:17:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:17:17,523 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 208 [2023-11-30 05:17:17,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 283 transitions, 1188 flow. Second operand has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 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:17:17,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:17:17,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 208 [2023-11-30 05:17:17,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:17:31,268 INFO L124 PetriNetUnfolderBase]: 64290/127865 cut-off events. [2023-11-30 05:17:31,269 INFO L125 PetriNetUnfolderBase]: For 82885/84821 co-relation queries the response was YES. [2023-11-30 05:17:31,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375423 conditions, 127865 events. 64290/127865 cut-off events. For 82885/84821 co-relation queries the response was YES. Maximal size of possible extension queue 2890. Compared 1468677 event pairs, 34110 based on Foata normal form. 51640/175839 useless extension candidates. Maximal degree in co-relation 25899. Up to 75558 conditions per place. [2023-11-30 05:17:32,298 INFO L140 encePairwiseOnDemand]: 179/208 looper letters, 57 selfloop transitions, 4 changer transitions 80/231 dead transitions. [2023-11-30 05:17:32,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 231 transitions, 1232 flow [2023-11-30 05:17:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:17:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:17:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 757 transitions. [2023-11-30 05:17:32,312 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6065705128205128 [2023-11-30 05:17:32,312 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 757 transitions. [2023-11-30 05:17:32,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 757 transitions. [2023-11-30 05:17:32,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:17:32,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 757 transitions. [2023-11-30 05:17:32,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 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:17:32,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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:17:32,315 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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:17:32,316 INFO L307 CegarLoopForPetriNet]: 192 programPoint places, -18 predicate places. [2023-11-30 05:17:32,316 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 231 transitions, 1232 flow [2023-11-30 05:17:32,316 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 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:17:32,316 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:17:32,316 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] [2023-11-30 05:17:32,316 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 05:17:32,316 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-30 05:17:32,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:17:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1291155285, now seen corresponding path program 1 times [2023-11-30 05:17:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:17:32,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808482238] [2023-11-30 05:17:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:17:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:17:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:17:32,492 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:17:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:17:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808482238] [2023-11-30 05:17:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808482238] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:17:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279671191] [2023-11-30 05:17:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:17:32,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:17:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:17:32,520 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:17:32,568 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:17:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:17:32,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:17:32,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:17:32,655 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:17:32,774 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:17:32,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:17:32,876 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:17:32,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279671191] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:17:32,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:17:32,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-30 05:17:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247527632] [2023-11-30 05:17:32,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:17:32,877 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 05:17:32,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:17:32,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 05:17:32,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-30 05:17:32,878 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 208 [2023-11-30 05:17:32,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 231 transitions, 1232 flow. Second operand has 14 states, 14 states have (on average 117.57142857142857) internal successors, (1646), 14 states have internal predecessors, (1646), 0 states have call successors, (0), 0 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:17:32,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:17:32,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 208 [2023-11-30 05:17:32,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:17:46,726 INFO L124 PetriNetUnfolderBase]: 65390/120733 cut-off events. [2023-11-30 05:17:46,726 INFO L125 PetriNetUnfolderBase]: For 179202/183342 co-relation queries the response was YES. [2023-11-30 05:17:47,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455384 conditions, 120733 events. 65390/120733 cut-off events. For 179202/183342 co-relation queries the response was YES. Maximal size of possible extension queue 2641. Compared 1281242 event pairs, 2420 based on Foata normal form. 0/116013 useless extension candidates. Maximal degree in co-relation 31163. Up to 76062 conditions per place. [2023-11-30 05:17:47,605 INFO L140 encePairwiseOnDemand]: 199/208 looper letters, 173 selfloop transitions, 10 changer transitions 80/349 dead transitions. [2023-11-30 05:17:47,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 349 transitions, 2644 flow [2023-11-30 05:17:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 05:17:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 05:17:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1372 transitions. [2023-11-30 05:17:47,608 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6596153846153846 [2023-11-30 05:17:47,608 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1372 transitions. [2023-11-30 05:17:47,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1372 transitions. [2023-11-30 05:17:47,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:17:47,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1372 transitions. [2023-11-30 05:17:47,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 137.2) internal successors, (1372), 10 states have internal predecessors, (1372), 0 states have call successors, (0), 0 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:17:47,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 208.0) internal successors, (2288), 11 states have internal predecessors, (2288), 0 states have call successors, (0), 0 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:17:47,613 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 208.0) internal successors, (2288), 11 states have internal predecessors, (2288), 0 states have call successors, (0), 0 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:17:47,613 INFO L307 CegarLoopForPetriNet]: 192 programPoint places, -9 predicate places. [2023-11-30 05:17:47,613 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 349 transitions, 2644 flow [2023-11-30 05:17:47,614 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 117.57142857142857) internal successors, (1646), 14 states have internal predecessors, (1646), 0 states have call successors, (0), 0 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:17:47,614 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:17:47,614 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:17:47,619 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:17:47,818 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:17:47,818 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-30 05:17:47,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:17:47,818 INFO L85 PathProgramCache]: Analyzing trace with hash -605593136, now seen corresponding path program 1 times [2023-11-30 05:17:47,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:17:47,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253932086] [2023-11-30 05:17:47,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:17:47,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:17:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:17:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:17:47,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:17:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253932086] [2023-11-30 05:17:47,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253932086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:17:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811391323] [2023-11-30 05:17:47,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:17:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:17:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:17:48,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:17:48,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-30 05:17:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:17:48,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-30 05:17:48,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:17:48,091 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:17:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:17:48,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:17:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:17:48,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811391323] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:17:48,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:17:48,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-11-30 05:17:48,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393217441] [2023-11-30 05:17:48,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:17:48,497 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-30 05:17:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:17:48,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-30 05:17:48,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2023-11-30 05:17:48,500 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 208 [2023-11-30 05:17:48,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 349 transitions, 2644 flow. Second operand has 27 states, 27 states have (on average 117.66666666666667) internal successors, (3177), 27 states have internal predecessors, (3177), 0 states have call successors, (0), 0 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:17:48,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:17:48,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 208 [2023-11-30 05:17:48,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:17:53,200 INFO L124 PetriNetUnfolderBase]: 21830/38054 cut-off events. [2023-11-30 05:17:53,200 INFO L125 PetriNetUnfolderBase]: For 90930/91466 co-relation queries the response was YES. [2023-11-30 05:17:53,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178506 conditions, 38054 events. 21830/38054 cut-off events. For 90930/91466 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 329190 event pairs, 0 based on Foata normal form. 24/38077 useless extension candidates. Maximal degree in co-relation 11866. Up to 29114 conditions per place. [2023-11-30 05:17:53,744 INFO L140 encePairwiseOnDemand]: 201/208 looper letters, 257 selfloop transitions, 11 changer transitions 0/351 dead transitions. [2023-11-30 05:17:53,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 351 transitions, 3348 flow [2023-11-30 05:17:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 05:17:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 05:17:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1735 transitions. [2023-11-30 05:17:53,747 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6416420118343196 [2023-11-30 05:17:53,747 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1735 transitions. [2023-11-30 05:17:53,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1735 transitions. [2023-11-30 05:17:53,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:17:53,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1735 transitions. [2023-11-30 05:17:53,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 133.46153846153845) internal successors, (1735), 13 states have internal predecessors, (1735), 0 states have call successors, (0), 0 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:17:53,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 208.0) internal successors, (2912), 14 states have internal predecessors, (2912), 0 states have call successors, (0), 0 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:17:53,753 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 208.0) internal successors, (2912), 14 states have internal predecessors, (2912), 0 states have call successors, (0), 0 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:17:53,753 INFO L307 CegarLoopForPetriNet]: 192 programPoint places, -25 predicate places. [2023-11-30 05:17:53,753 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 351 transitions, 3348 flow [2023-11-30 05:17:53,754 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 117.66666666666667) internal successors, (3177), 27 states have internal predecessors, (3177), 0 states have call successors, (0), 0 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:17:53,754 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:17:53,754 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:17:53,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-30 05:17:53,959 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-30 05:17:53,961 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-30 05:17:53,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:17:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1593517274, now seen corresponding path program 1 times [2023-11-30 05:17:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:17:53,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995904990] [2023-11-30 05:17:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:17:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:17:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:17:53,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:17:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:17:53,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:17:53,993 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:17:53,993 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 37 remaining) [2023-11-30 05:17:53,993 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 37 remaining) [2023-11-30 05:17:53,993 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 37 remaining) [2023-11-30 05:17:53,993 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 37 remaining) [2023-11-30 05:17:53,993 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 37 remaining) [2023-11-30 05:17:53,994 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 37 remaining) [2023-11-30 05:17:53,994 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 37 remaining) [2023-11-30 05:17:53,994 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 37 remaining) [2023-11-30 05:17:53,994 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 37 remaining) [2023-11-30 05:17:53,994 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 37 remaining) [2023-11-30 05:17:53,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 37 remaining) [2023-11-30 05:17:53,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 37 remaining) [2023-11-30 05:17:53,996 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 05:17:53,996 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-30 05:17:53,997 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:17:53,997 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 05:17:54,018 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 05:17:54,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 252 transitions, 532 flow [2023-11-30 05:17:54,049 INFO L124 PetriNetUnfolderBase]: 49/431 cut-off events. [2023-11-30 05:17:54,049 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 05:17:54,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 431 events. 49/431 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1708 event pairs, 0 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 349. Up to 10 conditions per place. [2023-11-30 05:17:54,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 252 transitions, 532 flow [2023-11-30 05:17:54,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 252 transitions, 532 flow [2023-11-30 05:17:54,056 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:17:54,057 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;@47dd8da9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:17:54,057 INFO L363 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-11-30 05:17:54,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:17:54,058 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-11-30 05:17:54,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:17:54,058 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:17:54,058 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] [2023-11-30 05:17:54,058 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 05:17:54,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:17:54,058 INFO L85 PathProgramCache]: Analyzing trace with hash 678999361, now seen corresponding path program 1 times [2023-11-30 05:17:54,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:17:54,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504498932] [2023-11-30 05:17:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:17:54,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:17:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:17:54,092 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:17:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:17:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504498932] [2023-11-30 05:17:54,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504498932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:17:54,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:17:54,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:17:54,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509514750] [2023-11-30 05:17:54,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:17:54,093 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:17:54,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:17:54,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:17:54,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:17:54,094 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 252 [2023-11-30 05:17:54,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 252 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 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:17:54,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:17:54,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 252 [2023-11-30 05:17:54,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand