/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:07:26,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:07:26,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:07:26,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:07:26,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:07:26,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:07:26,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:07:26,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:07:26,769 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:07:26,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:07:26,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:07:26,771 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:07:26,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:07:26,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:07:26,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:07:26,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:07:26,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:07:26,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:07:26,773 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:07:26,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:07:26,773 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:07:26,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:07:26,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:07:26,775 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:07:26,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:07:26,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:07:26,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:07:26,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:07:26,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:07:26,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:07:26,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:07:26,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:07:26,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:07:26,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:07:26,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:07:26,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:07:26,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:07:26,993 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:07:26,994 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:07:26,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2023-12-05 21:07:28,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:07:28,514 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:07:28,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2023-12-05 21:07:28,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e6197f6/8f84646a06d94ad4bb9a680601849570/FLAGa51e32df4 [2023-12-05 21:07:28,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e6197f6/8f84646a06d94ad4bb9a680601849570 [2023-12-05 21:07:28,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:07:28,555 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:07:28,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:07:28,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:07:28,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:07:28,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:07:28" (1/1) ... [2023-12-05 21:07:28,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c36cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:28, skipping insertion in model container [2023-12-05 21:07:28,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:07:28" (1/1) ... [2023-12-05 21:07:28,604 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:07:28,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:07:28,927 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:07:28,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:07:29,010 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:07:29,010 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:07:29,017 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:07:29,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29 WrapperNode [2023-12-05 21:07:29,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:07:29,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:07:29,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:07:29,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:07:29,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,079 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 165 [2023-12-05 21:07:29,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:07:29,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:07:29,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:07:29,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:07:29,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:07:29,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:07:29,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:07:29,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:07:29,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (1/1) ... [2023-12-05 21:07:29,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:07:29,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:07:29,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:07:29,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:07:29,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:07:29,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:07:29,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:07:29,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:07:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:07:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:07:29,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:07:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:07:29,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:07:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:07:29,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:07:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:07:29,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:07:29,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:07:29,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:07:29,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:07:29,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:07:29,257 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:07:29,429 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:07:29,440 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:07:29,856 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:07:29,963 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:07:29,963 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:07:29,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:07:29 BoogieIcfgContainer [2023-12-05 21:07:29,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:07:29,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:07:29,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:07:29,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:07:29,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:07:28" (1/3) ... [2023-12-05 21:07:29,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2044c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:07:29, skipping insertion in model container [2023-12-05 21:07:29,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:29" (2/3) ... [2023-12-05 21:07:29,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2044c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:07:29, skipping insertion in model container [2023-12-05 21:07:29,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:07:29" (3/3) ... [2023-12-05 21:07:29,973 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2023-12-05 21:07:29,986 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:07:29,986 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-05 21:07:29,986 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:07:30,053 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:07:30,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 302 flow [2023-12-05 21:07:30,134 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-12-05 21:07:30,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:07:30,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-12-05 21:07:30,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 302 flow [2023-12-05 21:07:30,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 90 transitions, 189 flow [2023-12-05 21:07:30,152 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:07:30,159 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;@3ee1dc45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:07:30,159 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-12-05 21:07:30,175 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:07:30,176 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2023-12-05 21:07:30,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:07:30,176 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:30,177 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:30,177 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:30,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:30,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1966369235, now seen corresponding path program 1 times [2023-12-05 21:07:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:30,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123019320] [2023-12-05 21:07:30,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:30,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:07:30,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:30,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123019320] [2023-12-05 21:07:30,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123019320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:30,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:30,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:30,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216839739] [2023-12-05 21:07:30,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:30,542 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:30,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:30,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:30,567 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2023-12-05 21:07:30,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:30,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:30,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2023-12-05 21:07:30,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:30,643 INFO L124 PetriNetUnfolderBase]: 20/154 cut-off events. [2023-12-05 21:07:30,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:07:30,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 154 events. 20/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 380 event pairs, 20 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 166. Up to 53 conditions per place. [2023-12-05 21:07:30,646 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 20 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:07:30,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 229 flow [2023-12-05 21:07:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-12-05 21:07:30,658 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7925407925407926 [2023-12-05 21:07:30,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-12-05 21:07:30,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-12-05 21:07:30,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:30,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-12-05 21:07:30,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:30,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:30,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:30,675 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2023-12-05 21:07:30,675 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 89 transitions, 229 flow [2023-12-05 21:07:30,676 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:30,676 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:30,676 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:30,676 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:07:30,676 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:30,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1966369234, now seen corresponding path program 1 times [2023-12-05 21:07:30,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:30,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446498788] [2023-12-05 21:07:30,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:07:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446498788] [2023-12-05 21:07:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446498788] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672361495] [2023-12-05 21:07:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:30,839 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:30,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:30,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:30,841 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 143 [2023-12-05 21:07:30,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 89 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:30,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:30,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 143 [2023-12-05 21:07:30,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:30,930 INFO L124 PetriNetUnfolderBase]: 28/173 cut-off events. [2023-12-05 21:07:30,931 INFO L125 PetriNetUnfolderBase]: For 33/39 co-relation queries the response was YES. [2023-12-05 21:07:30,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 173 events. 28/173 cut-off events. For 33/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 497 event pairs, 28 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 251. Up to 60 conditions per place. [2023-12-05 21:07:30,936 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 18 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-12-05 21:07:30,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 263 flow [2023-12-05 21:07:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-12-05 21:07:30,942 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8158508158508159 [2023-12-05 21:07:30,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-12-05 21:07:30,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-12-05 21:07:30,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:30,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-12-05 21:07:30,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:30,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:30,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:30,950 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 2 predicate places. [2023-12-05 21:07:30,951 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 88 transitions, 263 flow [2023-12-05 21:07:30,951 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:30,951 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:30,951 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:30,952 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:07:30,952 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:30,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:30,952 INFO L85 PathProgramCache]: Analyzing trace with hash -595767766, now seen corresponding path program 1 times [2023-12-05 21:07:30,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:30,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844404384] [2023-12-05 21:07:30,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:30,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:07:31,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:31,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844404384] [2023-12-05 21:07:31,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844404384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:31,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:31,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:31,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968281651] [2023-12-05 21:07:31,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:31,039 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:31,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:31,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:31,040 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2023-12-05 21:07:31,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 88 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:31,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2023-12-05 21:07:31,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:31,119 INFO L124 PetriNetUnfolderBase]: 28/172 cut-off events. [2023-12-05 21:07:31,119 INFO L125 PetriNetUnfolderBase]: For 99/115 co-relation queries the response was YES. [2023-12-05 21:07:31,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 172 events. 28/172 cut-off events. For 99/115 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 483 event pairs, 28 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 306. Up to 60 conditions per place. [2023-12-05 21:07:31,128 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 19 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-12-05 21:07:31,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 87 transitions, 299 flow [2023-12-05 21:07:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-12-05 21:07:31,130 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7902097902097902 [2023-12-05 21:07:31,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-12-05 21:07:31,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-12-05 21:07:31,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:31,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-12-05 21:07:31,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,134 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 3 predicate places. [2023-12-05 21:07:31,134 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 87 transitions, 299 flow [2023-12-05 21:07:31,135 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,135 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:31,135 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:31,135 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:07:31,136 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:31,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -595767765, now seen corresponding path program 1 times [2023-12-05 21:07:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142247594] [2023-12-05 21:07:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:07:31,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:31,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142247594] [2023-12-05 21:07:31,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142247594] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:31,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:31,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643803223] [2023-12-05 21:07:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:31,301 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:31,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:31,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:31,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:31,303 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 143 [2023-12-05 21:07:31,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 87 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:31,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 143 [2023-12-05 21:07:31,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:31,399 INFO L124 PetriNetUnfolderBase]: 28/171 cut-off events. [2023-12-05 21:07:31,399 INFO L125 PetriNetUnfolderBase]: For 189/215 co-relation queries the response was YES. [2023-12-05 21:07:31,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 171 events. 28/171 cut-off events. For 189/215 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 483 event pairs, 28 based on Foata normal form. 1/165 useless extension candidates. Maximal degree in co-relation 359. Up to 59 conditions per place. [2023-12-05 21:07:31,401 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 17 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-12-05 21:07:31,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 86 transitions, 329 flow [2023-12-05 21:07:31,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-12-05 21:07:31,403 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8135198135198135 [2023-12-05 21:07:31,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-12-05 21:07:31,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-12-05 21:07:31,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:31,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-12-05 21:07:31,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,409 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 4 predicate places. [2023-12-05 21:07:31,410 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 329 flow [2023-12-05 21:07:31,410 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,410 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:31,410 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:31,410 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:07:31,411 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:31,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1605561229, now seen corresponding path program 1 times [2023-12-05 21:07:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762122090] [2023-12-05 21:07:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:07:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762122090] [2023-12-05 21:07:31,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762122090] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:31,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804555843] [2023-12-05 21:07:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:31,534 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:31,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:31,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:31,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:31,536 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 143 [2023-12-05 21:07:31,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:31,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 143 [2023-12-05 21:07:31,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:31,612 INFO L124 PetriNetUnfolderBase]: 27/168 cut-off events. [2023-12-05 21:07:31,612 INFO L125 PetriNetUnfolderBase]: For 308/344 co-relation queries the response was YES. [2023-12-05 21:07:31,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 168 events. 27/168 cut-off events. For 308/344 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 462 event pairs, 12 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 403. Up to 58 conditions per place. [2023-12-05 21:07:31,615 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 18 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-12-05 21:07:31,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 86 transitions, 371 flow [2023-12-05 21:07:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-12-05 21:07:31,617 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8158508158508159 [2023-12-05 21:07:31,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-12-05 21:07:31,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-12-05 21:07:31,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:31,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-12-05 21:07:31,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,622 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2023-12-05 21:07:31,623 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 86 transitions, 371 flow [2023-12-05 21:07:31,623 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,623 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:31,624 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:31,624 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:07:31,625 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:31,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1605561228, now seen corresponding path program 1 times [2023-12-05 21:07:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:31,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010686283] [2023-12-05 21:07:31,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:07:31,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:31,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010686283] [2023-12-05 21:07:31,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010686283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:31,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:31,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:31,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960211604] [2023-12-05 21:07:31,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:31,711 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:31,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:31,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:31,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:31,713 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2023-12-05 21:07:31,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 86 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:31,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2023-12-05 21:07:31,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:31,775 INFO L124 PetriNetUnfolderBase]: 26/169 cut-off events. [2023-12-05 21:07:31,775 INFO L125 PetriNetUnfolderBase]: For 427/473 co-relation queries the response was YES. [2023-12-05 21:07:31,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 169 events. 26/169 cut-off events. For 427/473 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 460 event pairs, 25 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 445. Up to 55 conditions per place. [2023-12-05 21:07:31,777 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 18 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2023-12-05 21:07:31,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 85 transitions, 401 flow [2023-12-05 21:07:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2023-12-05 21:07:31,779 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2023-12-05 21:07:31,779 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2023-12-05 21:07:31,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2023-12-05 21:07:31,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:31,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2023-12-05 21:07:31,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,785 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 6 predicate places. [2023-12-05 21:07:31,785 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 401 flow [2023-12-05 21:07:31,785 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,785 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:31,785 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:31,786 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:07:31,786 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:31,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:31,786 INFO L85 PathProgramCache]: Analyzing trace with hash -41752711, now seen corresponding path program 1 times [2023-12-05 21:07:31,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:31,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730326246] [2023-12-05 21:07:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:31,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:07:31,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:31,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730326246] [2023-12-05 21:07:31,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730326246] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:31,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:31,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:31,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880885505] [2023-12-05 21:07:31,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:31,878 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:31,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:31,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:31,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:31,880 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 143 [2023-12-05 21:07:31,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:31,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 143 [2023-12-05 21:07:31,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:31,946 INFO L124 PetriNetUnfolderBase]: 19/140 cut-off events. [2023-12-05 21:07:31,946 INFO L125 PetriNetUnfolderBase]: For 493/527 co-relation queries the response was YES. [2023-12-05 21:07:31,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 140 events. 19/140 cut-off events. For 493/527 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 324 event pairs, 4 based on Foata normal form. 6/144 useless extension candidates. Maximal degree in co-relation 401. Up to 48 conditions per place. [2023-12-05 21:07:31,948 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 20 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-12-05 21:07:31,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 87 transitions, 477 flow [2023-12-05 21:07:31,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-12-05 21:07:31,949 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2023-12-05 21:07:31,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-12-05 21:07:31,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-12-05 21:07:31,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:31,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-12-05 21:07:31,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,953 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 7 predicate places. [2023-12-05 21:07:31,953 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 87 transitions, 477 flow [2023-12-05 21:07:31,953 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:31,953 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:31,953 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:31,953 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:07:31,953 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:31,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:31,954 INFO L85 PathProgramCache]: Analyzing trace with hash -41752712, now seen corresponding path program 1 times [2023-12-05 21:07:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:31,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821100756] [2023-12-05 21:07:31,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:07:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821100756] [2023-12-05 21:07:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821100756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:32,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:32,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122089182] [2023-12-05 21:07:32,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:32,008 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:32,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:32,009 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2023-12-05 21:07:32,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 87 transitions, 477 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:32,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:32,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2023-12-05 21:07:32,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:32,055 INFO L124 PetriNetUnfolderBase]: 12/127 cut-off events. [2023-12-05 21:07:32,055 INFO L125 PetriNetUnfolderBase]: For 567/609 co-relation queries the response was YES. [2023-12-05 21:07:32,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 127 events. 12/127 cut-off events. For 567/609 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 247 event pairs, 4 based on Foata normal form. 6/131 useless extension candidates. Maximal degree in co-relation 347. Up to 35 conditions per place. [2023-12-05 21:07:32,056 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 0 selfloop transitions, 0 changer transitions 86/86 dead transitions. [2023-12-05 21:07:32,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 86 transitions, 509 flow [2023-12-05 21:07:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-12-05 21:07:32,058 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7902097902097902 [2023-12-05 21:07:32,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-12-05 21:07:32,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-12-05 21:07:32,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:32,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-12-05 21:07:32,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:32,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:32,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:32,061 INFO L308 CegarLoopForPetriNet]: 100 programPoint places, 8 predicate places. [2023-12-05 21:07:32,061 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 86 transitions, 509 flow [2023-12-05 21:07:32,061 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:32,069 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix030_power.opt_pso.opt_rmo.opt.i_BEv2_AllErrorsAtOnce [2023-12-05 21:07:32,094 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-12-05 21:07:32,095 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-12-05 21:07:32,095 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-12-05 21:07:32,095 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-12-05 21:07:32,095 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-12-05 21:07:32,096 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-12-05 21:07:32,096 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-12-05 21:07:32,096 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-12-05 21:07:32,096 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-12-05 21:07:32,096 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-12-05 21:07:32,096 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-12-05 21:07:32,096 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-12-05 21:07:32,097 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:07:32,097 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:32,100 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:07:32,100 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:07:32,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:07:32 BasicIcfg [2023-12-05 21:07:32,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:07:32,107 INFO L158 Benchmark]: Toolchain (without parser) took 3551.98ms. Allocated memory was 338.7MB in the beginning and 431.0MB in the end (delta: 92.3MB). Free memory was 291.6MB in the beginning and 231.8MB in the end (delta: 59.8MB). Peak memory consumption was 153.2MB. Max. memory is 8.0GB. [2023-12-05 21:07:32,107 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 191.9MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:07:32,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.05ms. Allocated memory is still 338.7MB. Free memory was 291.6MB in the beginning and 268.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:32,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.88ms. Allocated memory is still 338.7MB. Free memory was 268.0MB in the beginning and 264.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:32,108 INFO L158 Benchmark]: Boogie Preprocessor took 54.09ms. Allocated memory is still 338.7MB. Free memory was 264.9MB in the beginning and 262.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:32,108 INFO L158 Benchmark]: RCFGBuilder took 829.54ms. Allocated memory is still 338.7MB. Free memory was 262.8MB in the beginning and 222.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-12-05 21:07:32,109 INFO L158 Benchmark]: TraceAbstraction took 2139.73ms. Allocated memory was 338.7MB in the beginning and 431.0MB in the end (delta: 92.3MB). Free memory was 222.4MB in the beginning and 231.8MB in the end (delta: -9.4MB). Peak memory consumption was 84.0MB. Max. memory is 8.0GB. [2023-12-05 21:07:32,111 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 191.9MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 462.05ms. Allocated memory is still 338.7MB. Free memory was 291.6MB in the beginning and 268.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.88ms. Allocated memory is still 338.7MB. Free memory was 268.0MB in the beginning and 264.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.09ms. Allocated memory is still 338.7MB. Free memory was 264.9MB in the beginning and 262.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 829.54ms. Allocated memory is still 338.7MB. Free memory was 262.8MB in the beginning and 222.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2139.73ms. Allocated memory was 338.7MB in the beginning and 431.0MB in the end (delta: 92.3MB). Free memory was 222.4MB in the beginning and 231.8MB in the end (delta: -9.4MB). Peak memory consumption was 84.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=509occurred in iteration=8, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:07:32,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...